Monthly Archives: February 2009
CodeSport
This month's column focuses on computational complexity and the lower bounds for algorithms. In particular, we'll show that any algorithm to find the maximum in an array of N elements has a lower bound of O(N) by using an adversary argument.
Building a Server from Scratch
Why buy expensive ‘branded’ servers? Build one yourself using off-the-shelf hardware.
