/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 vote123 views2 answers
Update a package with pip in django
Python Django
1 vote109 views1 answer
'charmap' codec can't decode byte 0x98 in position 11354: character maps to <undefined>
Python
4 votes98 views3 answers
Print bold python
Python
0 vote145 views1 answer
Django blog new post
Python Django
0 vote100 views1 answer
Most popular python libraries
Python
0 vote93 views1 answer
Call item from dictionary python
Python
0 vote151 views1 answer
Aggregation with f() in django rest api
Python Django
0 vote96 views1 answer
Print chr character in python f string
Python
8 votes121 views5 answers
Retrieve row by index pandas
Python
0 vote100 views1 answer
Bold some letters of string in python
Python