基于分治与递归策略的快速排序算法

Quicksort Algorithm Based on the Theory of Division-and-Conquer and Recursion

论述了运用分治法的思想实现快速排序算法．首先阐述分治法的基本思想，其次应用分治与递归策略用Java语言实现快速排序算法，然后再用实例说明此算法的工作过程，最后分析了最好情况、最坏情况和平均情况下的时间复杂性，得出快速排序算法在渐进意义上最优．

The basic thought of the divide-and-conquer and recursion theory was expounded.The realization of quicksort algorithm by using the language of Java was illustrated.The time complexity in the best,the worst and the average circumstance was analysed.The result shows that quicksort algorithm is superior in asymptotic meaning.