PDSA · WEEK 2

Measuring efficiency, searching and sorting.

Learn to compare algorithms, search a sorted list, and build three classic sorting methods from first principles.

8 study sections16 illustrations1 revision page
Start Lesson 1 →

Study sections

Follow the order or choose a section
01

Analysis of Algorithms

Measuring efficiency

Open section →
02

Comparing Orders of Magnitude — Big O, Ω and Θ

Measuring efficiency

Open section →
03

Calculating Complexity — Worked Examples

Measuring efficiency

Open section →
04

Searching in a List — Linear and Binary Search

Searching and sorting

Open section →
05

Selection Sort

Searching and sorting

Open section →
06

Insertion Sort

Searching and sorting

Open section →
07

Merge Sort

Searching and sorting

Open section →
08

Analysis of Merge Sort — Why It Is O(n log n)

Searching and sorting

Open section →