How many comparisons would be made for each of the following 3 algorithms if the input is an identical array of size 6. • selection sort • insertion sort merge sort

Write an array that when sorting using Selection Sort, requires O(n^2) time complexity and only O(n) using Insertion Sort. Provide explanations for how you got your answer.

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

Write the algorithm which finds the second maximum value of the array. Then find the complexity of the algorithm as Big O 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

Trace the bubble sort algorithm as it sort the following array into ascending order: 20 80 40 25 60 30?

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