The following algorithm is based on work of Ramanujan and has been used in several world-record calculations of pi.
Initialize a0 = 6 – 4 √2 and y0 = √2...
0 replies - 5623 views - 08/20/12 by John Cook in Articles
Introduction
Linked lists are one very common and handy data structure that can be
used in many cases of practical programming. In this post we’ll...
0 replies - 5933 views - 08/14/12 by Stoimen Popov in Articles
Introduction
Heapsort is one of the general sorting algorithms that performs in O(n.log(n)) in the worst-case, just like merge sort and quicksort, but sorts...
0 replies - 9346 views - 08/07/12 by Stoimen Popov in Articles
I was thinking about the Travelling Salesman
problem this morning. I came up with an algorithm that permits a few
nice optimizations. My guess is that...
1 replies - 8799 views - 07/27/12 by Shannon Behrens in Articles
Introduction
The binary search tree
is a very useful data structure, where searching can be significantly
faster than searching into a linked list....
0 replies - 13968 views - 07/23/12 by Stoimen Popov in Articles
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 - 18451 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 - 7190 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 - 11390 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 - 14585 views - 06/08/12 by Stoimen Popov 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 - 18533 views - 05/09/12 by Stoimen Popov 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 - 18301 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 - 18791 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 - 22326 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 - 15403 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 - 17564 views - 03/27/12 by Stoimen Popov in Articles
