Groovy Zone | Everything for the Groovy & Grails developer

Stoimen Popov04/24/12
17352 views
4 replies

Algorithm of the Week: How to Determine the Day of the Week

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
17998 views
0 replies

Algorithm of the Week: Boyer-Moore String Searching

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
21988 views
0 replies

Algorithm of the Week: Morris-Pratt String Searching

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.

Judah Johns04/10/12
6255 views
1 replies

There is Safety in Numbers: How to Build Fail-Safe Clusters

Very often, websites can't cope with any extra load, whether from high traffic or performance reducing tasks. So, how do you solve this issue? One of the best solutions for such issues is using a cluster architecture for your applications.

Stoimen Popov04/03/12
14852 views
1 replies

Algorithm of the Week: Rabin-Karp String Searching

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
17087 views
0 replies

Algorithm of the Week: Brute Force String Matching

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.

Sacha Labourey03/25/12
9143 views
3 replies

Most Popular Tools Used on Our Java PaaS

Cloudbees CEO Sacha Labourey provides some stats on the highest performers on cloudbees.

Stoimen Popov03/21/12
8050 views
1 replies

Algorithm Cheatsheet: Radix Sort

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
17910 views
1 replies

Algorithm of the Week: Radix Sort

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.

Tim Murphy03/15/12
7545 views
2 replies

Why Do Computer Scientists Need To Understand Software Developers?

Tim Murphy discusses the need for educating Computer Scientists to understand the perspective of developers, and vice versa, after reading a tweet comparing the relationship to that of Structural Engineers and Stone Masons...

Ben Kepes03/14/12
5828 views
0 replies

Opa Aims to Rethink Development for the Cloud

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
13718 views
1 replies

Algorithm of the Week: Quicksort

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!

Mick Knutson03/10/12
4106 views
2 replies

Variable Scoping With a Multi-Module Project

I have been very frustrated by Gradle and variable scoping in a multi-module project. I have wasted countless hours trying to follow examples that simply do not work as stated, and having limited examples for the type of multi-module project that I wanted to create.

Fredrik Håård03/09/12
9890 views
1 replies

On Useless Testing...

Fredrik Haard is at it again, this time explaining why all testing is not valuable, and why the most important question to ask yourself when coding is: "What value does this code add?"...

Chaker Nakhli03/07/12
12832 views
1 replies

Recursive and Iterative Merge Sort Implementations

In response to Stoimen Popov's Algorithm of the Week Post: Merge Sort, Chaker Nakhli pointed out that Stoimen only presented a recursive version of the merge sort algorithm. In this post, Chaker presents an iterative approach written in C#, but it can be easily converted to Java or any other language...