Small Fix for Binsearch In ‘ANSI Common Lisp’ by Paul Graham
Posted in lisp on November 23rd, 2007 No Comments »
I found a small bug in the binary search described in Paul Graham’s book ‘ANSI Common Lisp’. When I wrote a few unit tests for the code snippet on page 60 I found that there is unbounded recursion when the item exists below the lower bound of the vector being searched. It’s really a small […]