《数据结构与算法》Chapsorting.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 algorithm, the pivot key is then moved to a hold area to facilitate the processing. This move is actually the first part of an exchange that will put the pivot key in its correct location. Part Two: exchange elements on the left and the right side of the pivot To help follow the sort, envision two walls, one on the left just after the pivot and one on the right . We start at the left wall and move right while looking for an element that belongs on the right of the pivot. Then we start at the right wall and move left while looking for an element that belongs on the left of the pivot. At this point we exchange the two elements. Repeat the process until the walls have crossed. Move the data in the pivot’s location to the first element of the array and then move the pivot back to the array. the pivot element is in its correct location in the array. The elements on the left of the pivot are all less than the pivot, and the elements on the right of the pivot are all greater than the pivot. Any equal data would be found on the right of the pivot. Part Three: Recursively call the quick sort After placing the pivot key in its correct location, we recursively call quick sort to sort the left partition. When the left partition is completely sorted, we recursively call quick sort to sort the right partition. When both the left partition and the right partition have been sorted,