Deprecated: Assigning the return value of new by reference is deprecated in /customers/dahoiv.net/dahoiv.net/httpd.www/programmering/wp-includes/cache.php on line 36
Deprecated: Assigning the return value of new by reference is deprecated in /customers/dahoiv.net/dahoiv.net/httpd.www/programmering/wp-includes/query.php on line 21
Deprecated: Assigning the return value of new by reference is deprecated in /customers/dahoiv.net/dahoiv.net/httpd.www/programmering/wp-includes/theme.php on line 507
Warning: Cannot modify header information - headers already sent by (output started at /customers/dahoiv.net/dahoiv.net/httpd.www/programmering/wp-includes/cache.php:36) in /customers/dahoiv.net/dahoiv.net/httpd.www/programmering/wp-includes/feed-rss2-comments.php on line 2 Quick sort | Programming
http://dahoiv.net/programmering/uncategorized/quick-sort
- My programming projects and some linux tipsFri, 30 Jul 2010 09:51:40 +0000http://wordpress.org/?v=2.2.1Quick sort | Programming
http://dahoiv.net/programmering/uncategorized/quick-sort#comment-156
Daniel Høyer IversenSat, 07 Jun 2008 13:31:10 +0000http://dahoiv.net/programmering/uncategorized/quick-sort#comment-156http://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.
]]>