Counting Sort | Easiest explanation with example

👉Links for DAA Notes:

🧑‍🎓Contributed by: Junaid Gazi

🧑‍🎓Contributed by: Mannu Garg

Counting sort is a sorting technique based on keys between a specific range. It works by counting the number of objects having distinct key values (kind of hashing). Then do some arithmetic to calculate the position of each object in the output sequence.
Counting sort is a stable sorting technique, which is used to sort objects according to the keys that are small numbers. It counts the number of keys whose key values are same. This sorting technique is effective when the difference between different keys are not so big, otherwise, it can increase the space complexity.

►Design and Analysis of algorithms (DAA) (Complete Playlist):

Other subject-wise playlist Links:
--------------------------------------------------------------------------------------------------------------------------------------
► Operating System :
►Database Management System:
► Theory of Computation
►Artificial Intelligence:
►Computer Networks (Complete Playlist):
►Computer Architecture (Complete Playlist):
►Structured Query Language (SQL):
►Discrete Mathematics:
►Compiler Design:
►Number System:
►Cloud Computing & BIG Data:
►Software Engineering:
►Data Structure:
►Graph Theory:
►Programming in C:
►Digital Logic:

---------------------------------------------------------------------------------------------------------------------------------------
Our social media Links:
--------------------------------------------------------------------------------------------------------------------------------------
►For Any Query, Suggestion or notes contribution:

[abhishekdhiman]

Told about your channel to my friend, now whole batch watches your video ✌🏻❤️

[sahidurrahman]

The title of the video 'Easiest explanation' is absolutely right.
Keep teaching us.

[saipranavi]

I was stressed when I didn't find this topic in your videos. Now, iam happy. Thank you.

[iamnehanupur]

After watching a lot of videos I got my doubts clear only by you sir. Thank you so much. 🙏🏻

[JohnWick-fcxz]

Nice and clear >> Understand on 1st turn. better than apna college.

[shahraizimtiaz]

Allah aplogo ka bhala kre, Itna easily samjhaya, jo hamain University main samajh hi nai tha araha, Love u sir❤❤💯💯

[moonthoughts]

The thing I was trying to understand from days and you make me learned in few minutes. ALLAH BLESS you.

[bibhukishan]

Correction: Count sort is based on stable sort which means that relative order of values in original array should not be disturbed. So we can't directly print the array just by looking at the frequency of the elements . After storing the frequency of elements, we will update the frequency array by storing the prefix sum and then only we will form a new array of size equal to the original array and we will traverse the original array and store the values in the new array in accordance with the prefix sum .

[kiranbendigeri]

Explanation is very clear...Excellent. :)

[iamtechboy]

Thanks Buddy! You made it super clear.

[priyankachachar]

Yesterday I was searching for your counting sort video and couldnt find..and today you uploaded the video what a coincedence

[Eswar.]

You are a great teacher
I would love to train for GATE under you
Hope you will help

[Manii]

Prove helpful before exam's 2 hours ❤

[deepeshmittal]

Got selected in ibps so it officer with help of you thank you sir

[utsavp]

Woahh, new board!! Congratulations sir :)

[sgmusic]

thankyou so much sir very good explanation

[nomaneeium]

842K 😍
On the way to 1M🎉🎉
Party Karna sir jiiii 1M hone par...🎉🎉🎉

[jogendrakumar]

Wow sir Aap great Ho Aap ka asan kaise chukaye sir

[dr.amandeep]

My all colleagues and students follow u

[LearningStudents-iy]

Sir Asslum-o-alikum, I like your lectures, so Sir plz made lectures on information security.