Quick sort is a popular sorting algorithm invented by British scientist Tony Hoare. Often interviewers ask questions around quick sort in software engineering interviews. This technique uses divide and conquer approach to divide given list into partitions and then recursively sort these partitions. It starts with a pivot element and tries to put pivot element in its correct position. This video goes over theory and two popular partition schemes called hoare partition and lomuto partition. We will write code to implement quick sort algorithm in python. In the end I have an exercise for you to solve.

Code: [ Ссылка ]
Exercise: [ Ссылка ]
Data structures and algo in python playlist: [ Ссылка ]

Topics
00:00 Quick sort technique
03:59 Hoare partition scheme
08:11 Lomuto partition scheme
13:17 Python code for quick sort
29:06 Exercise

Do you want to learn technology from me? Check [ Ссылка ] for my affordable video courses.

#quicksort #datastructures #algorithms #python
Next Video: [ Ссылка ]
Previous video: [ Ссылка ]
Complete playlist:[ Ссылка ]

Website: [ Ссылка ]
Facebook: [ Ссылка ]
Twitter: [ Ссылка ]


DISCLAIMER: All opinions expressed in this video are of my own and not that of my employers'.

свернуть