You are viewing a single comment's thread. Return to all comments →
Max is O(n), where n is the size of the list. https://wiki.python.org/moin/TimeComplexity
This is O(n^2) altogether.
Find the Runner-Up Score!
You are viewing a single comment's thread. Return to all comments →
Max is O(n), where n is the size of the list. https://wiki.python.org/moin/TimeComplexity
This is O(n^2) altogether.