diff --git a/sorting/quick_sort.py b/sorting/quick_sort.py new file mode 100644 index 0000000..cbb917c --- /dev/null +++ b/sorting/quick_sort.py @@ -0,0 +1,28 @@ +# This function takes last element as pivot, places +# the pivot element at its correct position in sorted +# array, and places all smaller (smaller than pivot) +# to left of pivot and all greater elements to right +# of pivot +def partition(arr,low,high): + i = ( low-1 ) + pivot = arr[high] + + for j in range(low , high): + if arr[j] <= pivot: + i = i+1 + arr[i],arr[j] = arr[j],arr[i] + + arr[i+1],arr[high] = arr[high],arr[i+1] + return ( i+1 ) + + +def quickSort(arr,low,high): + if low < high: + + pi = partition(arr,low,high) + + quickSort(arr, low, pi-1) + quickSort(arr, pi+1, high) + + +
Note: This service is not intended for secure transactions such as banking, social media, email, or purchasing. Use at your own risk. We assume no liability whatsoever for broken pages.
Alternative Proxies: