Quick Sort in 13 Minutes ⚡

Quick sort data structures and algorithms tutorial example explained

#quick #sort #algorithm

00:00:00 explanation
00:05:00 demonstration
00:07:47 code

// quick sort = moves smaller elements to left of a pivot.
// recursively divide array in 2 partitions

// run-time complexity = Best case O(n log(n))
// Average case O(n log(n))
// Worst case O(n^2) if already sorted

// space complexity = O(log(n)) due to recursion

music credits 🎼:
===========================================================
Title: A Caring Friend
Artist: Bad Snacks
Link: https://youtu.be/WyOdBcADtp8?t=1027
===========================================================