If one uses straight Two-way Merge Sort algorithm to sort the following elements in ascending order 20, 47, 15, 8, 9, 4, 40, 30, 12, 17 then the order of these elements after the third pass of the algorithm is:

Show step by step operations when insertion algorithm is used to sort the following  sequence:  -2 -1 3 -4 -3 1

Q1Apply selection sort for the following list to sort it in ascending order. Record your answer for the first two passes. 80 Pass 1 29 Pass 2 73 43 97 How many comparisons and exchanges are done in each pass of the selection sort algorithm? Comparisons Passes Exchanges 52 Original Pass 1 Pass 2

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