sequences queue is drawn vertically with the front of the queue being at the bottom of the box and the rear of the queue being at the top of each box while there are queues plus mainqueue created by radix sortthe example will show just the queues that are used while sorting these words the first queue in the list is the queue for spaces in string figure depicts the strings on the mainqueue after they have been read from their source the first step of the algorithm processes the mainqueue by emptying it and placing each string in the queue that corresponds to its fourth letter (the maximum string lengththis results in farm and barn being placed on the and queues the other strings are placed on the space queue as shown in fig thenall the strings are dequeued from the three non-empty queues and placed back on the mainqueue in the order that they were dequeued as shown in fig once againthe process is repeated for the third letter in each string this results in using the and queues as shown in fig againthe strings are brought back to the mainqueue in the order they were dequeued as depicted in fig and the process is repeated again for the second letter in each string all strings have an as their second character so they all end up on the queue (fig fig radix sort step fig radix sort step -- th letter this copy belongs to 'acha