Merge Sort | Sorting Algorithm

In this video, I have explained merge sort. Merge Sort is a Divide and Conquer algorithm. It divides the input array into two halves, calls itself for the two halves, and then it merges the two sorted halves. https://github.com/fit-coder/fitcoderyoutube/tree/master/sorting 00:00 Introduction 00:06 Merge Sort 02:05 Pseudo Code 19:07 Merge Sort properties 21:15 C++ Implementation ------------------------------------------------------------- I live in New Delhi and love explaining programming concepts. I have done M.Tech(BITS Pilani) + B.Tech(PEC, Chandigarh) in Computer Science and am currently working as a software engineer in a MNC. If you like my content, please like, share my videos and subscribe to the channel. ------------------------------------------------------------- For Sorting Algorithms, please refer to the below playlist: https://www.youtube.com/playlist?list=PLFj4kIJmwGu08Rq9e-ensRK5bFA2fVUhz For Linked List tutorials, please refer to the below playlist: https://youtube.com/playlist?list=PLFj4kIJmwGu1oI1HVzAZlpJgKf9xv6mM1 For Binary tree tutorials, please refer to the below playlist: https://youtube.com/playlist?list=PLFj4kIJmwGu2VDN0qKVMmCbEeGBEpXzkX For Binary search tree tutorials, please refer to the below playlist: https://youtube.com/playlist?list=PLFj4kIJmwGu21Tv1mmsNFOf5pWUrSjr55 For in-depth Graph theory and implementation details, please refer to the below playlist: https://youtube.com/playlist?list=PLFj4kIJmwGu0yzwN3qZmw6p3E3zpoHpZz #DataStructure,#sorting,#FitCoder,#Algorithm,#competitiveprogramming,#faang,#codinginterview