Introduction
Strassen’s method of matrix multiplication is a typical divide and conquer algorithm. We’ve seen so far some divide and conquer algorithms...
0 replies - 1246 views - 11/27/12 by Stoimen Popov in Articles
Introduction
Along with Kruskal’s minimum spanning tree algorithm, there’s another general algorithm that solves the problem. The algorithm of...
2 replies - 4215 views - 11/20/12 by Stoimen Popov in Articles
Introduction
One of the two main algorithms in finding the minimum spanning tree algorithms is the algorithm of Kruskal. Before getting into the details,...
0 replies - 5694 views - 11/13/12 by Stoimen Popov in Articles
Introduction
Here’s a classical task on graphs. We have a group of cities and we
must wire them to provide them all with electricity. Out of all...
0 replies - 4987 views - 11/06/12 by Stoimen Popov in Articles
Introduction
We saw how to find the shortest path in a graph with positive edges using the Dijkstra’s algorithm.
We also know how to find the shortest...
0 replies - 4236 views - 10/29/12 by Stoimen Popov in Articles
Originally posted by Eric Burnett, a software engineer at Google on thelowlyprogrammer.comThe human brain has the best storage system on the block in a lot of...
0 replies - 4379 views - 10/29/12 by Mitch Pronschinske in Articles
Introduction
As we saw in the previous post, Dijkstra's algorithm
is very useful when it comes to finding all the shortest paths in a
weighted graph....
0 replies - 4489 views - 10/22/12 by Stoimen Popov in Articles
Introduction
We already know how we can find the shortest paths in a graph
starting from a given vertex. Practically we modified breadth-first
search in...
0 replies - 5510 views - 10/15/12 by Stoimen Popov in Articles
Introduction
Since with graphs we can represent real-life problems it’s almost
clear why we would need an efficient algorithm that calculates the...
2 replies - 7336 views - 10/09/12 by Stoimen Popov in Articles
Introduction
So far we know how to implement graph depth-first and breadth-first
searches. These two approaches are crucial in order to understand graph...
0 replies - 3935 views - 09/25/12 by Stoimen Popov in Articles
To be sure to be well prepared for an interview, I decided to read several Algorithms book. I also chosen books in order to have information about data...
0 replies - 4958 views - 09/17/12 by Baptiste Wicht in Articles
Since we already know how to represent graphs,
we can go further for some very simple approaches of walking through
them. Passing by all the vertices of a...
2 replies - 5038 views - 09/10/12 by Stoimen Popov in Articles
Introduction
Here’s one task related to the tree data structure. Given two nodes, can you find their lowest common ancestor?
As a matter of fact, this...
0 replies - 5613 views - 08/27/12 by Stoimen Popov in Articles
The following algorithm is based on work of Ramanujan and has been used in several world-record calculations of pi.
Initialize a0 = 6 – 4 √2 and y0 = √2...
0 replies - 4813 views - 08/20/12 by John Cook in Articles
Introduction
Linked lists are one very common and handy data structure that can be
used in many cases of practical programming. In this post we’ll...
0 replies - 4598 views - 08/14/12 by Stoimen Popov in Articles
