Another way to add parallelism to the radix sort would be to turn the process around and have a thread for each queue. Each thread reads the entire array, looking for the values that should be enqueued on its queue. Thus, all the queues are being filled in parallel. If you implement this approach, however, you will find that it doesn’t run any faster. Why not?