Skip to content
- Intro to Modular Arithmetic
- Number Bases and Conversion
- Calculating Number of Factors
- Greatest Common Factor (GCF)
- Least Common Multiple (LCM)
- Prime Factorization
- Factors, Divisors, and Multiples
- Number Classifications
- Breadth-First Search (BFS)
- Graph Representation
- Quicksort
- Sierpinski’s Gasket
- Insertion Sort
- Selection Sort
- Binary Search
- Neo-Geo (Consolized MV-1C Arcade board)
- XBand Modem (SNES)
- XBand Modem (Genesis)
- Apple IIc
- VTech Laser Compact XT
- Northstar Advantage
- Altos ACS 8000-10A
- Amiga 500
- Amiga 600
- Amiga 1200
- Amstrad PPC 640
- Atari Portfolio
- VTech Laser 128
- Toshiba Libretto 100ct
- Toshiba Libretto 50ct
- Commodore PET 2001
- Symbolics XL-401
- Tandy TRS-80 Model 4
- ADM 5 Terminal
- Tandy 102 Portable Computer
- Tandy 128k Color Computer 3
- Sinclair 128k ZX Spectrum+2
- Ohio Scientific Challenger 1P
- IBM PalmTop PC110
- IBM 701c
- Commodore PC40-III
- Bally Professional Arcade
- AST Advantage! Adventure 6066d
- IMSAI 8080
- Amstrad CPC 464
- Project Euler: Problem 13
- Project Euler: Problem 12
- Project Euler: Problem 10
- Project Euler: Problem 9
- Project Euler: Problem 8
- Project Euler: Problem 7
- Project Euler: Problem 6
- Project Euler: Problem 5
- Project Euler: Problem 4
- Project Euler: Problem 3
- Project Euler: Problem 2
- Project Euler: Problem 1
- The magical number nine, or how I discovered a couple of interesting algorithms as a night-auditor.
- Calyx Mobile Hotspots and Beyond. A How-to Guide For Replacing Your Overpriced, Privacy-Violating ISP.