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 - 7478 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 - 13833 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 - 4284 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 - 4265 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 - 4558 views - 03/05/13 by Henrik Warne 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 - 272 views - 02/22/13 by Kelley Gemma in Uncategorized
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 - 4025 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 - 2868 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 - 305 views - 01/22/13 by Kelley Gemma in Uncategorized
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 - 4896 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 - 6320 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 - 6437 views - 12/26/12 by Stoimen Popov in Articles
Most of the sorting algorithms that are used are generally comparison sort. It means that each element of the collection being sorted will be compared to see...
4 replies - 6073 views - 12/18/12 by Baptiste Wicht in Articles
Introduction
We already know what about the topological sort of a directed acyclic graph. So why do we need to revisit this algorithm? First of all I never...
2 replies - 6538 views - 12/11/12 by Stoimen Popov in Articles
On Monday evening, 3rd December, 2012, I went along to the British Computer Society London in the Strand for a lecture from none other than Professor...
0 replies - 2781 views - 12/07/12 by Peter Pilgrim in Articles
