Merge Sort Algorithm

Merge sort explained in plain English. In this video you’ll learn how merge sort works, it's implementation & program.

You will also learn what is Divide and Conquer rule.

What is merge sort?

Merge sort is one of the most efficient sorting algorithms. It works on the principle of Divide and Conquer. Merge sort repeatedly breaks down a list into several sublists until each sublist consists of a single element and merging those sublists in a manner that results into a sorted list.

Last up, you will learn the time complexity, space complexity of merge sort.

[interviewbit]

Hey Guys,

Do let us know which topic you want next in this series in your comments.!

[Sword]

You explained it better than my uni teacher, thank you <3

[siddharthvs]

I love it at 9:55 when he says "merge procedure you can easily write on your own"! Joke of the day. Hahahaha.
p.s. Infact the real deal is inside merge().

[ameergareeb]

you are good man!! now i can stop switching platforms. cheers

[MohitK]

wished i could have got such explanation during my college years, though good for people like me who couldn't make it into IB academy.

[shrutikanikhar]

Your teaching is very good. Video was very helpful.

[Entertainment-vpzj]

What if your array looks like [2, 4, 1, 6, 8, 5, 3, 7]? This will result in two arrays [1, 2, 4, 6] and [3, 5, 7, 8]. Your two array merge won't work... You have to exhaust one array and merge the remainder of the second array. It all happens in the merge function...

[prachijaiswal]

Hi! Can you please explain how to identify a dynamic programming ques and what is the basic pattern to solve one ? TIA

[himanshutiwary]

Sir please upload more videos faster ...we have our interviews ahead