I'm trying to teach myself some algorithm complexity and I've run into a problem. I'm starting to understand about O and o notation and big theta notation. I've run into notations like O(n^2 M(n)). Does this mean that the complexity is n^2 times whatever M(n) means? (Natural next question) what does M(n) mean?(adsbygoogle = window.adsbygoogle || []).push({});

**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!

# Algorithm complexity analysis

Loading...

Similar Threads - Algorithm complexity analysis | Date |
---|---|

I Fourier series of Dirac comb, complex VS real approaches | Thursday at 3:38 PM |

B Non-algorithmic math | Oct 13, 2017 |

I Algorithm to create a composite score | Sep 12, 2017 |

I Arm reaching algorithm determine angles | Aug 14, 2017 |

A Optimization constraints formulation for GA | Jun 28, 2017 |

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