A repository for the presentations we've developed on the books we've covered
A clean code, tdd driven approach towards developing some fundamental computer science algorithms
Sample implementations of Mandelbrot set calculations.
Implementations of the hungarian algorithm for various programming languages
Hungarian algorithm for sparse systems, implemened in Java with TDD.
A concurrency exercise designed to work through Bob Martin's concurrency chapter in Clean Code by playing a strange card game
An Implementation of Conway's Game of Life used to demo Clean Code and TDD
An example of Nicholas Vaidyanathan's dirty old code, written in Spring 2008, before learning best practices. Viable target for refactoring and playing around with