Stoimen Popov05/09/12
3336 views
0 replies
Stoimen Popov is back with another episode in his Algorithm of the Week series, and this week he tackles prime numbers. Stoimen begins with a very basic (brute force) approach, and then refines his algorithm to be far more effective, though it still works best for smaller numbers.
Mitch Pronschinske05/04/12
1550 views
0 replies
Continuing where the last screencast left off, this third tutorial shows how to install the Acquia Connector (Acquia is an enterprise Drupal SaaS), and then...
Mitch Pronschinske05/03/12
1918 views
0 replies
Picking up where part 1 left off, this screencast continues Nick Veenhof's screencast tutorial about setting up Solr on Drupal and running various features. ...
Brian Kelly05/02/12
12665 views
6 replies
When a programmer nails the interview and test the hiring manager is still inclined to say "we'll be in touch" but that's just not always the best idea...
Steven Lott05/02/12
4520 views
1 replies
The answer is "Yes." The examples of "well-functioning non-technical CIOs" are people as rare as hen's teeth.
Stoimen Popov04/24/12
6864 views
3 replies
Do you know what day of the week was the day you were born? Monday or maybe Saturday? What about January 31st, 1883? Well, Stoimen Popov has created this post to explain a useful algorithm for determining what day of the week a certain date falls on.
Stoimen Popov04/17/12
8825 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
7992 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
7652 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
6726 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
4808 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
6064 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
3757 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
5353 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
13285 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...
