(Solved) : C Given Array Numbers 12 98 34 67 54 23 56 45 First Look Least Significant Digit Pass Move Q32858377 . . . .

in C++

Given an array of numbers: 12 98 34 67 54 23 56 45

First we look at the least significant digit (then, on eachpass, we move

leftward in the number to the next digit). We enqueue valuesinto queues

based on the digit (0…9), using an array of queues:

Queue                f…r

0

1           

2           12

3           23

4           34 54

5           45

6           56

7           67

8           98

9

We then dequeue numbers from the queues in order (from queue 0to

queue 9), placing the numbers back in the original array intheir new

order: 12 23 34 54 45 56 67 98

Then, we look at the next significant digit (in this case, thefirst digit), and

we enqueue values appropriately:

Queue f…r

0

1           12

2