/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 vote315 views1 answer
Blender python get current filename
Python
1 vote269 views1 answer
Get_terminal_sizee python
Python
0 vote274 views1 answer
Check if all elements in array are true python
Python
22 votes277 views6 answers
List to dict python
Python
-4 votes273 views5 answers
Current django version
Python
5 votes288 views4 answers
Xticks and yticks matplotlib
Python
0 vote309 views1 answer
2nd to last index python
Python
0 vote310 views1 answer
Django jinja else if template tags
Python Django
1 vote294 views1 answer
Typage in python
Python
0 vote263 views1 answer
Python class overwrite length method
Python