Archives
TDD'ing a BinaryHeap with Pex (part 1)
Submitted by Jonathan de Halleux on Tue, 09/09/2008 - 06:39.The other day I stumbled on a first draft on a new book on algorithms (Data Structure and Algorithms). After taking a peak at the draft, I found some (hidden) motivation to finally write a decent binary heap for QuickGraph. A heap is a critical data structure for Dijkstra shortest path or Prim's minimum spanning tree algorithm, since it is used to build efficient priority queues.
Targeted Marketing (Or Not)
Submitted by jason@parlezuml.com (Jason Gorman) on Tue, 09/09/2008 - 14:28.Now this is what I call "targeted marketing":
"Hi, I am writing on behalf of Richardson's Holiday Villages to acquire
some good quality partners for the site that are related to Holidays or
Norfolk and Suffolk. I found your site: parlezuml.com while doing a
search in Google and was wondering if you would like to exchange a link
with us?"
"Hi, I am writing on behalf of Richardson's Holiday Villages to acquire
some good quality partners for the site that are related to Holidays or
Norfolk and Suffolk. I found your site: parlezuml.com while doing a
search in Google and was wondering if you would like to exchange a link
with us?"