This video discusses the very famous "Quick Sort" algorithm. 

QuickSort is a sorting algorithm based on the Divide and Conquer algorithm that picks an element as a pivot and partitions the given array around the picked pivot by placing the pivot in its correct position in the sorted array.

For Input: 
N = 5 
arr[] = { 4, 1, 3, 9, 7}

Output:
1 3 4 7 9

Try it out before watching the implementation of the problem in the video. We recommend watching the video, even if you can solve the problem. You may discover something new. All the best!!!

Do check out:-

Article: https://www.geeksforgeeks.org/quick-sort/
Problem: https://practice.geeksforgeeks.org/problems/quick-sort/1
SDE Sheet: https://www.geeksforgeeks.org/sde-sheet-a-complete-guide-for-sde-preparation/