Question

What is the maximum number of comparisons made when searching a 60 element array with Binary Search? 60 30 5 6 Question 3 (3 points) What is the average number of comparisons made when searching a 60 element array with Linear Search? 06 5

Answer 1

ANSWER:

QUESTION	ANSWER	EXPLANATION
1.	5	The maximum number of comparisons in array of 60 elements with binary search requires log2(60) = 5.9 => 5 comparisons. NOTE: Binary search reduces the search space to its half in each iteration. Hence, For an array of 60 elements, maximum 5 comparisons will be required.
2.	30	The average number of comparisons in linear search will be equal to (n/2) = (60/2) = 30 comparisons NOTE: n is the array size.
3.	Pass 1 for Selection Sort: [6, 4, 7, 2, 3, 5] Pass 2 for Selection Sort: [2, 4, 7, 6, 3, 5] Pass 3 for Selection Sort: [2, 3, 7, 6, 4, 5] Pass 4 for Selection Sort: [2, 3, 4, 6, 7, 5] Pass 5 for Selection Sort: [2, 3, 4, 5, 7, 6] Final Sorted Array: [2, 3, 4, 5, 6, 7]	SAMPLE CODE: def selectionSort(l): for i in range (len(1)-1): print("Pass",i+1,"for Selection Sort:",1) index=i for j in range (i+1, len(L)): if l[index] > l[j]: index = j l[i],l[index] = 1[index],1[i] print("Final Sorted Array:",1) l= [6, 4, 7, 2, 3, 5] selectionSort(list(l))