Quick Sort Implementation Python


Following are the implementations of QuickSort:

  • Python3

# Python3 implementation of QuickSort

# This Function handles sorting part of quick sort

# start and end points to first and last element of

# an array respectively

def partition(start, end, array):

# Initializing pivot's index to start

pivot_index = start

pivot = array[pivot_index]

# This loop runs till start pointer crosses

# end pointer, and when it does we swap the

# pivot with element on end pointer

while start < end:

# Increment the start pointer till it finds an

# element greater than pivot

while start < len (array) and array[start] < = pivot:

start + = 1

# Decrement the end pointer till it finds an

# element less than pivot

while array[end] > pivot:

end - = 1

# If start and end have not crossed each other,

# swap the numbers on start and end

if (start < end):

array[start], array[end] = array[end], array[start]

# Swap pivot element with element on end pointer.

# This puts pivot on its correct sorted place.

array[end], array[pivot_index] = array[pivot_index], array[end]

# Returning end pointer to divide the array into 2

return end

# The main function that implements QuickSort

def quick_sort(start, end, array):

if (start < end):

# p is partitioning index, array[p]

# is at right place

p = partition(start, end, array)

# Sort elements before partition

# and after partition

quick_sort(start, p - 1 , array)

quick_sort(p + 1 , end, array)

# Driver code

array = [ 10 , 7 , 8 , 9 , 1 , 5 ]

quick_sort( 0 , len (array) - 1 , array)

print (f 'Sorted array: {array}' )


Sorted array: 1 5 7 8 9 10

Analysis of QuickSort
Time taken by QuickSort, in general, can be written as following.

T(n) = T(k) + T(n-k-1) + theta(n)

The first two terms are for two recursive calls, the last term is for the partition process. k is the number of elements which are smaller than pivot.
The time taken by QuickSort depends upon the input array and partition strategy. Following are three cases.

Worst Case: The worst case occurs when the partition process always picks greatest or smallest element as pivot. If we consider above partition strategy where last element is always picked as pivot, the worst case would occur when the array is already sorted in increasing or decreasing order. Following is recurrence for worst case.

T(n) = T(0) + T(n-1) + theta(n) which is equivalent to T(n) = T(n-1) + theta(n)

The solution of above recurrence is theta (n2).

Best Case: The best case occurs when the partition process always picks the middle element as pivot. Following is recurrence for best case.

T(n) = 2T(n/2) + theta(n)

Why Quick Sort is preferred over MergeSort for sorting Arrays
Quick Sort in its general form is an in-place sort (i.e. it doesn’t require any extra storage) whereas merge sort requires O(N) extra storage, N denoting the array size which may be quite expensive. Allocating and de-allocating the extra space used for merge sort increases the running time of the algorithm. Comparing average complexity we find that both type of sorts have O(NlogN) average complexity but the constants differ. For arrays, merge sort loses due to the use of extra O(N) storage space.
Most practical implementations of Quick Sort use randomized version. The randomized version has expected time complexity of O(nLogn). The worst case is possible in randomized version also, but worst case doesn’t occur for a particular pattern (like sorted array) and randomized Quick Sort works well in practice.
Quick Sort is also a cache friendly sorting algorithm as it has good locality of reference when used for arrays.
Quick Sort is also tail recursive, therefore tail call optimizations is done.

Why MergeSort is preferred over QuickSort for Linked Lists?
In case of linked lists the case is different mainly due to difference in memory allocation of arrays and linked lists. Unlike arrays, linked list nodes may not be adjacent in memory. Unlike array, in linked list, we can insert items in the middle in O(1) extra space and O(1) time. Therefore merge operation of merge sort can be implemented without extra space for linked lists.
In arrays, we can do random access as elements are continuous in memory. Let us say we have an integer (4-byte) array A and let the address of A[0] be x then to access A[i], we can directly access the memory at (x + i*4). Unlike arrays, we can not do random access in linked list. Quick Sort requires a lot of this kind of access. In linked list to access i’th index, we have to travel each and every node from the head to i’th node as we don’t have continuous block of memory. Therefore, the overhead increases for quick sort. Merge sort accesses data sequentially and the need of random access is low.