Quick Sort--python

Quick sort:

Select a datum in a set of data, let the data be divided into two parts, a portion is greater than the baseline, part is less than the baseline, and then this method to group two sections until no more points.

A concept of recursive and divide-and-conquer concepts needs to be understood.

Python implementations:

1 #Quick Sort2 3 ImportRandom4 5 defQuick_sort (arr):6     #Boundary Conditions7     ifLen (arr) < 2:8         returnarr9Key = Random.choice (arr)#Select BenchmarkTenleft = [i forIinchArrifI <Key] OnePivot = [I forIinchArrifi = =Key] Aright = [I forIinchArrifi >Key] -     #If you want to remove duplicate elements, use key to replace pivot . -     returnQuick_sort (left) + pivot +Quick_sort (right) the  -L = [1, 2, 3,-8, 2,-2,-2, 4, 9,-5, 1, 6, 5] - Print(Quick_sort (L))

Quick Sort--python