• Title/Summary/Keyword: Bucket sort

Search Result 3, Processing Time 0.013 seconds

Virtual Radix Counting Bucket sort (가상의 기수계수버킷 정렬)

  • Lee, Sang-Un
    • The Journal of the Institute of Internet, Broadcasting and Communication
    • /
    • v.15 no.6
    • /
    • pp.95-102
    • /
    • 2015
  • Generally, there is no sorting algorithm much faster than O(nlogn). The quicksort has a best performance O(nlogn) in best and average-case, and $O(n^2)$ in worst-case. This paper suggests virtual radix counting bucket sort such that counting the frequency of numbers in each radix digit, and moves the arbitrary number to proper virtual bucket in the array, and divides the array into radix digit numbers virtually. Also, this algorithm moves the data to proper location within an array for using the minimum auxiliary memory. This algorithm performs k-times such that the number of k digits in given data and the time complexity is O(n). Therefore, this algorithm has a O(kn) time complexity.

Proposal of Fast Counting Sort (빠른 계수 정렬법의 제안)

  • Lee, Sang-Un
    • The Journal of the Institute of Internet, Broadcasting and Communication
    • /
    • v.15 no.5
    • /
    • pp.61-68
    • /
    • 2015
  • Among comparison sorts, no algorithm excels a current set lower bound of O(nlogn) in operation. Quicksort, the fastest of its kind, has a complexity of O(nlogn) at its best and on average and $O(n^2)$ at worst. This paper thus presents two methods: first is an O(n+k) simple counting sort which operates much more speedily than an O(n+k), (k=maximum value) counting sort, and second is an O(ln) radix counting sort which counts the frequency of numbers in the digit l of a data and saves it in a corresponding virtual bucket in an array, only to virtually divide the array into radix digit numbers. For the 6 experimental data, the proposed algorithm makes O(nlogn) or $O(n^2)$ of Quicksort simple into O(n+k) or O(ln). After all, the proposed sorting algorithm has proved to be much faster than the counting sort and Quicksort.

A Study on the MDS Blasting Method Applicability by Test Field Construction (시험시공을 통한 MDS 발파공법의 현장 적용성에 관한 연구)

  • Bong-Hyun Lee;Sung-Oong Choi
    • Explosives and Blasting
    • /
    • v.42 no.1
    • /
    • pp.23-33
    • /
    • 2024
  • Recently, various techniques and patented methods on blasting operation are being newly developed. In this study, test construction of the MDS blasting method was performed, and the fragmentation size and the occurrence rate of rocks exceeding 300mm were measured and analyzed in comparing to normal blasting method. Test construction was performed three times each for normal and the MDS at the same bench for each round, and fragmentation size(P80) and occurrence rate of rocks exceeding 300mm(S30) were measured using digital image processing. A sieve bucket was also manufactured on-site to sort oversized rock particles from muck piles, and their weights and equivalents were measured to calculate actual values. As a result, the fragmentation size decreased of 21.0% with the MDS compared to normal, and 100-S30 decreased of 10.1%, with actual values decreasing of 7.6%. Although there were variations in blasting effects for each round due to differences in rock quality at site, overall, the MDS proved to be more effective compared to normal blasting method under equivalent conditions.