The running time of Counting Sort is pseudo-polynomial in input size n for a given array A[1..n] of integers. O True O False

Write the algorithm which finds the second maximum value of the array. Then find the complexity of the algorithm as Big O notation

Write a Java program to sort an array of given integers using Selection Sort Algorithm.

Select all the statements that are false, bubble sort is defined below:* Quicksort is the fastest sorting algorithm If you are lucky, you can get O(n) time complexity in Mergesort On the worst case, Bubble sort will give you O(n logn) time complexity Average time complexity of insertion sort is much better than bubble sort Selection sort has the worst space complexity among all the sorting algorithm

Write pseudocode for a divide-and-conquer algorithm for finding the position of the largest element in an array of n numbers.