Counting Sort - Sorting Algorithms Tuition Edition

We take a look at Counting Sort, one of the miracle non-comparison sorting algorithms!

= 0612 TV =

Enjoy your stay, and don't hesitate to drop me a comment or a personal message to my inbox =) If you like my work, don't forget to subscribe!

= NERDfirst =
NERDfirst is a project allowing me to go above and beyond YouTube videos into areas like app and game development. It will also contain the official 0612 TV blog and other resources.

-----

Disclaimer: Please note that any information is provided on this channel in good faith, but I cannot guarantee 100% accuracy / correctness on all content. Contributors to this channel are not to be held responsible for any possible outcomes from your use of the information.

[Box-of-hats]

You explained this considerably better than my lecturer, in 1/2 the time. Great tutorial

[canxavier]

nice! i did not understand why to take more arrays before. So your example with the prices was brilliant. Thx so much!!!

[aleidaolvera]

Amazing video! You have inspired me to start making videos this summer! I'm so excited to see someone so passionate about teaching beyond basic CS concepts.

[JJ-oxmp]

It's a crime you don't keep posting great tutorial like this.

[mahnazrabbani]

Very clear videos on sorting algorithms, thanks a lot!

[simpletongeek]

That's cool. I wish I make videos as good as yours. I've always thought Bucket sort as 2N. One for counting and one for sorting. I suppose you do have a point with k elements, though. Good point.

BTW, stable sort is only for when you use a buffer. In place bucket sort swap will cause the elements to go out of order. Another point: sorting strings by characters will cause MN operation with M as the string's length.

Keep up the good work! I really enjoy seeing your videos. Thanks.

[RaviShankarladhar]

this is the great tutorial, example with the prices is the good one.

[goagray]

Great video! You made it oh so simple. Gosh, you should've been my professor!

[jiachengli]

Great work mate, awesome video, thank you so much!

[UnDeadBaby]

Thank you very much, very clear and understandable. keep on good working.

[saeedmirzaei]

You did a great job. Thank you so much.

[whatsupbebexxx]

Great video dude. I knew I can trust you on understanding the concept and you don't disappoint :-)

[soaringxhn]

@6:14 he said "this means that a grape item should be placed in position 3 of the new array. Yes, the number actually refers to the index."

I'm a bit confused. The number actually refers to the position 3, not the index 3. So the number "actually does not refer to the index", rather it refers to the position?

[FusionArcs]

Thank you so much for the best simple explanation of counting sort.
But why didn't u add the time complexity for finding max and min value in the array.
I know it takes linear time but u should have mentioned it.

[lerecl]

Awesome explanation, Thank you so much !!

[Qbe_Root]

You do need comparisons to set up the buckets, though. How can you sort if you don’t know the order in which the values should be?

[Kgotso_Koete]

Thank you so much for this. Whew! God bless the internet.

[ColeAlexanderSoftware]

I have to read through all of the buckets?
Don't worry. That's O(k).

[jaydenshen]

lol so weird to see my CS1020 TA on youtube teaching CS3230 stuff, good job

[davidbohadana]

it was very  informative & helpful thank you so much