I am trying to create a queue using LL implementation that will be used for Radix Sort.
The algorithm of the radix sort is described as follows:
(a) Read in the numbers from a file and create a queue called
(b) Create 10 other queues called Subqueue, Subqueue
,. . . ,Subqueue.
(c) Remove a number from the Master queue and extract its most
right digit (ones).
(d) Add the number to the Subqueue[digit]
(e) Repeat the (c) and (d) until Master queue is empty.
(f) Remove the first element from the Subqueue and insert it
into the Master queue.
(g) Repeat the previous step until the Subqueue is empty.
(h) Repeat the last step for consecutive Subqueue[i] where i
takes on values from 2 to 9.
(i) Repeat the procedure starting from (b) Max times where the
value of Max is equal to the number of digits
in the largest number of the sequence.
I don't know how to start (newbie). Can someone please help.