Go backward to IllustrationGo up to TopGo forward to Example |

- Instead of saying that the execution time
`T`of some algorithm`A`in dependence on input size`n`is`T`_{A}(`n`) = 7`n`^{2}+3`n`+19, we may say`T`_{A}(`n`) = O(`n`^{2}), - The proposition
`S`_{0}=`S`_{1}+ O(`T`)`S`_{0}-`S`_{1}= O(`T`).We say by

`f`(`n`) = 5`n`^{3}+ 2`n`^{2}+ O(`n`)`f`(`n`) differs from 5`n`^{3}+ 2`n`^{2}not more than by a linear factor.

Author: Wolfgang Schreiner

Last Modification: December 14, 1999