Algorithms & Computation

Topic overview

Only applicable to the computer science direction: basic algorithms, the concept of time complexity

Discontinued; only retained for training on the final historical syllabus scope, and is not a current entrance examination.

Key points

◆Follow the prerequisite knowledge requirements given by the examination body; new concepts may only be used when the question provides sufficient guidance.
◆The examples on this site are training with a limited scope and do not represent full syllabus coverage or official difficulty.

Try each example yourself before checking the explanation.

1Basic examples within scope

An algorithm processes a list of $n$ items and performs $\frac{n(n+1)}{2}$ comparisons. What is its time complexity?

Ready to practise this topic?

Practise the available questions for this topic. Difficulty labels are platform references.