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

Write a pseudocode to solve the following problem: Odd index element probleminput: a non-empty sequence S of n elementsoutput: a list of all the elements in the odd index, or None if S is empty

Describe an algorithm for finding the 10 largest elements in an array of size n. What is the running time of your algorithm?

The number of element comparisons in Lomuto’s algorithm are a. n+1 b. n-1 c. n/2 d. 1

Quicksort is a powerful divide-and-conquer sorting algorithm that can be described in just four lines ofpseudocode. The key to Quicksort is the PARTITION(A, p, r) procedure, which inputs elementsptorof array A,and chooses the final element x = A[r] as the pivot element. The output is an array where all elementsto the left ofxare less thanx, and all elements to the right of x are greater than x. In this question, we will use the Lomuto Partition Method from class and assume that the pivot isalwaysthe last (right-most) element of the input array. Question: Let A be an array withn= 2k−1 elements, where k is some positive integer. Determine a formula (in terms of n) for the minimum possible number of total comparisons required by Quicksort, as well as a formula for the maximum possible number of total comparisons required by Quicksort. Use your formulas to show that the running time of Quicksort is O(nlogn) in the best case and O(n2) in the worst case.

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.

do not plagiarise