Title & Authors
Lee, Sang-Un;

Abstract
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 $\small{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.
Keywords
Language
Korean
Cited by
References
1.
T. H. Cormen, C. E. Leiserson, R. L. Rivest, and C. Stein, "Introduction to Algorithms, Chapter 7. Quicksort", 2nd Ed., pp. 145-164, MIT Press, ISBN: 978-0262033848, 2005.

2.
D. B. Ring, "A Comparison of Sorting Algorithms", http://www.devx.com/vb2themax/ Article/ 19900, 2003.

3.
R. Sedgewick, "Algorithms in C, Parts 1-4: Fundamentals, Data Structures, Sorting, Searching", 3rd Ed., Addison-Wesley, ISBN:978-0201314526, 1998.

4.
S. Nilson, "The Fastest Sorting Algorithm?", http://drdobs.com/architecture-and-design/184404062, Dr. Dobb's Journal, Vol. 311, pp. 38-45, 2000.

5.
H. W. Lang, "Sequential and Parallel Sorting Algorithms, Quicksort", FH Flensberg, http:// www.nf.fh-flensburg.de/lang/algorithmen/sortiere n/quick/quicken.htm, 2011.

6.
C. A. R. Hoare, "Quicksort," The Computer Journal, Vol. 5, No. 1, pp. 10-16, doi: 10.1093/comjnl/5.1.10, 1962.