Given an array arr = {30, 45, 48, 51, 67, 88,91} a) If target= 51 which...

Transcribed Image Text:

Given an array arr = {30, 45, 48, 51, 67, 88,91} a) If target= 51 which searching algorithm is better (linear or binary search), what is the time complexity of finding 51 with your chosen algorithm b) If target = 30 which searching algorithm is better (linear or binary search), what is the time complexity of finding 30 with your chosen algorithm c) If target=91 which searching algorithm is better (linear or binary search), what is the time complexity of finding 91 with your chosen algorithm d) Discuss the time complexity of Linear search algorithm when target is not found e) Discuss the time complexity of Binary search algorithm when target is not found Given an array arr = {30, 45, 48, 51, 67, 88,91} a) If target= 51 which searching algorithm is better (linear or binary search), what is the time complexity of finding 51 with your chosen algorithm b) If target = 30 which searching algorithm is better (linear or binary search), what is the time complexity of finding 30 with your chosen algorithm c) If target=91 which searching algorithm is better (linear or binary search), what is the time complexity of finding 91 with your chosen algorithm d) Discuss the time complexity of Linear search algorithm when target is not found e) Discuss the time complexity of Binary search algorithm when target is not found

Answer rating: 100% (QA)

Lets analyze each part of your question a If the target is 51 binary search is better in this case B... View the full answer