5. There are many strategies in sorting elements in an array. Bubble sort, merge sort and...

Transcribed Image Text:

5. There are many strategies in sorting elements in an array. Bubble sort, merge sort and quick sort are three common approaches. Given an array of eight (8) integers and algorithm below: 3 8 4 10 1 5 6 9 firstHalf = mergeSort (firstHalf); secondHalf = mergeSort (secondHalf); list = merge (firstHalf, secondHalf); Draw the conceptual diagram (workflow) using merge sort to sort the numbers from smallest to largest. Merge sort divides the array into two halves and applies merge sort on each have recursively. Next, after the two halves are sorted, the algorithm will merge them. 5. There are many strategies in sorting elements in an array. Bubble sort, merge sort and quick sort are three common approaches. Given an array of eight (8) integers and algorithm below: 3 8 4 10 1 5 6 9 firstHalf = mergeSort (firstHalf); secondHalf = mergeSort (secondHalf); list = merge (firstHalf, secondHalf); Draw the conceptual diagram (workflow) using merge sort to sort the numbers from smallest to largest. Merge sort divides the array into two halves and applies merge sort on each have recursively. Next, after the two halves are sorted, the algorithm will merge them.

Answer rating: 100% (QA)

Merge sort Merge sort works by splitting the array into two halves then ... View the full answer