/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 vote142 views2 answers
Pandas merge two columns from different dataframes
Python
1 vote174 views1 answer
How to set environment variable in pycharm
Python
1 vote189 views2 answers
Divide a value by all values in a list
Python
0 vote129 views1 answer
Rickroll
Python
12 votes174 views5 answers
Django-cors-headers
Python Django
0 vote134 views1 answer
From random input python
Python
14 votes137 views6 answers
If condition python
Python
0 vote132 views1 answer
Can the function inside a function be global if the function before it is global
Python
7 votes127 views2 answers
Traceback python
Python
1 vote147 views2 answers
Python: calculate number of days from today date in a data frame
Python