/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 vote185 views2 answers
Types of all columns pandas
Python
2 votes199 views1 answer
Python turtle background image
Python
0 vote195 views1 answer
How to iterate through a list of numbers in python
Python
0 vote180 views1 answer
Python for loop in range 01 02
Python
1 vote201 views1 answer
Debug flask powershel
Python
9 votes185 views1 answer
Create models in django
Python
1 vote206 views1 answer
How to add char to string python
Python
9 votes172 views2 answers
Remove all rows without a value pandas
Python
0 vote195 views1 answer
Athena connector python
Python
1 vote180 views2 answers
Python print trailing zeros
Python