0
An algorithm that can find an approximate result quickly when an exact result would be too expensive to calculate.
As an example, if you wanted to find the largest number among millions of numbers (and these numbers where somehow very expensive to find or operate on), you could sample a thousand of them, have a look at the statistical distribution of those thousand numbers, and say that the maximum among all the numbers is within such-and-such a range with such-and-such probability.
You could say that a public poll uses an approximation algorithm - instead of asking everyone in the country, you ask a small sample and extrapolate from the result using statistical methods.
See related link.
Wiki User
∙ 14y ago
Add your answer:
Earn +20 pts
What are some synonyms for exponential?
Some good synonyms for the word "exponential" are, accumulative, declining, depleted, down, fourfold, gathering, graduated, growing, abacus, algorithm, approximation, average, countdown, binomial and deviation.
How are the expanded algorithm and the standard algorithm different?
They are different because standard algorithm is more common then the expanded algorithm
Is a heuristic an algorithm?
In practice, it may be. But they are still different things.A heuristic is a rough approximation that can help solving a problem.For example, in a path-finding algorithm, if your destination is northbound, you may try goring north first. This is the heuristic.It may not be correct (there may be a dead-end) but most of the time, it helps getting there faster.
What is algorithm to write algorithm to the program to access a pointer variable in structure?
Here is the algorithm of the algorithm to write an algorithm to access a pointer in a variable. Algorithmically.name_of_the_structure dot name_of_the _field,eg:mystruct.pointerfield
What is Approximation for pi?
3.14 is the commonly used approximation
Which algorithm is more efficient lamport bakery algorithm or black and white bakery algorithm?
Black and White bakery algorithm is more efficient.
What is approximation error?
An approximation error is the discrepancy between an exact value and the approximation to it. This occurs when the measurement of something is not precise.
What is complsexity of an algorithm?
Complexity of an algorithm is a measure of how long an algorithm would take to complete given
When was Constructive Approximation created?
Constructive Approximation was created in 1985.
How algorithm is different from flowchart?
An algorithm is a series of steps leading to a result. A flowchart can be a graphical representation of the algorithm.
How do you test algorithm?
By preparing test cases we can test an algorithm. The algorithm is tested with each test case.
List down the names of any three parameters on which you analyze an algorithm?
what is algorithm and its use there and analyze an algorithm
