hey, i am a beginner and we got stuck with my algorithm homework assignment on radixsort.
question is followed:
struct listnode *radixsort(struct listnode *data, int a, int k)
which takes a linked list of unsigned long integers, each less than a^k, and sorts them by k rounds of bucketsort with a buckets. You need to allocate the pointer array for the buckets with malloc. You need to preserve the sequence of the list items when you enter them into the buckets, so you need to insert in the rear of the list. Therefore, you should keep for each bucket two pointers, to front and rear of the list in the bucket.