Give the correct matching for the following pairs: (A) O(log n) (P) Selection…

PYQ GATE 1998

Give the correct matching for the following pairs:

(A) O(log n) (P) Selection

(B) O(n) (Q) Insertion sort

(C) O(n log n) (R) Binary search

(D) O(n²) (S) Merge sort

  1. A.

    A–R B–P C–Q D–S

  2. B.

    A–R B–P C–S D–Q

  3. C.

    A–P B–R C–S D–Q

  4. D.

    A–P B–S C–R D–Q

Attempted by 546 students.

Sign up free to check your answer

Sign up free

Explore the full course: Algorithms

Loading lesson…