Radix Sorting Help

Hi everyone,

I'm having trouble implementing a supposedly simple Least Significant Digit first Radix Sort. The book I'm using gave me somewhat of a template that I touched up (below), but I'm very unsure of where to start. I know the basic layout (Initialization of memory space, Distribution of numbers in bins, and then Collection of the bins), but I don't know how to code it. The examples I've seen don't pertain to my situation enough to help me. Any help is greatly appreciated.

Thanks,
James

Code:

---

#include <stdio.h>
#include <malloc.h>
#include <stdlib.h>
void lsd_radix_sort(unsigned int *, int);

main(int argc, char *argv[]) {
        int i, nvals = 10000;
        unsigned int *array;
        if(argc > 1)
                nvals = atoi(argv[1]);
        array = malloc(nvals * sizeof(unsigned int));
        for(i = 0; i < nvals; i++)
                array[i] = rand();
        lsd_radix_sort(array, nvals);
       
}



#define        BITS        8       
#define        RADIX        (1<<BITS)
#define        DIGITS        (32/BITS)
void lsd_radix_sort(unsigned int *array, int n) {
        int i, j, k, d, shift;
        int *bin[RADIX], n_in_bin[RADIX], size_bin[RADIX];
        unsigned int v;

/**insertion of least significant digit first code below ****/
       

}

---

Code:

---

/insertion of least significant digit first code below ***** */

---

->

Code:

---

/* insertion of least significant digit first code below ***** */

---

free() what you *alloc().

malloc.h? What compiler are you using?

[edit]
Try google.
[/edit]

I use Cygwin (basically a UNIX emulator) as the compiler.

http://www.cygwin.com/faq/faq0.html#SEC118:

Quote:

---

Include stdlib.h instead of malloc.h.

---

Will do.

Thanks.

Do you know much about radix sorting by the way DWKS? I'm pretty stumped, as you have probably already found out :)

I know absolutely nothing about it. But someone here will.

If you don't want to wait for that someone, see if google will help you.

[edit]
First hit on google: http://www.brpreiss.com/books/opus4/html/page518.html
[/edit]

[edit=2]
I know it's in C++, but there is some sample code when you click on next:
http://www.brpreiss.com/books/opus4/html/page519.html
[/edit]

Thanks for the reply, but I've seen both of those links. I always try to exhaust my resources before posting (i.e. Google searching, etc.). If anyone else can help, I'd be very appreciative.
My main problem is finding any examples with a similar layout as the program I've posted.

Thanks,
James

>I'm pretty stumped, as you have probably already found out
Then just looking at the code won't really be of much help to you. But if you insist: http://www.eternallyconfuzzled.com/t...ing.html#radix

The only thing that I see you saying is that you don't know what you are trying to do. If you have a specific question about radix sort, what is it?

I just finished implementing radix sort in C and in C#. I can attempt to explain the theory if that is what you are after. Do not ask me to give you my implementation, as that will not help you understand what you are trying to do.

But like I said, if there is something specific that is stumping you, please feel free to post it.