Tight lower bounds for shellsort
No. 318 on SWAT 88: 1st Scandinavian workshop on algorithm theory
Fundamentals of Computer Alori
Fundamentals of Computer Alori
Double sorting: testing their sorting skills
Proceedings of the 41st ACM technical symposium on Computer science education
| Hi-index | 0.00 |
Sorting is one of the most common and important computing operations. In analyzing and comparing sorting algorithms, we consider their execution times, as indicated by the number of operations they execute as they sort n elements. The simplest algorithms have times that grow approximately as n2, while more complex algorithms offer times that grow approximately as n log n. This paper pursues a contrary goal: a sorting algorithm whose time grows more quickly than that of the well-known algorithms. The paper exhibits and analyzes such an algorithm.