A-Level Computer Science
ComplexityEnglish
Exam overviewPractice session
Which Big-O notation describes an algorithm whose run-time doubles every time the input size increases by one?
Loading your practice session…
Practice session
Loading your practice session…