Match the LIST-I with LIST-II

Pick an option to check yourself, or open the answer below.
Show answer & explanation
Correct answer: A. A-III, B-I, C-IV, D-II
Explanation
Insertion sort is O(n) in the best case (already sorted), binary search O(log n), quick sort O(n log n) on average, and selection sort O(n²).
More Data Structures and Algorithms questions
- Arrange the following recurrence relations in increasing order of their time complexity: (A) T(n) = T(n/2) + 1 (B) T(n) = 2T(n/2) + n (C) T…
- Select the Sorting Algorithms that are stable. (A) Quick Sort (B) Bubble Sort (C) Insertion Sort (D) Merge Sort (E) Shell Sort
- Match List - I with List - II.
- Match List I (recurrence) with List II (complexity). List I: (A) T(n) = 2T(n/2) + n, (B) T(n) = T(n/2) + 1, (C) T(n) = 2T(n/2) + 1, (D) T(n…
- Let n be the least integer such that f(x) is O(xⁿ). Arrange the following functions in increasing order of n: A. f(x) = 3x³ + (log x)⁴ B. f…
- Match List - I with List - II. f(n) = a f(n / b) + g(n) is a divide-and- conquer recurrence relation for the Listed-I algorithms, match the…