/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

-1 vote106 views1 answer
Usage code grepper
Python
1 vote158 views1 answer
Message tags in django
Python Django
0 vote112 views1 answer
Lock in python
Python
5 votes123 views1 answer
How to count things in a list python
Python
92 votes114 views6 answers
Python create virtualenv
Python
2 votes172 views1 answer
Get dictionary in array python by value
Python
1 vote130 views1 answer
Python cv2 imwrite
Python
20 votes117 views6 answers
Lowercase python
Python
0 vote123 views1 answer
How to make a numpy array of certain values
Python
4 votes98 views1 answer
Django listview
Python Django