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.
Step 1 of 3
Textbook: Discrete Mathematics and Its Applications
Author: Kenneth Rosen
Since the solution to 13RQ from 5.R chapter was answered, more than 223 students have viewed the full step-by-step answer. This textbook survival guide was created for the textbook: Discrete Mathematics and Its Applications, edition: 7. The answer to “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.” is broken down into a number of easy to follow steps, and 41 words. This full solution covers the following key subjects: merge, sort, Algorithm, list, estimate. This expansive textbook survival guide covers 101 chapters, and 4221 solutions. Discrete Mathematics and Its Applications was written by and is associated to the ISBN: 9780073383095. The full step-by-step solution to problem: 13RQ from chapter: 5.R was answered by , our top Math solution expert on 06/21/17, 07:45AM.