computer science – Nate Bird

Linear-Time Sort

Posted on March 4, 2013 by Nate Bird

Sorting. That perennial problem that forms the backbone of every introductory Algorithms class. Now, hardly anyone ever has to code up their own sorting algorithm, as great implementations are included in the standard libraries for every language worth naming. But,… Continue Reading →

Thoughts on Dynamic Programming

Posted on January 28, 2013 by Nate Bird

When I taught Computer Science at university, dynamic programming was a topic that I thought was particularly important to cover in the Algorithms courses. The idea was to instill in the students the understanding that memory (space) can be exchanged… Continue Reading →