/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 views1 answer
Python word cloud
Python
1 vote119 views1 answer
Django filter by date range
Python
0 vote136 views1 answer
Credential not provided when i try to sign up a new user django
Python Django
0 vote118 views1 answer
Square finder python
Python
0 vote107 views1 answer
Index from multiindex pandas
Python
0 vote123 views2 answers
Python seperate int into digit array
Python
1 vote120 views3 answers
How to use variable from another function in python
Python
-2 votes134 views1 answer
Django e docker
Python Django
0 vote117 views1 answer
Hwo to except every error in python try statemen
Python
1 vote112 views1 answer
Debconf: falling back to frontend: Readline Configuring tzdata
Python