文件名称:Quick-Sort
介绍说明--下载内容均来自于网络,请自行研究使用
快速排序(Quicksort)是对冒泡排序的一种改进。由C. A. R. Hoare在1962年提出。它的基本思想是:通过一趟排序将要排序的数据分割成独立的两部分,其中一部分的所有数据都比另外一部分的所有数据都要小,然后再按此方法对这两部分数据分别进行快速排序,整个排序过程可以递归进行,以此达到整个数据变成有序序列。
-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.
-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.
(系统自动生成,下载前可以参看下载内容)
下载文件列表
快速排序\quicksort.cpp
快速排序
快速排序