Stoimen Popov04/17/12
4747 views
0 replies
Have you ever asked yourself which algorithm is used to find a word after clicking Ctrl+F and typing something? Well, you probably know the answer from the title, but in this article Stoimen Popov explains how exactly this is done.
Stoimen Popov04/11/12
6053 views
0 replies
Stoimen Popov returns with his Algorithm of the Week series, and in this post, he tackles the task of improving on the Brute Force String Matching and Rabin-Karp Sting Searching algorithms. To do this, he examines the flaws in the previous two, and explains how the Morris-Pratt String Searching algorithm can do better.
Stoimen Popov04/03/12
6481 views
0 replies
Last week, Stoimen Popov explained Brute Force String Matching, but cautioned that it is not the most efficient method for pattern matching. In this post, Stoimen breaks down a more efficient method, the Rabin-Karp Algorithm, and explains why it is more efficient in practice than in theory.
Stoimen Popov03/27/12
5906 views
0 replies
When it comes to string matching, the most basic approach is what is known as brute force, which simply means to check every single character from the text to match against the pattern. In this post, Stoimen Popov explains the principles behind Brute Force String Matching, demonstrates its implementation, and shows you what cases it is best used for.
Stoimen Popov03/21/12
4222 views
0 replies
Radix sort is an elegant and fast integer-sorting algorithm as explained in the following cheatsheet. In this post, Stoimen has provided an Algorithm Cheatsheet to help you out!
Stoimen Popov03/20/12
5351 views
0 replies
Stoimen Popov continues his series on Algorithms, this week tackling Radix Sort. In this post, Stoimen explains the implementation of Radix Sort using PHP, and provides a Pros and Cons list to help you decide if Radix Sort is right for your situation.
Ben Kepes03/14/12
3382 views
0 replies
Ben Kepes was researching a whitepaper for CloudU that looked at the different languages modern developers of cloud applications might consider -- when he noticed some problems. While the myriad of different components of web applications provide great flexibility, they do little to hide the complexity of development...
Stoimen Popov03/13/12
4842 views
1 replies
In general Quicksort consists of some very simple steps. First we have to choose an element from the list (called a pivot) then we must put all the elements with a value less than the pivot on the left side of the pivot and all the items with value greater than the pivot on its right side. After that we must repeat these steps for the left and the right sub-lists. As Stoimen Popov explains, that is Quicksort! Simple and elegant!
Stoimen Popov03/06/12
12788 views
2 replies
Basically sorting algorithms can be divided into two main groups: those based on comparisons and those that are not. Having already posted about some of the algorithms of the first group, Stoimen Popov explains how using Merge Sort can be a faster and easier implementation than comparison-based algorithms and how to implement it...
Daniel Doubrovkine03/05/12
4181 views
0 replies
If "GitHub Hacked" is news to you, Daniel Doubrovkine has a short list of things you need to do to make sure your code is safe...
Cal Evans02/27/12
2306 views
0 replies
DC4D is back with a day focused on educating developers on how to better handle the business side of things. Should be a good, informative day for all involved!
Stoimen Popov02/21/12
6459 views
2 replies
It’s weird that bubble sort is the most famous sorting algorithm in practice since it is one of the worst approaches for data sorting. Why is bubble sort so famous? Perhaps because of its exotic name or because it is so easy to implement.
Stoimen Popov02/14/12
6695 views
0 replies
There are two main approaches in sorting – by comparing the elements and without comparing them. A typical algorithm from the first group is insertion sort, very simple and very intuitive to implement, it is useful for small sets of data with about no more than 20 items.
Stoimen Popov01/31/12
6193 views
0 replies
I will show you how you can save space for certain implementations by reducing the amount of characters you are encoding using relative encoding.
Stoimen Popov01/24/12
9501 views
1 replies
Two variants of run-length encoding
are the diagram encoding and the pattern substitution algorithms. The
diagram encoding is actually a very simple algorithm.
