insights
OPERATIVE-3 · suggested from Analyst

Algorithm Arena

Complexity, searching, sorting and recursion. Learn to reach for the right algorithm and to say out loud what it costs.

flag Game Missions

01

Mission 01: Cost of a Solution

Reading complexity off code before you run it.

bolt 250 XP stars 25 SP
play_circle

Name the Complexity

Programming OPERATIVE-3
arrow_forward
play_circle

Binary Search Complexity

Programming OPERATIVE-3
arrow_forward
play_circle

Spot the Hidden Loop

Programming OPERATIVE-3
arrow_forward
02

Mission 02: Searching & Sorting

Implementing the classics well enough to know when not to implement them.

bolt 300 XP stars 30 SP
play_circle

Implement Binary Search

Programming OPERATIVE-3
arrow_forward
play_circle

Stable vs Unstable Sort

Programming OPERATIVE-3
arrow_forward
play_circle

Sort Without a Full Sort

Programming OPERATIVE-3
arrow_forward
03

Mission 03: Recursion & Memoisation

Problems that describe themselves, and the cache that makes them affordable.

bolt 300 XP stars 30 SP
play_circle

Recursive Factorial

Programming OPERATIVE-3
arrow_forward
play_circle

Memoise an Expensive Function

Programming OPERATIVE-3
arrow_forward
play_circle

Why Naive Fibonacci Is Exponential

Programming OPERATIVE-3
arrow_forward
04

Mission 04: Architecture Judgement

Decisions that do not show up in a benchmark until much later.

bolt 350 XP stars 35 SP
play_circle

Identify the N+1 Query

Programming SPECIALIST-2
arrow_forward
play_circle

Choose the Cache Boundary

Programming OPERATIVE-3
arrow_forward