@DyslexicAnaboko

Thanks for not using single digit numbers in your example.

@Gersberms

Excellent summary, I always thought Radix sort was one of the weirder algorithms out there. But now I get it. Thanks!

@Fitnessbytina

honestly bless you bro! summed up an hour lecture into 4:38 mins

@MOIstats

Gave a like in a heartbeat. Got a whole concept down in 4 minutes. Excellent work.

@briandehlinger7690

Wow, very impressive. You explained it clearly to me in under 4 minutes and I finally understood Radix sort.

@waldemarsobczak

Great video! Now explain why visualizations of this sort look do cool

@sc-fs9hb

1 hour before exam

@aryangupta1763

I never comment on these kind of videos but this was such a great complete explanation, thank you.

@DrakiniteOfficial

Oh wow, this was a really nice and simple explanation of the general concept! Thanks

@antoine2571

It's so simple but i woulfn't have thought about doing something like this in a million years. 
Props to the guy who found that.

@sode07

This is one of the best explanations on this site

@ianvensonbolanio3327

Thankyousomuch. Your video really helps our group "MEMANG". God bless us all!

@svetashtrakh6565

I loooove you guy, this is so helpful for computer science student , especially before exam:) thanks

@07blue71

4 minutes I understand radix sort! Thanks!

@יעלליפשיץ-ס6ש

listen!!! i freaking love you!! you explain everything so well! thank you for making this video!

@mindlessmeat4055

That is really neat. This makes so much sense now. Thank you.

@eritwikreddy989

Thanks ! helped a lot for me end sems

@antoine2571

To everyone who say "Thanks for taking number of different sizes", actually there is another method to sort integers of different lengths.

Let's say the biggest number has n digits. Create n arrays. Put in the i-th array all digits of length i (this is basically a bucket sort, it can be done in O(n)).
Now radix sort each bucket (easy, every number in each bucket has same length)
Now concatenate the buckets; there is your sorted list. 

However this method only work if the numbers are roughly of random size. If all number have size 1 and one number is of size 2, you're in the worst case of bucket sort and the complexity is NOT linear anymore.

@danhle7999

whoever invented this must be a genius or something. its like magic

@TheGarthMonster

Awesome explanation! Thank you so much for putting this together. Really a great job