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

Looking for a more efficient solution to method 'what', in terms of run-time complexity and space.

The method finds the largest cell sequence that the organs sum is divided by 3.(Correct me if I'm wrong)

As it seems runtime complexity here is O(n ^ 3).

I came to solution of O(n ^ 2), is there a more effective solution? Explain please,

Thanks for the helpers !

**Physics Forums | Science Articles, Homework Help, Discussion**

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!

# Java Help-Improving runtime complexity of the method

Have something to add?

Draft saved
Draft deleted

Loading...

Similar Threads for Help Improving runtime |
---|

Python (VPython) Can someone help me with my orbit simulator? |

I need help decrypting this |

C/++/# Help with MATLAB code? |

Python What's wrong with my bisection method code? |

Python Help: Convert Matlab to Python code |

**Physics Forums | Science Articles, Homework Help, Discussion**