Комментарии:
Great man keep it up
Ответитьit helps alot ...lot of thnkss for you ..u solve my problem
thnkkss a lottt
Awesome 👍
Ответитьdoing very good job buddy;
Ответитьkeep uploading about algorithm;
ОтветитьGreat video man!
ОтветитьHi! it will be really great if you make a video on backtracking. it is a part of recursion
ОтветитьHey bro you are doing a great job,if you make a video about competitive programming that will be very helpful
Ответитьgood work.. thankyou:)
Ответитьbhaia!
please try to give to more time on this playlist!
I don't think I could ever get such an amazing explanation anywhere else!
please bhaia please!
Thank you so much my friend, you make me enjoy learning Algorithms. I love the way you dry run them. Keep doing more tutorials, I hope you will also do object Oriented programming and definitely I will keep sharing your channel to my friends!
ОтветитьWhat is the name of the Digital Blackboard?
Ответитьthat's pretty much easier. i don't usually comment but this video made my much happier. thanks from Pakistan. i would rather say that i always appreciate IT of India
ОтветитьWhile initialising key , Should it be arr[1]?
ОтветитьGreat video, thank you!
Ответитьonly video that really helped me the most with insertion sort. dry run was extremely helpful
ОтветитьDry running really helped thx a lot Tanmay!!!
ОтветитьThanks a lot anna. 😍😍😍
ОтветитьThanks a lot !!!!!!!!!!!
ОтветитьBro !!! It is difficult ,but yess thanks to explaining perfectly,i think by practice i will definitely implement it😎
Ответитьthanks a lot brother....
Ответитьeeeeeeeeeaaaaaaaaaaaaarrrrrro
ОтветитьPlease complete graph, hashing,heap and other remaining topic of playlist as soon as possible please please...and thanks for your rigorous effort❤️
ОтветитьGr8 info
ОтветитьExplanation is very good 👌
Ответитьexplanation was awesome bro
but how can we write pseudo code by ourself?
What a great👍👏😊 time⌚ to get a free🆓 agent in a different kind if I could go on my phone📞 number I don't think
ОтветитьSelection sort: finding a relevant ELEMENT for each INDEX.
Insertion sort: finding a relevant INDEX for each ELEMENT.
Amazing ❤️❤️
Ответитьthanks a lot brother , I cant even imagine how much efforts you might have given to make this video!!!!!lots of love and resoect for you
ОтветитьTop notch explanation....Thank You sensei !!!!!!!!!!
Ответитьthis guy is a gem!@!!
Ответитьthank you so much
Ответитьthankssssss a lottttt sir.
Ответить❤️❤️
Ответитьperfecto
ОтветитьI'm really appreciate your great video, i'm pretty sure to come back to your channel if I found another algorithm to learn again. Keep up the good work!
Ответитьsalute to your efforts sir....
Ответитьyou are awsm cheetay
ОтветитьYou are far better than our teachers
ОтветитьThank you a lot! Very useful tutorials. I've already shown your channel to my friends
Ответить❤❤❤❤❤
ОтветитьBrother thanks a lot for letting us understanding very smoothly and deeply.
ОтветитьReally good explanation sir. Thankyou so much sir.
Ответитьlovely
Ответить❤❤❤
ОтветитьHey Guys, if you want more such tech educational videos on this channel then please support me by subscribing to this channel & also share it with your friends as it helps me create more content just for you ✌
Ответить