Quick Sort - Data Structures & Algorithms Tutorial Python #15

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-structures-algorithms-python/tree/master/algorithms/3_QuickSort/quick_sort.py Exercise: https://github.com/codebasics/data-structures-algorithms-python/tree/master/algorithms/3_QuickSort/quick_sort_exercise.md Data structures and algo in python playlist: https://www.youtube.com/playlist?list=PLeo1K3hjS3uu_n_a__MI_KktGTLYopZ12 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: https://www.youtube.com/watch?v=K0zTIF3rm9s&list=PLeo1K3hjS3uu_n_a__MI_KktGTLYopZ12&index=16 Previous video: https://www.youtube.com/watch?v=ppmIOUIz4uI&list=PLeo1K3hjS3uu_n_a__MI_KktGTLYopZ12&index=14 Complete playlist:https://www.youtube.com/playlist?list=PLeo1K3hjS3uu_n_a__MI_KktGTLYopZ12 Website: https://codebasics.io/ Facebook: https://www.facebook.com/codebasicshub Twitter: https://twitter.com/codebasicshub DISCLAIMER: All opinions expressed in this video are of my own and not that of my employers'.