Proposal of Fast Counting Sort

Title & Authors
Proposal of Fast Counting Sort
Lee, Sang-Un;

Abstract
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 $\small{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
Keywords
Language
Korean
Cited by
References
1.
T. H. Cormen, C. E. Leiserson, R. L. Rivest, and C. Stein, "Introduction to Algorithms, MIT Press, ISBN: 9780262033848, 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-13: 978-0201314526, 1998.

4.
S. Nilson, "The Fastest Sorting Algorithm?", Dr. Dobb's Journal, Vol. 311, pp. 38-45, Apr. 2000.

5.
P. Indyk and C. Wenk, "CS445: Introduction to Algorithms, Sorting in Linear Time", Dept. of Computer Science, The University of Arizona, 2007.

6.
H. W. Lang, "Sequential and Parallel Sorting Algorithms: Quicksort," FH Flensberg, 2011.

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