Heap sort algorithm is ________, the worst case time complexity of sorting an array containing N elements with heap sort is _________. Group of answer choices unstable, O(NlogN) stable, O(N2) stable, O(NlogN) unstable, O(N2)

We are to apply Heap Sort on array: 40 63 8 19 5 60 52. What is the content of the array after Step 1 of Heap sort : build the initial heap?   Question 25 options:   40, 60, 63, 19, 5, 8, 52   63, 40, 8, 19, 5, 60, 52   63, 40, 60, 19, 5, 8, 52   40, 63, 8, 19, 5, 60, 52

1. "Max-beapitx (create a max-heap from) the following array using the bottom-up, O(n), algorithm. Show the final order in the array. Array: 69 2 1 3 45 Array:

Which of the following sorting algorithms can be used to sort a random linked list with minimum time complexity?a) Insertion Sortb) Quick Sortc) Heap Sortd) Merge Sort