Consider the following algorithm for sorting six numbers: Sort the first three numbers
Chapter 7, Problem 7.37(choose chapter or problem)
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.
Unfortunately, we don't have that question answered yet. But you can get it answered in just 5 hours by Logging in or Becoming a subscriber.
Becoming a subscriber
Or look for another answer