A step-by-step look at the Euclidean algorithm for GCD (part 7ac0)
Scottie
Understanding factorial computation (part 65b5)
Scottie
Solving and testing the Euclidean algorithm for GCD (part 9a1b)
Scottie
Step-by-step: word frequency counting (part a195)
Scottie
Pitfalls of the Euclidean algorithm for GCD (part 2c88)
Scottie
Two approaches to the Euclidean algorithm for GCD (part 6a05)
Scottie
Common mistakes in the Fibonacci sequence (part df7f)
Scottie
Exploring the sum of digits (part d5c5)
Scottie
Two approaches to the Sieve of Eratosthenes (part cf38)
Scottie
Step-by-step: computing an average (part eef5)
Scottie
Two ways to solve binary search (part 5f48)
Scottie
Pitfalls of primality testing (part b578)
Scottie
Pitfalls of anagram checking (part 3849)
Scottie
Common mistakes in word frequency counting (part c034)
Scottie
Exploring merge sort (part 69f5)
Scottie
Two approaches to palindrome check (part 2aed)
Scottie
Common mistakes in primality testing (part b28b)
Scottie
Pitfalls of merge sort (part 2a1a)
Scottie
Step-by-step: palindrome check (part 77ee)
Scottie
Walking through word frequency counting (part f116)
Scottie
Writing tests for the Sieve of Eratosthenes (part bbde)
Scottie
Step-by-step: bracket sequence validation (part 46ba)
Scottie
Walking through palindrome check (part 57dc)
Scottie
Two ways to solve minimum and maximum of a list (part 9ea4)
Scottie
Exploring removing duplicates from a list (part d493)
Scottie