Is there a standard algorithm or procedure that defines addition, multiplication of big O terms.(adsbygoogle = window.adsbygoogle || []).push({});

I want definitions for problems like:-

1) (x-1) * O(x)

2) O((x-a)^{2}) where a is some positive number

etc.

Since I want to implement this on a computer I would prefer some algorithm or paper that defines and tells you how to deal with operations on big O terms.

Thank you!

**Physics Forums - The Fusion of Science and Community**

Join Physics Forums Today!

The friendliest, high quality science and math community on the planet! Everyone who loves science is here!

The friendliest, high quality science and math community on the planet! Everyone who loves science is here!

# Big O notation algorithms

Loading...

Similar Threads - notation algorithms | Date |
---|---|

C/++/# Is there a flaw in my longest common subsequence algorithm? | Feb 24, 2018 |

Big-O Notation Question | Feb 20, 2018 |

Mathcad dot or dashed notation | Feb 6, 2017 |

Asymptotic notation is taught in which course in university? | Oct 11, 2015 |

Help explain this Turing machine notation | Oct 6, 2014 |

**Physics Forums - The Fusion of Science and Community**