快速排序(国外英语资料).docVIP

快速排序(国外英语资料) Quick sort algorithm directory [hide] basic thought Algorithm process Qsort standard range for Pascal Qsort in Java [edit this paragraph] basic idea An improvement of quick sort to bubble sort. The basic idea is: through a sort to two part sorting data into independent, a part of all of the data are all data than another to be a small part, and then according to the method of the two part of the data were quick sort, the ordering process can be performed recursively, in order to achieve the data into an orderly sequence. [edit this paragraph] algorithmic process The array to be sorted is A[0]...... A[N-1], first select an arbitrary data (usually the first choice of data) as the key data, and then all it smaller than the number in front of it, all the larger number of put it all behind, this process is called a lie quick sort. Lie fast sorting algorithm is: 1) set two variables, I, J, when the sort begins: I=1, J=N; 2) assign the value of the first array element as the key data to X, that is, X=A[1]; 3) start a search from the J, that is, start the forward search (J=J-1) and find the first value less than X, so that the value is exchanged with the X; 4) start a backward search from the I, that is, by starting the backward search (I=I+1), and finding the first value greater than the X to exchange the value with the X; 5) repeat third, fourth steps until I=J; For example, the values of the array A to be sorted are: (initial key data: X=49) A[0], A[1], A[2], A[3], A[4], A[5], A[6]: 49386597761327 After the first exchange: 27386597761349 Follow the third steps of the algorithm After second exchanges: 27384997761365 (in the fourth step of the algorithm, look for the value of X from the front, 6549, and both, at this time: I=3) After third exchanges: 27381397764965 (in the fifth step of the algorithm, the third step of the algorithm is started again After fourth exchanges: 27381349769765 (in the fourth step of the algorithm, find the value greater than X from