/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 vote164 views1 answer
List comprehension odd numbers python
Python
0 vote167 views1 answer
Find & set values in pandas Dataframe
Python
-1 vote185 views2 answers
Numpy split to chunks of equal size
Python
0 vote154 views1 answer
Smtp django
Python
0 vote245 views1 answer
Cbv uk django
Python Django
4 votes154 views1 answer
Python make integer into a list
Python
0 vote178 views1 answer
Csgo force crosshair on sniper python
Python
4 votes148 views2 answers
Print format python
Python
35 votes162 views2 answers
How to run cmd line commands in python
Python
0 vote148 views1 answer
What are Augmented Assignment Operators in python
Python