Back to the full dot-point answer
SingaporeComputer ScienceQuick questions
Algorithms and Problem Solving
Quick questions on Big-O notation and complexity explained: H2 Computing
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 the Big-O time complexity of summing all elements of a list of numbers. [1 mark]
What is q2?Show answer
Reduce to standard Big-O form. [1 mark]
What is q3?Show answer
An algorithm halves its input each step. State and justify its time complexity. [2 marks]
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.