1.

The complexity of Binary search algorithm is(a) O(n)(b) O(log )(c) O(n2)(d) O(n log n)The question was posed to me in exam.This interesting question is from Sorting in chapter Query Processing Techniques of Database Management

Answer» CORRECT answer is (b) O(LOG )

EASIEST EXPLANATION - This shows that it has a standard complexity in addressing.


Discussion

No Comment Found

Related InterviewSolutions