Hi,(adsbygoogle = window.adsbygoogle || []).push({});

If the algorithm recurrence can be shown to belong to something complicated say like

T(n) = log_{3/2} n lg(n) + (log_{3/2}(n) (log_{3/2}(n) - 1 ) /2) lg(2/3)

What order of complexity can I expect it to be in?

**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 how do I tell

Loading...

Similar Threads - Algorithm Complexity tell | Date |
---|---|

Why is the complexity class expression this? | Jan 29, 2016 |

Complexity Analysis problem of an Algorithm. | May 9, 2015 |

Algorithm to partition a complex equation into 2 master equations | May 16, 2014 |

Trying to come up with simple algorithm of significant time complexity in Java | Nov 25, 2012 |

Lyndon words: Duval's algorithm and its time complexity | Jul 31, 2012 |

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