Consider an array of integers: 2, 5, 6, 8, 9, 11, 13, 18 Draw out how the array would search for the value 18 using the binary search algorithm. Use the state of memory model, that is show a sectioned array body and indexes (deductions apply otherwise).

During each iteration of Quick Sort algorithm, the first element of array is selected as a pivot. The algorithm for Quick Sort is given below. Modify it in such a way that last element of array should be selected as a pivot at each iteration. Also explain the advantages.

make an algorithm using the procedure to display the contents of a defined array, Array B[10] = (9, 11, 23, 7, 8, 20, 77, 22, 10, 6)

15. Consider the problem of finding the first position in which an array b occurs as a subsequence of an array a. Write two nested loops: let result undefined for (let i = 0; i < a.length - b.length; i++) { for (let j = 0; j < b.length; j++) { if (a[i+j] = b[j]) . . . } } Complete with labeled break and continue statements.

Let M(n) be the minimum number of comparisons needed to sort an array A with exactly n ele- ments. For example, M(1) = 0, M(2) = 1, and M(4) = 4. If n is an even number, clearly explain why M(n) = 2M(n/2) + n/2.