The complexity of Binary search algorithm is
O(n)
O(log )
O(n2)
O(n log n)
Also checkout these categories
Fluid Mechanics MCQ Thermodynamics MCQ Php Programming MCQ Inequalities MCQ Photo-Chemistry MCQ Error Detection MCQ Clause Analysis MCQ Letter and Symbol Series MCQ Lower urinary tract trauma MCQ Ratio and Proportion MCQ Area MCQ IBPS Common Written Exam (PO/MT) Main 2016 Solved Paper MCQ
- The memory address of the first element of an array is called
- The Average case occur in linear search algorithm
- Which of the following is two way list?
- Which of the following statement is false?
- A binary search tree whose left subtree and right subtree differ in hight by at most 1 unit is called…
- Which of the following data structure is non linear type?
- Binary search algorithm can not be applied to
- When determining the efficiency of algorithm the time factor is measured by
- Each array declaration need not give, implicitly or explicitly, the information about
- Which of the following is true about the characteristics of abstract data types? i) It exports a type.…
- Which of the following algorithm design technique is used in the quick sort algorithm?
- _______ level is where the model becomes compatible executable code
- The number of swapping needed to sort numbers 8,22,7,9,31,19,5,13 in ascending order using bubble sort…
- To represent hierarchical relationship between elements, Which data structure is suitable?
- Which of the following data structures are indexed structures?
- When inorder traversing a tree resulted E A C K F H D B G; the preorder traversal would return
- The difference between linear array and a record is
- For an algorithm the complexity of the average case is
- _____ is not the component of data structure.
- The memory address of fifth element of an array can be calculated by the formula
- Inserting an item into the stack when stack is not full is called _______ Operation and deletion of…
- Which of the following is not the required condition for binary search algorithm?
- Linked list are not suitable data structure of which one of the following problems ?
- If the values of a variable in one module is indirectly changed by another module, this situation is…
- The complexity of linear search algorithm is
- Stack is also called as
- Which of the following name does not relate to stacks?
- The operation of processing each element in the list is known as
- ……………. Is a pile in which items are added at one end and removed from…
- When new data are to be inserted into a data structure, but there is no available space; this situation…