Given the following array: 27 38 12 39 27 16 After applying the quick-sort algorithm to the array, the first partition of the array when the pivot is the first item is: O 27 12 16 39 27 38 12 16 27 39 27 38 O 16 12 27 39 27 38 16 12 27 39 38 27 None of the above

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…

Data Structure & Algorithm: Here is an array with exactly 15 elements:1   2   3   4   5   6   7   8   9   10   11   12   13   14   15Suppose that we are doing a serial search for an element. Circle any elements that will be found by examining two or fewer numbers from the array.

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.

Assume that we have a sorted list in an array: Index:         0       1       2         3       4        5      6      7      8       9        10        11 numbers:   12     15     17      19     22      26    28   30    32     34       36       38 we want to use the binary search algorithm to find the value 19 in the list. What would be the indexes of the array that the binary search would check to find the value 19  the indexes and not the actual numbers in the list otherwise

Lab 16 Implementing bubble sort In this lab, you will implement the bubble sort algorithm. The bubble sort is so called because it compares adjacent items, "bubbling" the smaller one up toward the beginning of the array. By comparing all pairs of adjacent items starting at the end of the array, the smallest item is guaranteed to reach the beginning of the array at the end of the first pass.The second pass begins again at the end of the array, ultimately placing the second smallest item in the second position. During the second pass, there is no need to compare the first and second items, because the smallest element is guaranteed to be in the first position.Bubble sort takes at most n - 1 passes for an array of n items. During the first pass, n - 1 pairs need to be compared. During the second pass, n - 2 pairs need to be compared. During the ith pass, n - i pairs need to be compared. During the last pass, n - (n - 1) or one pair needs to be compared. If, during any pass, no two…

Sorting Algorithm   1.) Trace the bubble sort as it sorts the following array into descending order: 25 30 20 80 40 60