Two approaches to the Sieve of Eratosthenes (part 2800)
Scottie
Walking through quicksort (part 91a0)
Scottie
Common mistakes in merge sort (part c400)
Scottie
Step-by-step: computing an average (part 1f34)
Scottie
Two approaches to the Caesar cipher (part cfb6)
Scottie
Understanding the Euclidean algorithm for GCD (part d3f2)
Scottie
Understanding binary search (part afa2)
Scottie
Two approaches to the Euclidean algorithm for GCD (part b1bc)
Scottie
Two approaches to the Sieve of Eratosthenes (part 5195)
Scottie
Pitfalls of string reversal (part 5a7c)
Scottie
Step-by-step: factorial computation (part df3f)
Scottie
Common mistakes in palindrome check (part ec1a)
Scottie
Pitfalls of the Euclidean algorithm for GCD (part e1dd)
Scottie
Solving and testing the sum of digits (part 0490)
Scottie
Common mistakes in string reversal (part e69e)
Scottie
Two ways to solve the sum of digits (part e403)
Scottie
Two approaches to palindrome check (part 40f3)
Scottie
Solving and testing string reversal (part b990)
Scottie
Walking through removing duplicates from a list (part 8a7d)
Scottie
Common mistakes in factorial computation (part 3550)
Scottie
Step-by-step: computing an average (part b4ef)
Scottie
Exploring the Euclidean algorithm for GCD (part a851)
Scottie
Solving and testing removing duplicates from a list (part 38d1)
Scottie
A step-by-step look at merge sort (part c397)
Scottie
Step-by-step: the Euclidean algorithm for GCD (part 6846)
Scottie