Back to the full dot-point answer
EnglandComputer ScienceQuick questions
2.3 Algorithms
Quick questions on Big-O notation, complexity classes and comparing algorithms - OCR A-Level Computer Science H446
3short Q&A pairs drawn directly from our worked dot-point answer. For full context and worked exam questions, read the parent dot-point page.
What is q1?Show answer
State what Big-O notation describes. [1 mark]
What is q2?Show answer
Give the time complexity of an algorithm with a single loop running times, and one with two such loops nested. [2 marks]
What is q3?Show answer
Order , , and from most to least efficient. [1 mark]
Have a question we have not covered?
This dot-point answer is short enough that we have not extracted many short questions yet. Read the full dot-point answer or ask Mo, our study assistant, in the chat for follow ups.