a repository of mathematical know-how

Finding algorithms front page

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 front page 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. )



Post new comment

(Note: commenting is not possible on this snapshot.)

Before posting from this form, please consider whether it would be more appropriate to make an inline comment using the Turn commenting on link near the bottom of the window. (Simply click the link, move the cursor over the article, and click on the piece of text on which you want to comment.)