Exam 16: Sorting, Searching, and Algorithm Analysis

The method findMax shown below is supposed to return the position of the largest Value in the portion of an array between 0 and last,inclusive: Int findMax(int array[ ],int last){ Int maxPos = 0; For (int k = 1;k < = last;k++){ // Code is Missing } Return maxPos; } The missing code is

The bubble sort algorithm works by

Suppose that we are searching for an item X in an array sorted in descending order.If we find that X is smaller than the middle item of the array,then we should continue our search in the half of the array whose elements

The worst case complexity function f(n)of an algorithm

The following implementation of QuickSort Static void doQuickSort(int array[ ],int start,int end){ Int pivotPoint; PivotPoint = partition(array,start,end); DoQuickSort(array,pivot+1,end); DoQuickSort(array,start,pivot-1); }

Sequential Search is in the complexity class