Question: Write an algorithm for Merge-sort that uses queues. Your algorithm should use the queue ADT that you implemented in Assignment 2 (but not the actual
Write an algorithm for Merge-sort that uses queues. Your algorithm should use the queue ADT that you implemented in Assignment 2 (but not the actual arrays). That is, the input to the algorithm is a queue, and when partitioning is done, two queues are created (L and G). Then, L and G are sorted recursively in the same way and merged when sorted. Note that you have already implemented the Merge algorithm that uses queues!
Please use Java
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
