please answer the following question
Attachments:
Answers
Answered by
1
o(n)
is the correct option
PLZZZ mark as brainlist
is the correct option
PLZZZ mark as brainlist
konathamprathyusha:
can you explain it
explaination is not required
Answered by
1
binary search has a best case efficiency of O(1) and
worst case(average case)efficiency of O(log n),
worst case(average case)efficiency of O(log n),
Similar questions