Python Quick Sort

Quick Sort

The first one is very inefficient.

1 defQuickSort (array, Low, high):2     ifLow >=High :3         return4I, j =Low , high5TMP =Array[low]6      whileTrue:7          whileARRAY[J] > tmp andI <J:8J-= 19         ifI <J:TenArray[i] =Array[j] Onei + = 1 A          whileARRAY[J] < tmp andI <J: -i + = 1 -         ifI <J: theARRAY[J] =Array[i] -J-= 1 -         Else: -              Break +Array[i] =tmp -QuickSort (array, Low, i-1) +QuickSort (Array, j + 1, High)

The second way of writing, embodies the advantages of Python, very concise, fast

1 defQuickSort (L):2     ifLen (L) <= 1:3         returnL4Pivot =L[0]5lessor = QuickSort ([x forXinchL[1:]ifX <Pivot])6larger = QuickSort ([x forXinchL[1:]ifX >=Pivot])7     returnlessor + [Pivot] + larger

Of course, such a simple sort would be much less efficient than Python's built-in sorting algorithm.

Python Quick Sort