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

Chapter Name: Linear time sorting
Please visit: gate.appliedro...
For any queries you can either drop a mail to [e-mail] or call us at [phone]

[@aadil4236]

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

[@microlegions3101]

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

[@padmanabhanvijendran9358]

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...

[@ItachiUchiha-ub2iu]

Yes, it it. Its always a trade off between time and space.

[@whatidashdashdash8866]

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

[@ShreemauliRaut7]

Well explained ,Thank you so much !

[@tharunkumarreddy1224]

Very nice explanation

[@aadil4236]

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

[@uttamkarmakarece3534]

Thank you sir

[@simonwinther1285]

What program are you using to draw

[@uttamkarmakarece3534]

Please sir add more videos on this playlist 🙏

[@neojai3514]

good job !

[@GATEAppliedCourse]

Thank you! Cheers!

[@yusriliihabullah3049]

how about descending order