using insertion sort algorithm, the intermediate sorting results of sorting the array {11,3,24,19,5,2} in ascending order are: starting: {11 || 3,24,19,5,2,99} Result of the first iteration: { Result of the second iteration. Result of the third iteration: { Result of the fourth iteration: Result of the fifth iteration:

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

Write the algorithm which sorts the array by using the merge sort algorithm. Then find the complexity of the algorithm as Big 0 notation

In quick sort, if the input array is already sorted, which of the following algorithm will still perform at-least one swap.     a Lomuto's algorithm   b Both Lomuto's and Hoare's algorithms   c none of Hoare's or Lomuto's algorithm   d Hoare's Algorithm