Quick Sort - Data Structures & Algorithms Tutorial Python #15

Published: 01 January 1970
on channel: codebasics

123,926

1.8k

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: https://github.com/codebasics/data-st...
Exercise: https://github.com/codebasics/data-st...
Data structures and algo in python playlist:    • Data Structures And Algorithms In Python

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 https://codebasics.io/ for my affordable video courses.

#quicksort #datastructures #algorithms #python
Next Video:    • Insertion Sort - Data Structures & Algorit...
Previous video:    • Bubble Sort - Data Structures & Algorithms...
Complete playlist:   • Data Structures And Algorithms In Python

Website: https://codebasics.io/
Facebook:   / codebasicshub
Twitter:   / codebasicshub

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

On this page of the site you can watch the video online Quick Sort - Data Structures & Algorithms Tutorial Python #15 with a duration of hours minute second in good quality, which was uploaded by the user codebasics 01 January 1970, share the link with friends and acquaintances, this video has already been watched 123,926 times on youtube and it was liked by 1.8 thousand viewers. Enjoy your viewing!

13,912

323