本文原创，转载请注明地址 http://www.cnblogs.com/baokang/p/4737492.html

伪代码

 1 quicksort(A, lo, hi) 2  if lo < hi 3   p = partition(A, lo, hi) 4   quicksort(A, lo, p - 1) 5   quicksort(A, p + 1, hi) 6  7 partition(A, lo, hi) 8   pivot = A[hi] 9   i = lo //place for swapping10   for j = lo to hi - 111     if A[j] <= pivot12       swap A[i] with A[j]13       i = i + 114   swap A[i] with A[hi]15   return i

原标题：QuickSort 快速排序 基于伪代码实现

关键词：排序