Introduction
Constructing a linked list
is a fairly simple task. Linked lists are a linear structure and the
items are located one after another, each...
0 replies - 7704 views - 06/25/12 by Stoimen Popov in Articles
As I mentioned in a post a couple of days ago
I’ve been writing the closest pairs algorithm in Haskell and while the
brute force version works for small...
0 replies - 4850 views - 06/19/12 by Mark Needham in Articles
Introduction
The linked list is a data structure in which the items are ordered in
a linear way. Although modern programming languages support very...
6 replies - 6166 views - 06/14/12 by Stoimen Popov in Articles
Introduction
Every developer knows that computer algorithms
are tightly related to data structures. Indeed many of the algorithms
depend on a data...
2 replies - 7220 views - 06/08/12 by Stoimen Popov in Articles
OAuth 1.0 emerged from the
large social providers like Facebook, Yahoo!, AOL, and Google. Each had
developed its own alternative to the password...
1 replies - 4386 views - 05/19/12 by Prabath Siriwardena in Articles
Each natural number that is divisible only by 1 and itself is prime.
Prime numbers appear to be more interesting to humans than other
numbers. Why is that...
1 replies - 7984 views - 05/09/12 by Stoimen Popov in Articles
I need to compare two text classifiers – one human, one machine. They
are assigning multiple tags from an ontology. We have an initial corpus
of ~700...
0 replies - 2930 views - 05/06/12 by Tony Russell-rose 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,...
3 replies - 9625 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 - 11481 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
need...
0 replies - 12303 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 - 9659 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 - 8545 views - 03/27/12 by Stoimen Popov in Articles
This is a self imposed machine problem I wrote over a frantic afternoon for my lesson on Frequent Itemsets and the Apriori Algorithm.
I wanted to write a...
0 replies - 4381 views - 03/25/12 by Jose Asuncion 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 - 5876 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 - 7950 views - 03/20/12 by Stoimen Popov in Articles
