/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

50 votes228 views6 answers
Print random string from list python
Python
9 votes233 views1 answer
Json encode in python
Python
13 votes290 views6 answers
Tensorflow check gpu
Python
1 vote224 views1 answer
Django httpresponseredirect
Python
9 votes212 views3 answers
Print for loop in same line python
Python
0 vote228 views2 answers
How to check if a string ends with a substring python
Python
52 votes252 views6 answers
Save json to file
Python
8 votes238 views4 answers
Zip a directory in python
Python
9 votes231 views5 answers
Pandas to dictionary
Python
110 votes239 views6 answers
Python while
Python