/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 vote200 views1 answer
Print a string with spaces between characters python
Python
46 votes243 views6 answers
Install requests python
Python
0 vote236 views1 answer
Loading model
Python
33 votes229 views5 answers
How to filter out all NaN values in pandas df
Python
0 vote190 views3 answers
Miktex python install linux
Python
1 vote221 views1 answer
Separate words in a text to make a list python
Python
0 vote252 views1 answer
Compose functions python
Python
0 vote245 views1 answer
Float number field django models
Python Django
0 vote194 views2 answers
Python get object name
Python
0 vote197 views1 answer
Python list of deeper paths
Python