I write a monthly column for PCPlus, a computer news-views-n-reviews magazine in the UK (actually there are 13 issues a year — there's an Xmas issue as well — so it's a bit more than monthly). The column is called Theory Workshop and appears in the back of every issue. When I signed up, my editor and the magazine were gracious enough to allow me to reprint the articles here after say a year or so. After all, the PDFs do appear on each issue's DVD after a few months. When I buy the current issue, I'll publish the article from the issue a year ago. I popped over to B&N this lunchtime and bought the Christmas issue, so here's Christmas 2008's article.
This article was about caching data to make algorithms faster. I used a couple of examples to prove my point: Fibonacci numbers using the recursive algorithm and primality testing.
However — I don't know why — it just didn't come out the way I wanted it to. Rereading it now, 15 months after writing it, it feels very under-researched, boring. Possibly I tossed it off in an afternoon under deadline. I also note that the images were added by my editor, they weren't mine (besides which, I only had one). A very disappointing article, I'm afraid, certainly not one of my best. Meh.
This article first appeared in issue 276, Christmas 2008.
You can download the PDF here (but, really, I wouldn't bother).
Now playing:
Madonna - Get Together
(from Confessions On A Dance Floor)
No Responses
Feel free to add a comment...
Leave a response
Note: some MarkDown is allowed, but HTML is not. Expand to show what's available.
_emphasis_
**strong**
[text](url)
`IEnumerable`
* an item
1. an item
> Now is the time...
Preview of response