Bissoy.com
Doctors Medicines MCQs Q&A

The complex of Binary search alogrithm is___

The complex of Binary search alogrithm is___ Correct Answer O(log n)

Binary search, also known as half - interval search or logarithmic search is a search algorithm that finds the position of a target value within a sorted array. In Binary search algorithm, worst case performance is O(logn), Best case performance is O(1).

Related Questions

We create a binary search tree B1 by inserting the numbers 1, 2, 3, 4, 5 into an empty binary search tree. We create another binary search tree B2 by inserting the numbers into an empty binary search tree in the reverse order. What is the difference between the right-most element of B1 and the left-most element of B2?
Which of the following is/are correct about a strictly binary tree? A. A binary tree is called strictly binary tree if every non-­leaf node of it has non empty left and right sub tree B. In strictly binary tree can have two children or no child C. A strictly binary tree with n leaves always contact 2n­-1 nodes
A point z has been plotted in the complex plane, as shown in figure below.
Complex Variable mcq question image
The plot for point $$\frac{1}{{\text{z}}}$$ is
The Fourth Amendment to the Constitution protects citizens against unreasonable searches and seizures. No search of a person's home or personal effects may be conducted without a written search warrant issued on probable cause. This means that a neutral judge must approve the factual basis justifying a search before it can be conducted.
This paragraph best supports the statement that the police cannot search a person's home or private papers unless they have
Under Section 95 of the Code of Criminal Procedure, 1973, certain publications can be forfeited and search warrant can be issued for the same. In this context, which of the following is/are the correct legal proposition?
1. A news paper cannot be forfeited and search warrant cannot be issued for the same as it would be violative of the fundamental right of speech and expression
2. A book can be forfeited and search warrant can be issued for the same
3. A document can be forfeited and search warrant can be issued for the same
Select the correct answer:
Under section 95 of Criminal Procedure Code certain publications can be forfeited and search warrant can be issued for the same. In this context, the propositions are
1. A newspaper cannot be forfeited and search warrant cannot be issued for the same as it would be violative of the fundamental right of speech and expression and involves the fourth estate.
2. A book can be forfeited and search warrant can be issued for the same.
3. A document can be forfeited and search warrant can be issued for the same.
Which of the following is correct
The following numbers are inserted into an empty binary search tree in the given order: 10, 1, 3, 5, 15, 12, 16. What is the height of the binary search tree?
Suppose we have to insert the following sequence of keys into an empty binary search tree: 5, 7, 45, 60, 50, 23, 15, 54 What would be the height of binary search tree?
Consider the following statements: I. The smallest element in a max-heap is always at a leaf node II. The second largest element in a max-heap is always a child of the root node III. A max-heap can be constructed from a binary search tree in Θ(n) time IV. A binary search tree can be constructed from a max-heap in Θ(n) time Which of the above statements are TRUE?
In which of the cases uniform binary search fails compared to binary search?