CUET PG 2026 — DSA PYQ

Match the Algorithm in List I with its standard worst-case Time Complexity in List II:

List I (Algorithm)

• A. Binary Search

• B. Merge Sort

• C. Naive Matrix Multiplication ($N\times N$)

• D. Linear Search

List II (Time Complexity)

1. $O(N^3)$

2. $O(N\log N)$

3. $O(\log N)$

4. $O(N)$