performance - How efficient is Python's max function -


Function Maximum () which gives maximum elements to the list. . . What's its time to run (in Python 3)?

Since this is O (n), since it should examine each element if you have maximum For better performance, you can use the module. However, you have to do, because happers provides a minimum stack. It is log (log n) to put one element into a heap.

Comments