def partition(shuzu, p, r): x = a[r] i = p - 1 j = p while j < r: if shuzu[j] < x: i = i + 1 a[i],a[j] = a[j],a[i] j = j + 1 a[i + 1],a[r] = a[r],a[i + 1] return i + 1 def quickSort(shuzu, low, high): if low < high: mid = partition(shuzu, low, high) quickSort(shuzu, low, mid-1) quickSort(shuzu, mid+1, high)
原文：http://my.oschina.net/stevenKelly/blog/390424