Question 1
Which notation is commonly used to describe the upper bound of an algorithm's time complexity?
Question 2
What is the time complexity of an algorithm that involves iterating through an array of $n$ elements once?
Question 3
Which of the following best describes 'space complexity'?
Question 4
An algorithm's correctness proof aims to demonstrate that the algorithm will:
Question 5
What does it mean for an algorithm to have a 'polynomial time complexity'?
