Making Change

This month’s challenge is to calculate the number of quarters, dimes, nickels, and pennies required when given a specific dollar amount. It’s something fast food cashiers should know, but apparently they don’t! So maybe your solution to this exercise could help them.
Continue reading →

The Factorial Recursion

It’s the example of recursion most often used, but it’s not the best example. Of course, to illustrate a better example you need to approach concepts such as fractals and graphical programming doodads. My favorite form of recursion is traversing a directory tree. Regardless, the code for a factorial recursion remains the go-to workhorse.
Continue reading →