[Shuo. Love Python] QuickSort (Quick Sort)

Def partition (a, i, j):     k = -1    while  True:        while k *  (A[i] - a[j])  >= 0:            if i ==  j:                  return i            j += k         a[i], a[j] = a[j], a[i]         i, j, k = j, i - k, -kdef qsort (a, i ,  j):     if i < j:        k  = partition (a, i, j)         qsort (A, i, &NBSP;K&NBSP;-&NBSP;1)          qsort (A, k + 1, j) Def quickSort (a):     qsort (A, 0, len (a)  - 1) if __name__ ==  ' __main__ ':     from random import shuffle    data = range (100)     shuffle (data)     print  ' before:\n ', data     quicksort (data)     print  ' after:\n ',  data

Liu Shuo teacher python fine course:

" Python advanced Programming Skills Combat":

" python algorithm Combat video Course":

" Python scientific Computing-numpy Combat Course": < Strong style= "padding:0px;margin:0px;" >

panda tv Live room:

http://www.panda.tv/671023

[Shuo. Love Python] QuickSort (Quick Sort)