/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 vote304 views1 answer
Python Command '['latexmk', '--pdf', '--interaction=nonstopmode', % returned non-zero exit status 2.
Python
0 vote303 views1 answer
Tkinter start maximized
Python
1 vote247 views1 answer
Plus months onto python date
Python
27 votes305 views4 answers
Create dictionary python from two lists
Python
1 vote317 views1 answer
Radiobuttons django
Python
0 vote322 views1 answer
Yahoo finance api python
Python
76 votes329 views6 answers
Python file open
Python
1 vote311 views1 answer
Python print string name in pattern
Python
0 vote316 views2 answers
Jupyter notebook morse code francais
Python
0 vote291 views2 answers
Quotation marks n string
Python