01What does Big O notation represent?
02Which complexity is more efficient: O(n log n) or O(n²)?
03What is the time complexity of accessing an array element by index?
04What is the space complexity of a recursive Fibonacci function (naive)?
05Which notation describes the 'best-case' scenario?
06An algorithm with 3 nested loops (each iterating n times) has what complexity?
07What is 'amortized' complexity?
08What does Big Theta (Θ) represent?
09If we drop constants from O(2n + 5), the result is:
10What is the complexity of Binary Search?