Radix Sort Algorithm Introduction in 5 Minutes

[@DyslexicAnaboko]

Thanks for not using single digit numbers in your example.

[@sskinedGUY]

why

[@FilliamPL]

@@sskinedGUY too finite of an example, not enough special cases (like 3-digit numbers versus 2-digit numbers)

[@alphag4mer909]

@@sskinedGUY as you've seen in the video it uses counting sort to iterate over the array, it iterates `d` times and each time increasing the digit it uses for sorting, now with single digit numbers, it'll just be a regular counting sort algorithm no difference at all

[@deedewald1707]

@@alphag4mer909 The sort complexity, Big O, changes with a single digit ! I like your reply

[@rohitrao504]

lol🤣🤣🤣

[@Gersberms]

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

[@GamemodePC]

same, i could barely understand it, not even counting sort? i dont even know how i messed that up.

[@NphiniT]

@@GamemodePC I understand it. But I still don't get the logic of why it works LOL!

[@tinata630]

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

[@AFPerssoN]

Who the fuck spends an hour on this lmao?

[@jeffwalker5847]

@@AFPerssoN my prof loves to show proofs on every single type of radix sort and their loop invariants

[@deedewald1707]

@@jeffwalker5847 The profs get paid for the theory and proofs !

[@jlone4365]

@@jeffwalker5847 exactly

[@fernandocandeiatorres1808]

@@AFPerssoN every college professor sadly

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

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

[@waldemarsobczak]

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

[@ekinaslan7307]

yes visualizations with sound have shephard tone effect

[@aryangupta1763]

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

[@ianvensonbolanio3327]

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

[@sode07]

This is one of the best explanations on this site

[@svetashtrakh6565]

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

[@jhay_vine5083]

hey, I study CS, and I am interested in communicating with people from other countries who offer the same course. I really want to compare the educational systems and syllabus. I need to know that I am not slacking..

[@DrakiniteOfficial]

Oh wow, this was a really nice and simple explanation of the general concept! 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!

[@TheGarthMonster]

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

[@danhle7999]

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

[@deedewald1707]

It's very fast too !

[@mindlessmeat4055]

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

[@wajahatkhan9455]

Love You CS Dojo....... In Short Amount of time I learned the Radix Sort.

[@nbah88]

where can get psudeocode of this radix sort?

[@dainellechris]

Thank you!!! This is really helpful comapred to the rest of videos I have watched!

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

[@kllau719]

This is a really helpful video to understand this sorting algo! Thanks!

[@franciscoabusleme9085]

Perfect. Thank you!

[@alibaba888]

THANK YOU. VERY SIMPLE AND YET EFFECTIVE

[@coolmanjack1995]

You made this so easy to understand

[@RanjeetKumar-bf4xf]

Beautifully explained

[@melsheimy]

That was very easy to understand. Thank you very much

[@NeRoNzXz]

this video was really helpful and simple, thank you so much

[@pragyanvarshney17]

saved a lot of time! Great work man!

[@sukuiidoshimufunii9520]

So well explained. Please tell me you write textbooks. 😅

[@tissuepaper9962]

It would have been nice for you to show the memory complexity as well, to better illustrate the tradeoff between time and memory as b increases.

[@ezequielzion]

Very useful! Thank you

[@StarGarnet03]

radix is really fun to do by hand

[@Dream-xr7ls]

thanks for your explanation. it help me alot ~~~

[@DrugsOnTV73]

Thanky you very much. Very clear and easy understandable.

[@arielfuxman8868]

Sophisticated.

[@TheYvib]

very good explanation, thanks!

[@pokpikchan]

Nice easy explanation

[@abhishektiwari2476]

awesome explanation brother...

[@serg_sel7526]

Now, we will be able to make this sound ourselfs

[@juanete69]

What other stable alternaitve could be used instead of counting sort?

[@dariankavu8386]

Great explanation

[@gracewood6768]

very concise and short. nice! learned a lot thx!

[@Dadax9398]

Nice video, really clear :D , It helped me a lot, thanks

[@IvoCampi1]

Nice explanation!

[@vibhuarora2911]

Thanks! Great explanation

[@MrR2A]

YK: please, which software do you use for the animation? Thanks

