Computer Science, asked by hrishi025, 9 months ago

What is an asymptotic lower bound for binary search

algorithm?

A. Big Omega(n)

B. Big Omega(log n)

C. Big Theta(log n)

D. Big Theta(n)​

Answers

Answered by Anonymous
2

Sometimes, we want to say that an algorithm takes at least a certain amount of time, without providing an upper bound. We use big-Ω notation; that's the Greek letter "omega."

Similar questions