Description: Quick sort (Quicksort) is a bubble sort of an improvement. By the CAR Hoare in 1962. The basic idea is: a trip to sort through the data to be sorted is divided into two independent parts, one part of the part of all of the data than the other, all data should be small, and then part of the data here are two methods for rapid sorting, the sorting process can be recursive in order to achieve the data into an orderly sequence.
To Search:
File list (Check if you may need any files):
快速排序\quicksort.cpp
快速排序
Download