Title:
With-partition-method-of-quick-sort
Download
Description: The main idea of the quick sort: find the first number as a reference, the array from an array of the first number back to start, at the same time, the last digit from an array, forward if the previous number larger than the reference value, find out, the number after the smaller than the reference value, they exchange position, when they met, stop. As a result, the front of the meeting point of the Numbers are smaller than the reference value, the meeting point at the back of the values are larger than the reference value, and then meet some split into two pieces, to just their work.
To Search:
File list (Check if you may need any files):
With partition method of quick sort.docx
