Author Archives: Matt Pulver
By Matt Pulver | Published: September 9, 2011
As ubiquitous as it is, the standard binary search algorithm can still be further optimized by using bit operations to iterate through its sorted list, in place of arithmetic. Admittedly, this is primarily an academic discussion, since the code improvement does not decrease the logarithmic complexity of the standard algorithm. Nevertheless, a well-developed programming intuition [...]
By Matt Pulver | Published: January 21, 2011
(Edited 9 Sept 2011: A few minor improvements have been made; see the updated post instead: Binary Search Revisited.) Every CS student knows how to write a binary search algorithm. The question is, are we really making full use of the fact that we are using a binary computer to do a binary search? While [...]
By Matt Pulver | Published: November 1, 2008
In order for a system to reproduce itself, it seems necessary for it to hold an encoded form of itself somehow. This idea, and the inevitability of the existence of DNA-like structures within living cells, is well-illustrated using computer code.