/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

0 vote263 views1 answer
Python ordereddict reverse
Python
0 vote237 views1 answer
Pyton count senteses in a text file
Python
7 votes231 views4 answers
Python possible combinations
Python
2 votes250 views1 answer
Remove comma from string python column
Python
0 vote258 views1 answer
Form_valid
Python
1 vote247 views1 answer
How to use enumerate instead of range and len
Python
0 vote235 views2 answers
Sumx and ABS in power bi
Python
0 vote242 views1 answer
Python remove all isntances from a list
Python
24 votes234 views2 answers
Python suppress warnings in function
Python
8 votes251 views2 answers
How to read excel file in jupyter notebook
Python