設待排序記錄的個數為n則快速排序的最小遞歸深度為ëlognû+最大遞歸深度n
平均性能最佳的排序方法是快速排序該排序方法不穩定
初始序列: 一趟排序: [] [] 二趟排序: [] [] [] 三趟排序:
[] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] []
