Algorithm: Quick Sort

1 #Coding:utf-82 3 ImportRandom4 Import Time5 6t =time.time ()7 8 #Fast Sorting segmentation algorithm, reference self-programming Zhu Ji Nanxiong9 #[L, R] is closed intervalTen defpartion (A, L, R): One     #tmp = a[0] A     ifL >=r: -         return -m =L the     #for I in range (1, Len (a)): -      forIinchRange (L + 1, R + 1): -         ifA[i] <A[l]: -M + = 1 +A[M], a[i] =A[i], A[m] -  +A[l], a[m] =A[m], A[l] APartion (A, L, m-1) atPartion (A, M + 1, R) -     returnm -  - #def qsort (): - if __name__=="__main__": -N = 100000 inA = [Random.randint (1,100000) forIinchrange (N)] -Partion (A, 0, N-1) to     Printa +b =a[:]; A.sort () -     Printb = =a the     PrintTime.time ()-T

Fast-sorting Python implementations

References: Programming Zhu Ji Nanxiong

Algorithm: Quick Sort