《数据结构与算法》Chap10 sorting.pptVIP

* Although both are on the order of nlogn, if we were to develop more-accurate formulas to reflect their actual efficiency, we would see that the quick sort is actually more efficient. We recommend that you use the straight insertion sort for small lists and the quick sort for large lists. * The process of quick sort Part One: exchange the left elements and the pivot To determine the correct position for the pivot element, we work from the two ends of the array toward the middle. Quick sort is most efficient when the pivot’s location is the middle of the array. After calling the median left