Skip to content
College Subject Practice · College Year 1

Algorithm Analysis practice questions — College Subject Practice · College Year 1 Algorithms

Practise algorithm analysis with topic-based questions. Preview a sample, then start a short session.

See the question style before signup · Get instant feedback · Continue with focused practice

Try a sample question

Check your answer to see the explanation where one has been published.

Try this question
The space complexity of an algorithm measures:

1 sample question · No signup needed

Something unclear? Report this question.

2
The recurrence T(n)=T(n−1)+O(n)T(n) = T(n-1) + O(n) solves to:
3
Two consecutive (non-nested) loops, one running n times and another running m times, have combined complexity:
Start a sample session

50 published questions available for this topic.