Description: Quick Sort (Quicksort) is an improvement on the bubble sort. Presented by the CAR Hoare in 1962. Its basic idea is: a trip to sort through the data to be sorted is divided into two separate parts, one part of all of the data than the other should be a small part of all the data, then the data for the two parts to this method are fast sort, the sorting process can recursively, in order to achieve the data into an ordered sequence.
To Search:
File list (Check if you may need any files):
2.3快速排序\2.3.cbp
...........\check.cpp
...........\input.txt
...........\main.cpp
...........\output.txt
...........\quicksort.cpp
...........\quicksort.h
2.3快速排序
Download