/Python/Python min function time complexity

Python min function time complexity

import heapq
import random

sample = [random.randint(0, 1000) for _ in range(100)]
print(min(sample)) # O(N)

heapq.heapify(sample) # O(N)
print(sample[0]) # O(1)

Similar codes

39 votes335 views6 answers
Objects and classes in python
Python
0 vote334 views1 answer
How to combine number of excel files into a single file using python or pandas
Python
3 votes344 views1 answer
How to set datetime format in python
Python
3 votes307 views1 answer
Python print float in scientific notation
Python
0 vote327 views1 answer
Round list of floats python
Python
79 votes335 views3 answers
Python how to remove last letter from string
Python
0 vote325 views1 answer
Arrow.get(null)
Python
0 vote303 views1 answer
Python json indented
Python
5 votes326 views4 answers
Data normalization python
Python
0 vote314 views1 answer
Python unknow number of arguments, default argument,
Python