The complexity of binary search algorithm is: - (i) O(n) - (ii) O(\log — PYQDeck

PyQdeckBEU PYQ Archive Subjects

Back to the 2019 paper

Module 2: Divide and Conquer Paradigm and Heaps

20192m

The complexity of binary search algorithm is:

(i) $O(n)$
(ii) $O(\log n)$
(iii) $O(n^2)$
(iv) $O(n \log n)$

This question has repeated before

Also appeared in 2022.

Search Google Ask AI

Similar questions

Design & Analysis of AlgorithmsThe complexity algorithm of binary search is: - (i) O(n) - (ii) O(\log n) - (iii) O(n^2) - (iv) O(n \log n)20222m Design & Analysis of AlgorithmsAn algorithm is made up of two independent time complexities f(n) and g(n). Then the complexity of the algorithm is in order of: - (i) f(n) \times g(n) - (ii) \max(f(n), g(n)) - (iii) \min(f(n), g(n)) - (iv) f(n) + g(n)20232m Design & Analysis of AlgorithmsDiscuss the average, worst, and best time complexity of the algorithm. Give suitable examples.20237m Design and Analysis of Algorithms An algorithm is made up of two independent time complexities f(n) and g(n). Then the complexities of the algorithm is in the order of (i) f(n) \times g(n) (ii) \max \{ f(n), g(n) \} (iii) \min \{ f(n), g(n) \} (iv) f(n) + g(n)20222m

PreviousWhich one of the following is an application of Queue Data Structure? - (i) When a resource is shared among multiple consumers - (ii) When data is transferred asynchronously (data not necessarily received at same rate as sent) between two processes - (iii) Load balancing - (iv) All of the above NextDiscuss the steps in mathematical analysis for recursive algorithm. Do the same for finding the factorial of a number?