niyue

关于QuickSort的一些资料

In programming on May 27, 2005 at 11:49 AM

准备综合一些资料写一篇Quicksort方面的介绍文章,搜集到了以下一些感觉不错的资料:

Quicksort From Wikipedia, the free encyclopedia.

Quicksort is a well-known sorting algorithm developed by C. A. R. Hoare that, on average, makes Θ(n log n) comparisons to sort n items. However, in the worst-case, it makes Θ(n2) comparisons. Typically, quicksort is significantly faster in practice than other O(n log n) 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 possibility of requiring quadratic time.

  1. Quicksort or Samplesort Algorithm
  2. An elegant improvement of Quicksort
  3. Quicksort
  4. Quicksort algorithms with an early exit for sorted subfiles
  5. Data Structures and Algorithms: Quicksort
Advertisements

Leave a Reply

Fill in your details below or click an icon to log in:

WordPress.com Logo

You are commenting using your WordPress.com account. Log Out / Change )

Twitter picture

You are commenting using your Twitter account. Log Out / Change )

Facebook photo

You are commenting using your Facebook account. Log Out / Change )

Google+ photo

You are commenting using your Google+ account. Log Out / Change )

Connecting to %s

%d bloggers like this: