Which of the following has the highest time complexity for large n?

Question

Accepted Answer

(D) O(2^n). Explanation: Growth order: O(n log n) < O(n²) < O(n³) << O(2^n). Exponential is the highest.