Quicksort algorithm based on the theory of division - and - conquer and recursion 基于分治与递归策略的快速排序算法
Our system proved satisfactory with quicksort , cube , longest platform , and so on . we hope to improve apla ~ delphi program auto - transformation system , and its reliability , write more apla example and apply for patent 进一步的工作包括完善apla delphi自动程序转换系统的转换机制;提高apla delphi自动程序转换系统的可靠性;增加apla转换实例,使产品的商品化程度提高,并积极准备申请专利。
百科解释
Quicksort, or partition-exchange sort, is a sorting algorithm that, on average, makes O(n?log?n) comparisons to sort n items. In the worst case, it makes O(n2) comparisons, though this behavior is rare.