Algorithms (Edexcel A-Level Further Mathematics): Flashcards

Step-by-step instructions to solve a problem or perform a task

Input, Process, Output

Efficiency in time/resources as input size $n$ grows

Upper bound of an algorithm's complexity

Constant time (independent of input size)

Linear time (directly proportional to input size)

Quadratic time (e.g., nested loops)

Logarithmic time (e.g., binary search)

$O(n^3)$

$O(E \log n)$ where $E$ is number of edges