//note:- if you have any query regarding this then comment below. please upvote
Problem solving manually 2. Using Figure 2.4 as a model, illustrate the operation of merge sort...
Use Figure 6.4 as a model, illustrate the operation of HEAPSORT
on the array
A = <4, 10, 7, 25, 8, 3>. Show all intermediate steps how the
heap is transformed.
6.4/
91|11|016 | 8|4|||7|V (9) 09
2) Sorting (a) (5 pts) In a Merge Sort of 8 elements, the Merge function gets called 7 times. Consider a Merge Sort being executed on the array shown below. What does the array look like right AFTER the sixth call to the Merge function completes? نرا index value 0 40 2 12 4 11 5 99 6 31 7 16 27 18 0 1 2 زيا 4 5 6 7 Index Value (b) (5 pts) Consider sorting the array...
3. (15 points) Using Figure 6.3 as a model, illustrate the operation of BUILD-MAX-HEAP on the array A = (3,2,15,9, 70, 18,5, 33, 8).
Illustrate the Merge sort steps (DO NOT Code) to sort the following array. 12 2 100 -4 3 -10 150 10 1
Show step by step how the merge procedure of merge sort will merge the arrays 1, 3, 4, 7, 9, 11, 13, 14 and 2, 5, 6, 8, 10, 12
4. Please illustrate the process of sorting the sequence 3, 1, 4, 1, 5, 9, 2, 6 using merge sort. (2 marks)
4. Please illustrate the process of sorting the sequence 3, 1, 4, 1, 5, 9, 2, 6 using merge sort. (2 marks)
Using Figure 10.1 as a model, illustrate the result of each operation in the sequence PUSH(S, 4), PUS(S, 1), PUSH(S, 3), POP(S), PUSH(S, 8), and POP(S) on an initially empty stack S stored in array S [1… 6].
Question 3 (2 points) Linear time sort a) Call COUNTING-SORT on the input array A (6,0,2,0,1,3,4,6,1,3,2). Using the plots on slide #67 as a model, illustrate array C after the second for loop (line 5 to 6) and the third for loop (line 7 to 8) are executed, respectively; then illustrate array B and C after executing the first 2 iterations of the fourth for loop (line 10 to 12), respectively Using the plots on slide #81 as a model,...
Sort the sequence 3, 10, 7, 2, 11, 6, 9, 4 using Merge sort. Show the intermediate steps .
Write a MIPS assembly language for sorting an array of integers using non-recursive bottom-up merge sort algorithm. Your program should print the processed array after each step of the merge sort. For example, if the input array is 14 27 13 11 49 63 17 9, your program should print each sort process: Input Arra;y 14 27 13 11 49 63 17 9 Print After first Iteration 14 27 11 13 49 639 17 Print After second iteration 11 13...