a) Describe the merge sort algorithm.________________b)
Chapter 8, Problem 13RQ(choose chapter or problem)
Problem 13RQ
a) Describe the merge sort algorithm.
b) Use the merge sort algorithm to put the list 4, 10, 1.5, 3, 8, 7. 2, 6. 9 in increasing order.
c) Give a big-O estimate for the number of comparisons used by the merge sort.
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