Quick Sort in JavaScript - O(n log n) Time Complexity

In this video lesson we will study how the Quick Sort algorithm works, we will analyze its time and space complexities and then we will implement it:

Problem - Quick Sort:

Input: nums = [3, 1, 3, 2, 5, 4]
Output: [1, 2, 3, 3, 4, 5]

Your algorithm should run in O(n log n) time on average and use O(log n) extra space on average (for the recursion).