http://dahoiv.net/programmering/uncategorized/quick-sort - My programming projects Thu, 07 Aug 2008 22:43:30 +0000 http://wordpress.org/?v=2.2.1 http://dahoiv.net/programmering/uncategorized/quick-sort#comment-156 Daniel Høyer Iversen Sat, 07 Jun 2008 13:31:10 +0000 http://dahoiv.net/programmering/uncategorized/quick-sort#comment-156 http://en.wikipedia.org/wiki/Quicksort : Quicksort is a well-known sorting algorithm developed by C. A. R. Hoare that, on average, makes O(nlogn) (big O notation) comparisons to sort n items. However, in the worst case, it makes Θ(n2) comparisons. Typically, quicksort is significantly faster in practice than other Θ(nlogn) algorithms, because its inner loop can be efficiently implemented on most architectures, and in most real-world data it is possible to make design choices which minimize the probability of requiring quadratic time. http://en.wikipedia.org/wiki/Quicksort :
Quicksort is a well-known sorting algorithm developed by C. A. R. Hoare that, on average, makes O(nlogn) (big O notation) comparisons to sort n items. However, in the worst case, it makes Θ(n2) comparisons. Typically, quicksort is significantly faster in practice than other Θ(nlogn) algorithms, because its inner loop can be efficiently implemented on most architectures, and in most real-world data it is possible to make design choices which minimize the probability of requiring quadratic time.

]]>