/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

7 votes309 views1 answer
Pandas two conditions filter
Python
11 votes351 views3 answers
Elmo
Python
1 vote311 views1 answer
Breaking big csv into chunks pandas
Python
0 vote317 views1 answer
Pytorch reduce dataset dataloader
Python
1 vote351 views2 answers
Group by dateime pandas
Python
0 vote342 views1 answer
Python get unicode spaces
Python
0 vote413 views1 answer
Cant import flask mail
Python Flask
17 votes330 views6 answers
Prime number in python
Python
0 vote326 views1 answer
Url settings
Python
0 vote319 views1 answer
Pandas invert a boolean Series
Python