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'.
Sur cette page du site, vous pouvez voir la vidéo en ligne Quick Sort - Data Structures & Algorithms Tutorial Python #15 durée heure minute seconde en bonne qualité , qui a été Téléchargé par l'utilisateur codebasics 01 janvier 1970, Partagez le lien avec vos amis et connaissances, sur youtube cette vidéo a déjà été regardée 123,926 fois et il a aimé 1.8 mille téléspectateurs. Bon visionnage!
