Problem Link: [a]https%3A%2F%2Fbit.ly%2F3DN7ccC[/a] <br> <br>Full Course With Notes: [a]https%3A%2F%2Ftakeuforward.org%2Fstrivers-a2z-dsa-course%2Fstrivers-a2z-dsa-course-sheet-2%2F[/a] <br>Notes/C++/Java/Python Codes: [a]https%3A%2F%2Ftakeuforward.org%2Fdata-structure%2Fmerge-sort-algorithm%2F[/a] <br> <br>You can follow me across social media, all my handles are below: <br>Linkedin/Instagram/Telegram: [a]https%3A%2F%2Flinktr.ee%2FtakeUforward[/a] <br> <br> <br>00:00 - MERGE SORT - O(N log N) <br>1:16 - What is Merge sort <br>3:00- Algorithm <br>17:15 - approach <br>20:34 - pseudo code <br>25:00 - dry run on divide (pseudo code breakdown) <br>32:42 - approach of merge <br>33:46 - pseudo code of merge <br>40:33 - Code <br>44:10 - Time complexity analysis <br>48:05 - Space complexity analysis