Question

About how many comparisons would the binary search makes if the list is of length 1 million and the search item is not in the list? 500,000 comparisons 1 million comparisons 20 comparisons None of these 1 thousands comparisons D Question 18 2 pts The time complexity of the merge sort is in the worst case and in the average case (1), () Orlogan), Oorlog) Orlogo"). (1) 001), O(nlogon) (r). (1)

Answer 1

Solution

Question 17

20 comparisons

Question 18

O(nlog₂n),O(nlog₂n)

Explanation

17)

An ordered array of one billion elements can be searched using no more than 20 comparisons using a binary search.

Hence Answer is 20 comparisons

---

18)

In merge sort it does not matter if the data is sorted / random/reversed as Therefore the time complexity of the merge sort is always the O(n logn) for any case.

---

all the best