Counting Sort is an algorithm which does not use comparison to perform sorting. It works in a O(n) time complexity but there is a certain caveat. It compromises on space to give you a better time complexity. Counting sort is usually applied with some special use cases when you know the range of elements beforehand. In this video watch a live demonstration how it works behind the scenes followed by a dry-run of the code. This way the concept will stay in your mind forever.
00:00 - Intro
01:14 - Where do you use Counting Sort?
03:43 - Live Demo of Counting Sort
11:04 - Dry-run of code
15:09 - Final Thoughts
📚 Links I talk about in the video:
Bubble Sort: • Bubble Sort Algorithm | Live demo, Vi...
Insertion Sort: • Insertion Sort visualized with exampl...
Selection Sort: • Selection Sort | Live demo, visuals a...
Merge Sort: • Merge Sort with Visuals and Animation...
Quick Sort: • Quick Sort super easy explanation wit...
Time Complexity: • What is the Time Complexity of an Alg...
📘 A text based explanation is available at: https://studyalgorithms.com/array/cou...
Code on Github: https://github.com/nikoo28/java-solut...
TestCases on Github: https://github.com/nikoo28/java-solut...
🔗 To see more videos like this, you can show your support on: https://www.buymeacoffee.com/studyalg...
💻 Get Social 💻
Follow on Facebook at: / studyalgos
Follow on Twitter at: / studyalgorithms
Follow on Tumblr at: / studyalgos
Subscribe to RSS feeds: https://studyalgorithms.com/feed/
Join fan mail: http://eepurl.com/g9Dadv
#algorithm #sorting #tutorial
On this page of the site you can watch the video online Counting Sort explained with animations and example | Full implementation and code with a duration of hours minute second in good quality, which was uploaded by the user Nikhil Lohia 15 January 2021, share the link with friends and acquaintances, this video has already been watched 14,442 times on youtube and it was liked by 370 viewers. Enjoy your viewing!