Sir this video was created nearly 9 years ago but I found this as the best video and >>>>>>> better then new videos. Sir huge respect for you ❤ Sir this video never gets old. It's hard to find out teacher like you. Sir please continue your channel 🥺. Thank you sir.
Sir this video was created nearly 9 years ago but I found this as the best video and >>>>>>> better then new videos.
Sir huge respect for you ❤
Sir this video never gets old.
It's hard to find out teacher like you.
Sir please continue your channel 🥺.
Thank you sir.
Best lecture on complexity! Why do I even go to college?
You’re probably done with college now, but I’m in discrete and my teacher has no clue what’s happening. I don’t know why I got to college either
Sir you are a gifted teacher. Please keep making more algorithm videos
Great explanation. Thanks!
I finally understood the D and C technique, thanks man!!!
Excellent!!!!!!!! never knew it was this simple.... thank you!!
Τhank you very much, sir!!! I can't tell you how helpful your videos are!
Best lecture on divide and conquer algorithm!
sir i became a fan of your teaching style , please make videos sir
Real id sa ao Sir Zain
Excellent explanation Jadav.
I think I actually understood this! Excellent video, thank you for posting. :)
87
great explanation sir. was really helpful
mojja sirji
Neat and clear explanation Sir.🙏
Nice explanation
The video is wonderful!
Superb
best expalnation ever..
Why have you taken a=1 in most last example??please reply sir...
Why was K = log n?
Sorry, Why T(n) is nlog(n)? isnt that should be nlog(with base 2)n ?
in computer science when dealing with logs its always implied to be base 2 so you dont need to include it
good!!!
How to be good at Math
pretty sure he is from karnataka,India .!
Roses are red
Violets are blue
The title is english
Why aren't you?