Question: Sorting the following array A using MergeSort goes through the following intermediate sequence ordered from 1 to 7. Identify and fix if you find any

  1. Sorting the following array A using MergeSort goes through the following intermediate sequence ordered from 1 to 7. Identify and fix if you find any problem in this timing sequence. (3 marks) A = [9, 4, 8, 1, 7, 3, 5, 2]

Time sequence:

  1. [4, 9, 8, 1, 7, 3, 5, 2]

  1. [4, 9, 1, 8, 7, 3, 5, 2]

  1. [1, 4, 8, 9, 7, 3, 5, 2]

  1. [1, 4, 8, 9, 3, 7, 5, 2]

  1. [1, 3, 4, 7, 8, 9, 5, 2]

  1. [1, 3, 4, 7, 8, 9, 2, 5]

  1. [1, 2, 3, 4, 5, 7, 8, 9]

Step by Step Solution

There are 3 Steps involved in it

1 Expert Approved Answer
Step: 1 Unlock blur-text-image
Question Has Been Solved by an Expert!

Get step-by-step solutions from verified subject matter experts

Step: 2 Unlock
Step: 3 Unlock

Students Have Also Explored These Related Databases Questions!