Python for quick sorting

Using Python for quick sorting

Idea: Use each of the data in the list compared to the last one, the right side is bigger than the last, and the last one is left. Determine the last position first. It then recursively calls, sorting all the data from small to large.

Code:

defQuc (array,start,end):ifStart <=end:j=Quicly_sort (array,start,end) Quc (array,start,j-1) Quc (array,j+1, end)defQuicly_sort (array,start,end):ifstart<=end:j=Start forIinchRange (start,end):ifArray[i] <Array[end]: array[j],array[i]=Array[i],array[j] J+ = 1Array[j],array[end]=Array[end],array[j]returnJ
Li= [1,2,3,4,5,3,2,3,3,3,32,4,9,0,5,2]quc (Li,0,len (LI)-1)Print(LI)

Python for quick sorting