An array of eight integers is to be sorted in ascending order. The original orde
ID: 3830384 • Letter: A
Question
An array of eight integers is to be sorted in ascending order. The original order of the integers in the array is given in the right-most column of the below table. Give the contents of the array after processing the integers through the below seven algorithms.
With the exception of the heap sort, which will begin with the integers stored in the initial heap, all algorithms should begin with the integers stored in their original order. In the case of the Binary Search Tree algorithm, assume the integers are inserted into the tree in array index order: first 12, then 100, then 68, etc.
Original Order
Binary Search Tree
Initial Heap
Heap sort one pass
Bubble sort one pass
Radix sort one pass
Merge sort two passes
Quicker sort one pass
12
100
68
8
110
3
7
1
Original Order
Binary Search Tree
Initial Heap
Heap sort one pass
Bubble sort one pass
Radix sort one pass
Merge sort two passes
Quicker sort one pass
12
100
68
8
110
3
7
1
Explanation / Answer
answer is :
i hope it will help you
Original Order Binary Search Tree Initial Heap Heap sort one pass Bubble sort one pass Radix sort one pass Merge sort two passes Quicker sort one pass 12 1 12 100 12 100 8 12 100 3 100 12 68 110 12 100 68 7 68 68 8 1 68 68 8 8 8 8 100 12 100 8 110 12 110 110 3 3 1 110 3 68 3 3 7 7 3 3 7 100 7 7 1 68 7 7 1 110 1 1 110 8 110 1Related Questions
drjack9650@gmail.com
Navigate
Integrity-first tutoring: explanations and feedback only — we do not complete graded work. Learn more.