O'Reilly logo

Python Data Structures and Algorithms by Benjamin Baka

Stay ahead with the world's most comprehensive technology and business learning platform.

With Safari, you learn the way you learn best. Get unlimited access to videos, live online training, learning paths, books, tutorials, and more.

Start Free Trial

No credit card required

Implementation

Before we delve into the code, let's run through the sorting of a list using the quick sort algorithm. The partitioning step is very important to understand so we'll tackle that operation first.

Consider the following list of integers. We shall partition this list using the partition function below:

     def partition(unsorted_array, first_index, last_index):         pivot = unsorted_array[first_index]         pivot_index = first_index         index_of_last_element = last_index         less_than_pivot_index = index_of_last_element         greater_than_pivot_index = first_index + 1         ... 

The partition function receives the array that we need to partition as its parameters: ...

With Safari, you learn the way you learn best. Get unlimited access to videos, live online training, learning paths, books, interactive tutorials, and more.

Start Free Trial

No credit card required