Computer Science
Loops, recursion, binary
- Start βLesson 1 Β· β± 8 min Β· 3 stepsSorting by seeingWatch bubble sort compare and swap, one step at a time.
- Start βLesson 2 Β· β± 10 min Β· 4 stepsLoops: do it againMake the computer repeat work so you don't have to.
- Start βLesson 3 Β· β± 10 min Β· 5 stepsLists of things (arrays)Store many values in order, and add or remove them.
- Start βLesson 4 Β· β± 10 min Β· 4 stepsSearching and speedWhy some ways of finding things are much faster than others.
- Start βLesson 5 Β· β± 12 min Β· 4 stepsRecursion: a mirror in a mirrorFunctions that call themselves, and the one rule that stops them.
- Start βLesson 6 Β· β± 8 min Β· 4 stepsCounting in binaryHow computers count with only 0s and 1s.
- Start βLesson 7 Β· β± 10 min Β· 4 stepsLook things up by nameObjects store values under names, perfect for finding things fast.