|
|
Revision:Algorithms
From The Student RoomTSR Wiki > Study Help > Subjects and Revision > Revision Notes > Mathematics > Algorithms
OrderThe order of an algorithm is a measure of the approximate run time for an algorithm, depending on the size of the problem. For large problems we only need to consider the dominant term to get an approximate run time. The efficiency of an algorithm is a measure of how well an algorithm copes with an increase in the size, n, of a problem. The efficiency decreases as run time increases.
ExampleA computer takes 2 seconds to solve a problem of size 30. Estimate the times taken to solve a problem of size 300 if the algorithm used has
Therefore, using n = 300
Also SeeSee the other D1 notes:
Comments |











or





