Bringing a programmer in for an interview and a coding test can lead
to some interesting experiences, both for the interviewer and the
12 replies - 24844 views - 05/02/12 by Brian Kelly in Articles
Read this Computerworld posting: Should the CIO know how to code?
The answer is "Yes."
The examples of "well-functioning non-technical...
2 replies - 10372 views - 05/02/12 by Steven Lott in Articles
Do you know what day of the week was the day you were born? Monday or
maybe Saturday? Well, perhaps you know that. Everybody knows the day
he’s born on,...
4 replies - 25834 views - 04/24/12 by Stoimen Popov in Articles
Have you ever asked yourself which algorithm is used to find a
word after clicking Ctrl+F and typing something? Well I guess you know
the answer from the...
0 replies - 23784 views - 04/17/12 by Stoimen Popov in Articles
We saw that neither brute force string searching nor Rabin-Karp string searching
are effective. However in order to improve some algorithm, first we
0 replies - 24351 views - 04/11/12 by Stoimen Popov in Articles
Brute force string matching
is a very basic sub-string matching algorithm, but it’s good for
some reasons. For example it doesn’t require preprocessing...
1 replies - 18703 views - 04/03/12 by Stoimen Popov in Articles
String matching is something crucial for database development and
text processing software. Fortunately, every modern programming language
and library is...
0 replies - 20113 views - 03/27/12 by Stoimen Popov in Articles
Radix sort is an elegant and fast integer-sorting algorithm as
explained in the following cheatsheet. Please click on the image bellow
to download the...
1 replies - 9422 views - 03/21/12 by Stoimen Popov in Articles
Algorithms always depend on the input. We saw that general purpose sorting algorithms like insertion sort, bubble sort and quicksort can be very efficient in...
1 replies - 26266 views - 03/20/12 by Stoimen Popov in Articles
I’ve been researching a whitepaper for CloudU that looks at the
different languages modern developers of cloud applications need to
think about and it...
0 replies - 6728 views - 03/14/12 by Ben Kepes in Articles
When it comes to sorting items by comparing them, merge sort
is one very natural approach. It is natural because it simply divides the
list into two equal...
1 replies - 22068 views - 03/13/12 by Stoimen Popov in Articles
Basically sorting algorithms can be divided into two main groups: those based on comparisons and those that are not. I already posted about
some of the...
2 replies - 45095 views - 03/06/12 by Stoimen Popov in Articles
You should take a serious look at your application and write some tests, first thing Monday. I
would write integration tests with real data that attempt to...
0 replies - 6948 views - 03/05/12 by Daniel Doubrovkine in Articles
Day Camp 4 Developers #4: Business 101 for Developers is coming up March 3rd, 2012. If you haven’t purchased your tickets yet, you need to grab then now!I
0 replies - 3935 views - 02/27/12 by Cal Evans in Articles
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...
4 replies - 24574 views - 02/21/12 by Stoimen Popov in Articles
Sorted data can dramatically change the speed of our program. Therefore, sorting algorithms are something quite special in computer
science. For instance...
0 replies - 16079 views - 02/14/12 by Stoimen Popov in Articles
OverviewRelative encoding is another data compression algorithm. While run-length encoding, bitmap encoding and diagram and pattern substitution
0 replies - 10634 views - 01/31/12 by Stoimen Popov in Articles
Two variants of run-length encoding
are the diagram encoding and the pattern substitution algorithms. The
diagram encoding is actually a very simple...
1 replies - 14128 views - 01/24/12 by Stoimen Popov in Articles
In my previous post
we saw how to compress data consisting of very long runs of repeating
elements. This type of compression is known as “run-length...
0 replies - 8349 views - 01/17/12 by Stoimen Popov in Articles
No matter how fast today’s computers and networks are, the users will
constantly need faster and faster services. To reduce the volume of the
1 replies - 7369 views - 01/10/12 by Stoimen Popov in Articles