Searching and Sorting · Algorithms · GATE Data Science and Artificial Intelligence

Marks 1

For which of the following inputs does binary search take time $O(\log n)$ in the worst case?

Suppose that insertion sort is applied to the array $[1,3,5,7,9,11, x, 15,13]$ and it takes exactly two swaps to sort the array. Select all possible values of $x$.

EXAM MAP

Browse past year questions by exam & subject

Joint Entrance Examination

JEE Main JEE Advanced MHT CET BITSAT COMEDK WB JEE KCET VITEEE AP EAPCET TS EAMCET IAT (IISER)

Medical

NEET AIIMS MHT CET (Biology)

Graduate Aptitude Test in Engineering

GATE CSE GATE ECE GATE EE GATE ME GATE CE GATE PI GATE IN GATE Data Science and Artificial Intelligence

Civil Services

UPSC Civil Service

Defence

Staff Selection Commission

CBSE