[@SanghoBose5]

very good explanation. Thanks.

[@xMichi7]

Thanks a lot buddy!

[@capjus]

The most important point in this algorithm is that there is no comparision between the numbers, but just between the counting and the digit. Although i don't know how it works in code. Is it like comparing count variable i with digit then allocating to new array??

[@deedewald1707]

Using Base 10, these are the bins or buckets. Using Base 16 for hexadecimal !

[@smartwolf9045]

Fantastic. One simple think I'm not sure I understood : why is the Time complexity of the counting sort 0(n+k)? I mean, I dont see why for each value, we add the" range of Key". When you say "range of Key", do you mean the maximum number of "buckets" of values with same digit on this line?

[@deedewald1707]

Base 10, n=6 and d=3 !

[@deedewald1707]

If they were single digit, it's a count sort with O(n) one pass !

[@NekoApril]

I guess a modified version of this is used to sort text arrays alphabetically?

[@deedewald1707]

It would be a MSD then phone book bucket sorting !

[@idobooks909]

Yeah yeah found it very helpful. Thanks!

[@camilocamargo98]

nice explanation bro!!

[@rubykanima]

Now i just need to program the counting sort and radix sort

[@bongloads420thc]

I really enjoyed this video! Can you recommend any resources or readings for somebody looking to get their feet wet with algorithms?

[@vipnirala]

bro go for T.Cormen.....it's really cool

[@JKSmith-qs2ii]

Does anyone know what happens when you use decimal numbers and some numbers have more decimal digits then others? Does the right side pad the number with zeroes?

[@anukuljain3822]

commendable job

[@deekshaagrawal344]

wonderful!

[@bdjeosjfjdskskkdjdnfbdj]

any keen observer will ask how did he sort the keys in O(n + b) time? this video missed the big idea of radix sorts which are the buckets which makes it a non. comparison based sort!

[@deedewald1707]

B is shown as Base 10 aka Buckets !

[@rycemuffin]

Great video thanks

[@faldikn]

are u sure about the complexity of this radix?

[@ioanabiris3472]

Thank you!!

[@OptimisedTutorials]

You're a fucking hero.

[@hhhhrbjru4294]

Thanks so much dude

[@DarionAOD]

Well explained

[@yanxu9167]

My professor is useless. Thank you, CS Dojo

[@jeffbezos3942]

They can only be integers,right?

[@guky667]

amazing

[@AliHamza-wr3tt]

Such a nice

[@ThalesPo]

how does the "in place" version work?

[@Ramiraz59]

my name is Radix, i just watched this for fun. what is this subject/course? is this computer science?

[@jeremyeschbach5886]

Yeah, it is a type of algorithm used in computer science

[@efhi]

You got a cool name

[@lucamuscarella4085]

Nice! Thanks

[@lnjp8926]

Do you can sort Baccarat score.

[@amanibrian]

Thanks man

[@Ahmet-go7yd]

perfect

[@Kevin-rk4qu]

How do you get 10 for b?

[@joedonald1556]

what is k from in (n+k) =10

[@AlterRektMLG]

ayo thanks man

[@sc-fs9hb]

1 hour before exam

[@Futureaviation5639]

Jimbo: spelled oknan

[@supamdeepbains5172]

keep making coding tutorials

[@doubled9645]

is this lsd or msd?

[@nessfrommother2147]

lsd, since he sorts the units digit first

[@thananun1395]

Is it lsd or msd

[@ivandrofly]

Nice :)

[@louerleseigneur4532]

merci

[@JesusForUkraine]

2 days before the exam...

[@jeremyculkin1684]

Is this LSD or MSD radix sort?

[@deedewald1707]

Base 10, n=6 and d=3 !

[@hanz608]

Would leave tow likes if I could 👍

[@yektaagra741]

Who came here from the "wants to be dominated" meme?

[@RaymondHng]

This is exactly the same sorting algorithm used in the IBM 83 punch card sorter. kzbin.info/www/bejne/oHurY5Sih8iraq8​

[@alikarooni9713]

well described. Enough of talking, good voice, and English. people should learn how to make a video from you and not just making bullshits

[@Siejkovsky]

słabe

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

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

[@sc-fs9hb]

1 hour before exam