Python Program - Quick Sort
Quick sort is a divide and conquer algorithm. It is based on the idea of choosing one element as a pivot and partitioning the array around the pivot with left side of the pivot containing all elements less than the pivot and right side of the pivot containing all elements greater than the pivot. There are many ways to choose the pivot. Few of them are mentioned below:
- First element of the array
- Last element of the array
- Random element of the array
- Median index element of the array
The quick sort has less space complexity as compared to merged sort because it do not use auxiliary array.
To understand the quick sort, lets consider an unsorted array [-4, 1, 25, 50, 8, 10, 23] and discuss each step taken to sort the array in ascending order.
In the implementation of this example, the last element of the array is chosen as the pivot element. At the start of the partition process, variables i and j are created which are the same initially. As the partition progresses the value of i and j becomes different. i signifies the boundary between elements less than the pivot and elements greater than pivot. j signifies the boundary between elements greater than pivot and unpartitioned array.
After partition, it generates two partition with left side partition contains elements less than pivot and right side partition contains elements greater than pivot. The both partition are again partitioned with the same logic and this process continues till a partition has zero or one element. The final outcome of this process will be a sorted array.
Implementation of Quick Sort
# function for quick sort which calls partition function # to arrange and split the list based on pivot element # quicksort is a recursive function def quicksort(MyList, left, right): if left < right: pivot = partition(MyList, left, right) quicksort(MyList, left, pivot-1) quicksort(MyList, pivot+1, right) # partition function arrange and split the list # into two list based on pivot element # In this example, last element of list is chosen # as pivot element # one list contains all elements less than the pivot element # another list contains all elements greater than the pivot element def partition(MyList, left, right): i = left pivot = MyList[right] for j in range(left, right): if(MyList[j] < pivot): MyList[i], MyList[j] = MyList[j], MyList[i] i = i + 1 MyList[i], MyList[right] = MyList[right], MyList[i] return i # function to print list def PrintList(MyList): for i in MyList: print(i, end=" ") print("\n") # test the code MyList = [-4, 1, 25, 50, 8, 10, 23] n = len(MyList) print("Original List") PrintList(MyList) quicksort(MyList, 0, n-1) print("Sorted List") PrintList(MyList)
The above code will give the following output:
Original List -4 1 25 50 8 10 23 Sorted List -4 1 8 10 23 25 50
The time complexity of quick sort is Θ(N²) in worst case and the time complexity in best and average cases are Θ(NlogN).