Question

llican chat lor sorted lin of las dy, ...,a, and Ka knEr z. Issarytkard.z, an-。。,a, 》 ale (ni amRkr tbr kikmrg t刱鲫rhelgrithrEK 1. return Land archizq.....«.) procedure Sarrk2l/n-...as) and abo ht,

Answer 1

a)

i)

Search1: Best case for linear search is O(1) as provided so search1 will take O(1) time

Search2: Seacrh2 will first sort number which takes O(nlogn) in all cases as provided, and binary search takes O(logn) in all cases.

So best case time will be O(nlogn) + O(logn) = O(nlogn)

Search 1 will be better for best case as it takes less time.

b) worst case

Search1: Linear searchs wost case is O(n) so worst case time of Search 1 is O(n)

Search2: Seacrh2 will first sort number which takes O(nlogn) in all cases as provided, and binary search takes O(logn) in all cases., so worst case time will be O(nlogn)

Search1 is better than Search2 as it takes less time in worst case.