Stoimen - stoimen.com - stoimen's web log
General Information:
Latest News:
Computer Algorithms: Multiplication 14 Jan 2013 | 07:40 pm
Introduction Perhaps right after the addition at school we’ve learned how to multiply two numbers. This algorithm isn’t as easy as addition, but besides that we’re so familiar with it and that we even...
Computer Algorithms: Adding Large Integers 7 Jan 2013 | 08:16 pm
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 very first techniques we learn in mathematics...
Computer Algorithms: Bucket Sort 2 Jan 2013 | 01:44 pm
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 somehow “predefined”. First of all we have only...
Computer Algorithms: Sorting in Linear Time 24 Dec 2012 | 04:23 pm
Radix Sort The first question when we see the phrase “sorting in linear time” should be – where’s the catch? Indeed there’s a catch and the thing is that we can’t sort just anything in linear time. Mo...
Computer Algorithms: Topological Sort Revisited 10 Dec 2012 | 08:45 pm
Introduction We already know what’s topological sort of a directed acyclic graph. So why do we need a revision of this algorithm? First of all I never mentioned its complexity, thus to understand why ...
Computer Algorithms: Longest Increasing Subsequence 3 Dec 2012 | 06:22 pm
Introduction A very common problem in computer programming is finding the longest increasing (decreasing) subsequence in a sequence of numbers (usually integers). Actually this is a typical dynamic pr...
Computer Algorithms: Strassen’s Matrix Multiplication 26 Nov 2012 | 07:16 pm
Introduction The Strassen’s method of matrix multiplication is a typical divide and conquer algorithm. We’ve seen so far some divide and conquer algorithms like merge sort and the Karatsuba’s fast mul...
Computer Algorithms: Prim’s Minimum Spanning Tree 19 Nov 2012 | 06:08 pm
Introduction Along with the Kruskal’s minimum spanning tree algorithm, there’s another general algorithm that solves the problem. The algorithm of Prim. As we already know the algorithm of Kruskal wor...
Computer Algorithms: Kruskal’s Minimum Spanning Tree 12 Nov 2012 | 05:01 pm
Introduction One of the two main algorithms in finding the minimum spanning tree algorithms is the algorithm of Kruskal. Before getting into the details, let’s get back to the principles of the minimu...
Computer Algorithms: Minimum Spanning Tree 5 Nov 2012 | 05:23 pm
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 possible connections we can make, which one is using mi...
