2.7.2. Merge Sort Algorithm

If anyone watched this video in 2070...like my comment to check if I am alive or not😢

sir Insha Allah God will bless you which you need in your hole life

In merging where is the logic for identify big or small elements

woooow just crystal clear explanation. you are best ds and also teacher in you tube

You are the reason my Data Structures and Algorithms Prof hasn't seen my face ever

Sir you are a god. My exam is tmrw and thanks to you I am very confident that I will ace it! Thank you soo much sir!!🙏🙏

I have never seen anyone explain this briefly... This is just amazing...

You didn't show the algorithm for the merge(l, mid, h);

😍

who came up with this algorithim. I would never have thought of it wow.

Ecellent sor ge

GOD FATHER OF ALGORITHMS 🙏🙏🙏

you made life easier to live, thanks sir

Why is the index of first element 1 and not zero ?

Tysm i love you bro. You are the goat

next level playlist

Can you please upload Red black tree video

The man, The myth, The legend!!🙏🏻❤

Aa programs rasthe chaaala inka vundha program

I'm watching these videos in 2024 , this proves education is divine . Education and teaching won't be old .

Love the way he stares at the camera once he explained something, as if "I couldnt have made it any more simpler,do you still not get it?"
Amazing teacher, good stuff.

The recursive merge sort algorithm for merge sort presented here is wrong because the merger doesn't take place until both the left and right sides have been broken up to one element and so the merge call should be outside of the if statement and not inside of it

عمي

as per my knowledege the index number begins with 0
but worte 1

bad teaching please stop

Why are you not making new videos??

Good teacher all the time 👍

sir you have removed an essential merging video from ur playlist which is a pre requisite for this video pls can u add tht merging algo clip somewhere

Thanks!

I think he is the no. 1 teacher of cs in the universe❤❤

Our university lecturer just wasting our time.

literally, no other instructor made the concept this clear and explained this way, and that too for free! no unnecesary intros, nothing rubbish just straightforward explanation. Thanks alot for making concepts easier for us!

Odin gang assemble

Sir u teach really nice

I think the algorithm he wrote is wrong. Shouldn't be there a for loop before if condition?

2025還在看的+1

Thank You So Much Sir, great explanation.

What's the space complexity for merge sort , also for insertion sort ?
‏‪😗😗

who came here cuz of jenny's sound problem:(

But book states it as: (1 + lgn), why it is so?

Thank you sir !

I was struggling in merge sorting. Thank you for the clear explanation

Index should start from 0 not 1 I guess

What comment should I do one of the best.
Best❤.