Consider the following algorithm for sorting six numbers:
•
Sort the first three numbers using Algorithm A.
• Sort the second three numbers using Algorithm B.
• Merge the two sorted groups using Algorithm C.
Show that this algorithm is suboptimal, regardless of the choices for Algorithms A, B, and C.
We need at least 10 more requests to produce the solution.
0 / 10 have requested this problem solution
The more requests, the faster the answer.