数据结构考研分类复习真题 第十章 答案[14]

设待排序记录的个数为n则快速排序的最小递归深度为ëlognû+最大递归深度n

平均性能最佳的排序方法是快速排序该排序方法不稳定

初始序列:

一趟排序: [] []

二趟排序: [] [] []

三趟排序:

[] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] []