Description: Quick Sort thinking: The question sort n records in the office for a record (usually from the first record), all less than the record of the record to its left, all larger than the record of the record to its right, selected records should be exactly in its position, and the original sequence is divided into two sub-sequences. Then, two sub-sequences, respectively, to repeat the process until all records are lined up sequence. To participate in the current record of sort by the first record of the sort code is divided into two parts before and after the process is known as a trip quick sort.
- [mtqp] - Horse riding on the chessboard is a numb
- [pages] - To achieve without the use of JS refresh
- [exam] - Primary school examination system, the m
- [sortCompare] - Various sorting algorithm BubbleSort, Di
- [quickSort] - vc++2005 prepared Quicksort algorithm, w
File list (Check if you may need any files):
Download