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-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'.
Auf dieser Seite können Sie das Online-Video Quick Sort - Data Structures & Algorithms Tutorial Python #15 mit der Dauer stunde minuten sekunde in guter Qualität ansehen, das der Benutzer codebasics 01 Januar 1970 hochgeladen hat, den Link mit Freunden und Bekannten teilen, dieses Video wurde auf Youtube bereits 123,926 Mal angesehen und es wurde von 1.8 tausend den Zuschauern gefallen. Viel Spaß beim Betrachtenden Zuschauern gefallen!
