superb.. finally got the point.. explained in a very simple and fresh way

Your videos are really Amazing..Deep explanation ...But i like the way you bring God everywhere.....

amazing and detailed explanation sir.. thank you very much

Great video Sir, god bless u!!

Great explanation. Thank you

Thanks sir. Great Explanation.

I like this Indian Jordan Peele

Sir, could u make worst case analysis of shellsort video also?

10:23 all paths are of same length in a fully balanced binary tree till leaves...as final result lies somewhere in leaves so we have to chose a path to that leave and for a leave there is only one path which is always of length log(n!)

if comparing strings might it be m * nlog(n) with m = longest string being compared?

thanks to your support sir

awesome . keep uploading more videos

sir, can u also make vedio on cyclometric complexity also?

very well explained

Awesome I appreciate the rigor

I m learning very well

Thank you sir!!!

god may choose the non-comparison sorting algorithm to get linear time instead of nlogn for integer nos.

video name attracted me to view this

If you are use quantum computer then it takes O(1) time if we use n-qubits :p

Yeh that is not true, if you assume it is a binary tree, senseless. Was looking for more logical when you said gods algorithm

After seeing so many videos on the same topic i've looked out for this one... Hoping for some better explanation.. But sir you gave totay wrong explanation for why the height of longest path is atleast logn