ikrams.com

I've written a small Colorforth application, a demonstration of selection sort. All it does right now is display a randomized array, sort its contents and display the result. With a little extra work it could be made to 'animate' the sort. The code is laid out in two blocks, one containing the initialization and sorting words, ...

Even though my previous attempt at the Street Numbers problem used a superior algorithm to the naive solver, it still churns out results at a very casual rate. This time I will write about a way of eking a little extra 'oomph' out of the same basic algorithm. While running the previous solver, I thought it ...

This is the second post on the Street Numbers problem. The solver I implemented last time has 3 levels of iteration, which I am going to cut down to 2 here. To recap, the outermost loop makes a tour of the city street by street. While doing so a house-to-house search is conducted in the currently ...

I plan on writing some articles on the Street Numbers problem, starting with the present one in which I present a rudimentary solver in Common Lisp. I'm quite fond of using this problem in my teaching. For one thing, it has a particularly inefficient naive solution, so in the process of optimizing the algorithm, students get ...