/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 vote246 views1 answer
How to capture video in google colab with python
Python
0 vote276 views1 answer
Automl time series forecasting
Python
0 vote257 views1 answer
Numpy random.permutation
Python
7 votes268 views4 answers
Delete unnamed coloumns in pandas
Python
0 vote268 views1 answer
Function continuity python
Python
2 votes271 views2 answers
For each loop python 3
Python
27 votes271 views4 answers
Python get exception message
Python
0 vote257 views1 answer
Matplotlib radial averaging
Python
0 vote290 views1 answer
Qt line edit set text python
Python
0 vote268 views1 answer
Choice without replacement python
Python