This is the first post in (hopefully) a series of posts on Damn Cool Algorithms - essentially, any algorithm I think is really Damn Cool, particularly if it's...
0 replies - 8118 views - 04/30/13 by Nick Johnson in Articles
That's right, it's time for another episode of the frustratingly infrequent Damn Cool Algorithms series! If you're not familiar with it, you might want to...
0 replies - 14518 views - 04/16/13 by Nick Johnson in Articles
Let’s say you have a large piece of text and a dictionary of keywords. How do you quickly locate all the keywords?
Aho-Corasick algorithm...
0 replies - 4648 views - 03/19/13 by Swizec Teller in Articles
I recently finished the Coursera course Algorithms: Design and Analysis, Part 2 by Professor Tim Roughgarden of Stanford. I’ve already reviewed part 1,...
0 replies - 4332 views - 03/12/13 by Henrik Warne in Articles
Last year I finished the Coursera course Design and Analysis of Algorithms I, given by Professor Tim Roughgarden of Stanford. This was my second on-line course...
0 replies - 4641 views - 03/05/13 by Henrik Warne in Articles
Lately I bumped in the Wikipedia page dedicated to the Selection Sort
algorithm and I found an interesting animation that shows its behavior.
So I decided...
0 replies - 982 views - 03/03/13 by Giuseppe Vettigli in Articles
ScaleBase Overview – Your complete scale out partner
Watch the Video below to learn how to scale out your MySQL Database with ScaleBase. Cost-effectively...
0 replies - 299 views - 02/22/13 by Kelley Gemma in Uncategorized
You can think of planning as a graph search problem where each node in the graph represents a possible "state" of the reality. A directed edge from nodeA to...
1 replies - 6192 views - 02/12/13 by Ricky Ho in Articles
The latest problem of the Algorithms 2 class required us to write an algorithm to calculate the shortest path between two nodes on a graph and one algorithm...
0 replies - 4095 views - 02/05/13 by Mark Needham in Articles
I recently wrote a blog post describing my implementation of Kruskal’s algorithm – a greedy algorithm using to find a minimum spanning tree (MST) of a...
0 replies - 2923 views - 01/29/13 by Mark Needham in Articles
"Actuate BIRT’s (Business Intelligence and Reporting Tool) proven technology allows software companies to innovate, leapfrog the competition and meet...
0 replies - 331 views - 01/22/13 by Kelley Gemma in Uncategorized
Last week I wrote a couple of posts showing different implementations of Prim’s algorithm – an algorithm using to find a minimum spanning tree in a graph...
0 replies - 3691 views - 01/22/13 by Mark Needham in Articles
Introduction
We know how to add two integers using a perfectly simple and useful algorithm learned from school or even earlier. This is perhaps one of the...
0 replies - 4935 views - 01/08/13 by Stoimen Popov in Articles
Introduction
What’s the fastest way to sort the following sequence [9, 3, 0, 5, 4, 1, 2, 6, 8, 7]? Well, the question is a bit tricky since the input is...
0 replies - 6728 views - 01/02/13 by Stoimen Popov in Articles
Radix Sort
The first question we ask when we see the phrase “sorting in linear time” should be – 'what’s the catch?' Indeed there’s a catch. ...
1 replies - 6516 views - 12/26/12 by Stoimen Popov in Articles
