＜算法导论＞练习7.1

7.1-1
13,19,9,5,12,8,7,4,21,2,6,11
13,19,9,5,12,8,7,4,21,2,6,11
13,19,9,5,12,8,7,4,21,2,6,11
9,19,13,5,12,8,7,4,21,2,6,11
9,5,13,19,12,8,7,4,21,2,6,11
9,5,13,19,12,8,7,4,21,2,6,11
9,5,8,19,12,13,7,4,21,2,6,11
9,5,8,7,12,13,19,4,21,2,6,11
9,5,8,7,4,13,19,12,21,2,6,11
9,5,8,7,4,13,19,12,21,2,6,11
9,5,8,7,4,2,19,12,21,13,6,11
9,5,8,7,4,2,6,12,21,13,19,11
9,5,8,7,4,2,6,11,21,13,19,12
​
7.1-2
元素全相等时返回r。
7.1-3
partition内部的for循环的时间复杂度是r-p-1=$O(n)$,其余的部分执行需要常数项时间。所以总的时间复杂度为$\Theta (n)$

7.1-4
只需要把PARTITION中第四行的条件，A[i]<=x.改为A[i]>=x即可。