/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

-1 vote233 views2 answers
Django connection cursor
Python Django
0 vote184 views1 answer
No module named 'fastai'
Python
112 votes184 views6 answers
Do while python
Python
1 vote173 views1 answer
Code that works if variable has a value python
Python
1 vote228 views1 answer
Python selenium web scraping example
Python
3 votes225 views2 answers
Godot restart scene
Python
1 vote210 views1 answer
How to remove trackback on python when ctrl c
Python
17 votes180 views6 answers
Remove list from list python
Python
0 vote187 views2 answers
How do I stop Selenium from closing my browser
Python
1 vote188 views1 answer
Python pandas dataframe column date to string
Python