What is the time complexity of binary search in a sorted array?

O(log n)

Fill in the blank: The ______ technique involves dividing a problem into subproblems, solving them independently, and then combining their solutions.

Divide and Conquer

True or False: Binary search is considered a divide and conquer algorithm.

False. Binary search is a case of decrease and conquer because it only divides the problem into one subproblem.

In the recurrence relation T(n) = T(n/2) + O(1), what is the solution according to the Master Theorem?

Theta(log n)

Riddle: I can sort numbers efficiently with fewer comparisons and use a pivot element to divide. What am I?

QuickSort

What is the auxiliary space complexity of the iterative implementation of binary search?

O(1)

Fill in the blank: The time complexity of Strassen's algorithm for matrix multiplication is approximately ______.

O(n².8074)

True or False: Merge Sort is a stable sorting algorithm.

True.

Which of the following algorithms is not a divide and conquer algorithm? A) Merge Sort B) QuickSort C) Binary Search D) Strassen’s Algorithm

C) Binary Search

In the context of finding the k-th smallest element in two sorted arrays, what is the time complexity of the optimal binary search approach?

O(log n + log m)