Counting sort: intuition + code | Linear Time Sorting | Appliedcourse 

What an explanation!!! This could be the khan Academy of computer science. Thank you, sir.

Awesome explanation sir, thanks for explaining the contents from CLRS.

This is awesome blossom!!! Thanks a lot for explaining life and this to some extent!

I may be wrong.. counting sort should be worst space complexity.. we are creating 2 extra arrays and also what will happen if k = 10000 and my input array is small like {10000, 10, 1} . In this case, we need to create auxiliary array of size 10000 initialised with zeros...

Well explained ,Thank you so much !

Very nice explanation

Please sir add more videos on this playlist 🙏

Thank you sir

good job !

In the last loop, do we have to go from end to start?

What program are you using to draw

how about descending order