Hi everyone,

For my computerscience class I have to write a sorting program on selection, quick, radix, merge, and insertion sort, at the moment I have selection, Insertion, and quicksort done. And well the question I need answer is does anyone how radix and shell sort work. All I have to go by is what someone told me and it doesn't seem to work well that way, I was told to recurrsively go through my radixsort and divide the array by 5, then do a insertion sort to piece them all together, now I was a little secpitcal of this when I first heard it and I assume I was right to be. It is horribley slow. But anyways could anyone explain to me how a radix and shell sort work, any information will be appreciated.

Thanks,
~BT