a repository of mathematical know-how

Revision of Finding algorithms front page from Wed, 01/04/2009 - 08:25

Quick description

An algorithm is a procedure for solving some class of problems by breaking it up into simple steps. This article contains links to other articles on the general theme of finding algorithms to do various kinds of tasks.

How to use Euclid's algorithm

Approximation algorithms

Greedy algorithms

Algorithms associated with polynomials

Randomized algorithms Brief summary ( Sometimes a very simple and efficient way of carrying out an algorithmic task is to make random choices. The obvious disadvantage, that one cannot be certain that the algorithm will do what one wants, is in many situations not too important, since one can arrange for the probability of failure to be so small that in practice it is negligible. )