Why sorting takes at least O(n log n) time

Learn why algorithms to sort n numbers take at least O(n log n) time.

[@PabitraPadhy]

It's been quite some time, since you've made this video.
Could you please make the other video you were mentioning during the end of this video ?
Thanks for sharing.
I remember reading both of them in CLRS, but this video helps in visualization.

[@user-pc9yb9vi5k]

Thank you! Really clear explanation! Totally get it now

[@notoppland]

Thank you, good explanation!

[@przemysawtomala9304]

You are awesome. ILY

[@thejdkdkdis]

Damn thats good video

[@mhd_4800]

Thank u !

[@privateaccount4460]

why sorting takes Omega(nglgn) is a better title