The time complexity of binary search is O(logn).

Data structure - Online Exam Test Papers | Data structure - MCQs[multiple choice questions and answers ] | Data structure - Mock Test Papers | Data structure - Practice Papers | Data structure - Sample Test Papers |

Question:
The time complexity of binary search is O(logn).

1. true, false

2.false, true

3.false, false

4. true, true

Posted Date:-2022-07-05 22:27:44


More MCQS Questions and answers