Комментарии:
What comment should I do one of the best.
Best❤.
Index should start from 0 not 1 I guess
ОтветитьI was struggling in merge sorting. Thank you for the clear explanation
ОтветитьThank you sir !
ОтветитьBut book states it as: (1 + lgn), why it is so?
Ответитьwho came here cuz of jenny's sound problem:(
ОтветитьWhat's the space complexity for merge sort , also for insertion sort ?
😗😗
Thank You So Much Sir, great explanation.
Ответить2025還在看的+1
ОтветитьI think the algorithm he wrote is wrong. Shouldn't be there a for loop before if condition?
ОтветитьSir u teach really nice
ОтветитьOdin gang assemble
Ответить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!
ОтветитьOur university lecturer just wasting our time.
ОтветитьI think he is the no. 1 teacher of cs in the universe❤❤
ОтветитьThanks!
Ответить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
ОтветитьGood teacher all the time 👍
ОтветитьWhy are you not making new videos??
Ответитьbad teaching please stop
Ответитьas per my knowledege the index number begins with 0
but worte 1
عمي
Ответить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
Ответить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.
I'm watching these videos in 2024 , this proves education is divine . Education and teaching won't be old .
ОтветитьAa programs rasthe chaaala inka vundha program
ОтветитьThe man, The myth, The legend!!🙏🏻❤
ОтветитьCan you please upload Red black tree video
Ответитьnext level playlist
ОтветитьTysm i love you bro. You are the goat
ОтветитьWhy is the index of first element 1 and not zero ?
Ответитьyou made life easier to live, thanks sir
ОтветитьGOD FATHER OF ALGORITHMS 🙏🙏🙏
ОтветитьEcellent sor ge
Ответитьwho came up with this algorithim. I would never have thought of it wow.
Ответить😍
ОтветитьYou didn't show the algorithm for the merge(l, mid, h);
ОтветитьI have never seen anyone explain this briefly... This is just amazing...
Ответить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!!🙏🙏
ОтветитьYou are the reason my Data Structures and Algorithms Prof hasn't seen my face ever
Ответитьwoooow just crystal clear explanation. you are best ds and also teacher in you tube
ОтветитьIn merging where is the logic for identify big or small elements
Ответитьsir Insha Allah God will bless you which you need in your hole life
ОтветитьIf anyone watched this video in 2070...like my comment to check if I am alive or not😢
Ответить