What value will be returned by Partition (A, p, r) algorithm when all elements in the array A[p...r] has the same value? a. p b. p+1 C. r d. r+1 e. None of the answers

In class we introduced an algorithm to find the ??ℎ smallest number, which is based on the randomized-partition. Let us assume that instead of randomized partition, we always select the last element of the array as the pivot. Use the algorithm to find the 2nd and the 6th smallest elements of the following array. Array = [7, 12, 3, 9, 19, 18, 11, 17] Show the detail of your work separately for each case

Create a 1D integer array of size 17. Fill each index with a random value ranging from 1 to 359 inclusive. You will then design and implement the Random Sort algorithm using the following methods: Create a method called check_if_sorted (). It should take in a 1D integer array and return a boolean value. It should return TRUE if the array is sorted in nondescending order, and FALSE otherwise. Hint: If you compare elements in the array and a pair is in the wrong order, that would mean the array is not in non-descending order. Create a method called shuffleArray (). It should take in a 1D integer array and return a 1D integer array. Shuffle the array so that the values are in random different indexes, and return altered array. Hint: There are many approaches to solve this problem – making a second array in the shuffleArray () method might be part of the answer. Create a method called PrintArray (). It should take in a 1D integer array and return nothing. Simply print the current values…

After one pass of the Quick Sort we know that: O the largest value is in its correct location. O the smallest value is in its correct location. O the values in the array are pairwise sorted. O the splitVal is in its correct location. O None of these is correct.