算法Sedgewick第四版-第1章基础-2.3 Quicksort-001快速排序

一、

1.特点

(1)The quicksort algorithm’s desirable features are that it is in-place (uses only a small auxiliary stack) and that
it requires time proportional to N log N on the average to sort an array of length N.

(2)quicksort has a shorter inner loop than most other sorting algorithms, which means that it is fast in practice as well as in theory.

 

 

2.缺点：

(1)Its primary drawback is that it is fragile in the sense that some care is involved in the implementation to be sure to avoid bad performance.

 

(2)

二、

转载于:https://www.cnblogs.com/shamgod/p/5435179.html