in Education by
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 Select the correct answer from above options Interview Questions and Answers, Database Interview Questions and Answers for Freshers and Experience

1 Answer

0 votes
by
Correct answer is (b) O(log ) Easiest explanation - This shows that it has a standard complexity in addressing.

Related questions

0 votes
    The complexity of a linear search algorithm is (a) O(n) (b) O(log n) (c) O(n2) (d) ... Questions and Answers, Database Interview Questions and Answers for Freshers and Experience...
asked Oct 11, 2021 in Education by JackTerrance
0 votes
    This common code is said to run in O(N) time assuming isSubstring runs in O(N+M) time. How do ... , JavaScript Questions for Interview, JavaScript MCQ (Multiple Choice Questions)...
asked Apr 2, 2022 in Education by JackTerrance
0 votes
    The complexity of the average case of an algorithm is (a) Much more complicated to analyze than that ... from Sorting in chapter Query Processing Techniques of Database Management...
asked Oct 10, 2021 in Education by JackTerrance
0 votes
    The Diffie-Hellman algorithm exploits the computational complexity of the __________ problem. (1)Discrete logarithm (2)Integer factorization (3)Exponential logarithm...
asked Mar 21, 2021 in Technology by JackTerrance
0 votes
    The Worst case occur in linear search algorithm when (a) Item is somewhere in the middle of the array ... , Database Interview Questions and Answers for Freshers and Experience...
asked Oct 11, 2021 in Education by JackTerrance
0 votes
    The Average case occur in linear search algorithm (a) When Item is somewhere in the middle of the ... from Sorting in portion Query Processing Techniques of Database Management...
asked Oct 10, 2021 in Education by JackTerrance
0 votes
    The search algorithm which is similar to the minimax search, but removes the branches that don't affect the final ... Breadth-first search Alpha-beta pruning None of the above...
asked Mar 8, 2021 in Technology by JackTerrance
0 votes
    write a program to print fibonacci series . write a program to search an element within the array using binary search Select the correct answer from above options...
asked Dec 29, 2021 in Education by JackTerrance
0 votes
    Binary search tree definition and operations in data structure Select the correct answer from above options...
asked Dec 13, 2021 in Education by JackTerrance
0 votes
    write the steps to search the 13 from the following element using binary search 2,4,5,8,9,11,12,13,15,18,21,22,25,29,30 Select the correct answer from above options...
asked Dec 13, 2021 in Education by JackTerrance
0 votes
    In a computational complexity theory, a problem with decision making is said to be NP-complete when it is both ... c) Non-deterministic Polynomial time d) Non Probabilistic time...
asked Dec 29, 2022 in Technology by JackTerrance
0 votes
    What is the time complexity for a given pancake sort given it undergoes “n” flip operations? a) O(n) b) O(n2) c) O(n3) d) O(2n)...
asked Dec 28, 2022 in Technology by JackTerrance
0 votes
    There is a React Native application, I want to make a cyclomatic complexity analysis. Please, tell me what ... Questions for Interview, JavaScript MCQ (Multiple Choice Questions)...
asked May 26, 2022 in Education by JackTerrance
0 votes
    There is a React Native application, I want to make a cyclomatic complexity analysis. Please, tell me what ... Questions for Interview, JavaScript MCQ (Multiple Choice Questions)...
asked May 19, 2022 in Education by JackTerrance
0 votes
    I ran some test to determine if O(==) for Strings is O(len(string)) or O(1). My tests: ... questions, JavaScript Questions for Interview, JavaScript MCQ (Multiple Choice Questions)...
asked Apr 9, 2022 in Education by JackTerrance
...