Naruto Shippuden Utorrent there. Radix sort is a non-comparative integer sorting algorithm that sorts data with integer keys by grouping keys by the individual digits which share the same significant.

No, it doesn't work because you can't return a local variable. The other issue is that your algorithm makes some numerical mistakes. (1) On line 47, you are dividing by currentDigit, when you should be dividing by 10** currentDigit.

Use the std::pow() function to calculate ten to a power ( #include ). Once you fix that, you'll also have to adjust your indexing: 10 1 is 10, so you want currentDigit to start at 0. You'll also want to change the condition on line 44 to strictly less-than. (2) The next problem is how you are peeling numbers out of your bins. Your counter loop on line 51 causes i to remain the same all during the inner loops (lines 52 through 57). Get rid of line 51's loop and just set int i = 0. Don't forget to increment i somewhere around line 55. El Tercer Jesus De Deepak Chopra Pdf on this page.