A-Level Computer Science

ComplexityEnglish
Exam overview

Practice session

Which Big-O notation describes an algorithm whose run-time doubles every time the input size increases by one?

Loading your practice session…