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

Merge sort is defined as a sorting algorithm that works by dividing an array into smaller subarrays, sorting each subarray, and then merging the sorted subarrays back together to form the final 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/merge-sort/
Problem: https://practice.geeksforgeeks.org/problems/merge-sort/1
SDE Sheet: https://www.geeksforgeeks.org/sde-sheet-a-complete-guide-for-sde-preparation/