CUET PG 2026 — DSA PYQ

Match the Implementation method in List I with its Auxiliary Space Complexity in List II:

List I (Method)

• A. Iterative Binary Search

• B. Recursive Binary Search

• C. Iterative Linear Search

• D. Graph DFS ($V$ vertices)

List II (Auxiliary Space)

1. $O(V)$

2. $O(1)$

3. $O(\log N)$ (Note: $O(\log N)$ formatted as $o(\log N)$ in source)

4. $O(1)$