It's because he is checking 3 digits thus having to do 3 pass. The zeros are only there for visuals. Reguardless of what values those chips are, if you check for 8 digits on the value of 1 it would be treated as 00000001.
Someone on Youtube should post a lecture about how to parallelize radix sort on a GPU. I need parallel radix sort explained in plain english!. Academic PDFs are mired in jargon and lack diagrams.
It's O(K*n), where n is the amount of numbers to sort and k digits each (technically, just O(n) ). Say we're using decimals with 3 digits and n = 8 - Radix sort gives us O(3*8), which isn't any better than a comparison sort method (n*log n) - actually, worse if the number of digits increases. However, if n = 256 we end up with O(3*256), which is a lot better than O(256*8). So the bigger n gets, the better Radix Sort is compared to a comparison sort.
thumbs up for mario music :D
themotionofstopping 5 days ago
מצויין!!!
gadaski 8 months ago
@discy12345 you add zeros at the left
PonchoExperience 9 months ago
what if not all numbers have the same amount of digits?
discy12345 9 months ago
@discy12345 I know this is a late response, but you add leading 0's
angelusdeobscurum 4 months ago
It's because he is checking 3 digits thus having to do 3 pass. The zeros are only there for visuals. Reguardless of what values those chips are, if you check for 8 digits on the value of 1 it would be treated as 00000001.
Ashingda 1 month ago
THE MUSIC IS SO ANNOYING!!!!!
philmo1 10 months ago
Someone on Youtube should post a lecture about how to parallelize radix sort on a GPU. I need parallel radix sort explained in plain english!. Academic PDFs are mired in jargon and lack diagrams.
otonanoC 10 months ago
best video ever
kurozaki45 11 months ago
You need to ask what the complexity
O(n)
itayarye82 1 year ago
how fast is this sorting method?
Jackpotur 1 year ago
@Jackpotur
It's O(K*n), where n is the amount of numbers to sort and k digits each (technically, just O(n) ). Say we're using decimals with 3 digits and n = 8 - Radix sort gives us O(3*8), which isn't any better than a comparison sort method (n*log n) - actually, worse if the number of digits increases. However, if n = 256 we end up with O(3*256), which is a lot better than O(256*8). So the bigger n gets, the better Radix Sort is compared to a comparison sort.
cb2198 1 month ago
Superb explanation !!! Wonderful !!!
pointkrish 1 year ago
thanks, its the best video to radix sort in youtube!
joelcuz 1 year ago
Exelent video!!!
eddiechilango 1 year ago
THNK U SO MUCH.......!!!!!!!!!
samps01 1 year ago
y dont we jus do the third step.. we get it easily..!!
sundude07 1 year ago
best video ever on sorting algorithm.
rabinshrestha505 1 year ago
Great video! explained in a way that's very easy to understand and clear as to how to implement just with a bunch of queues
fobbah 1 year ago 2
Perfect explanation, love the use of egg cartons!!
rfrancis617 1 year ago
Comment removed
divijwadhawan 2 years ago
brilliant explanation, excellent soundtrack xD
cesarecf 2 years ago
Awesome!!!!
arnobart2009 2 years ago
This is a brilliant demonstration of radix sort !
a76642588 2 years ago
exam pass and fail was right here in this vid thanks a heap
lildennett 2 years ago
wow, thank you dude for the flashy video thingy!
my soab university prof didnt even came close to it!
ragemind45 2 years ago
Amazing explanation. Really helpfull.
usunivdudette 2 years ago
Brillian explanation!!! Do you have similar example for patricia/radix tree?
iamredheart22 2 years ago
GOOD JOB!
net5s 3 years ago
so much better than doing it on a white board...thanks a lot...
chandikag1981 3 years ago
that was easy to understand. ty ^^
PerfectBlindness 3 years ago
Thanks a bunch, really cleared up radix sort for me!
theEmyrion 3 years ago
This has been flagged as spam show
cybr? check out muh profile and msg me on M.S.N!!
naughty fun. visit my profile. PK
broaddcastyou 3 years ago