/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

22 votes373 views6 answers
Select columns pandas
Python
1 vote380 views1 answer
Rfind() in python
Python
3 votes395 views3 answers
How to load images from folder in python
Python
4 votes385 views2 answers
Python strptime format codes
Python
2 votes356 views1 answer
Django load model by name
Python
0 vote355 views2 answers
Np array to tuple
Python
0 vote357 views1 answer
Python call function x number of times
Python
0 vote369 views1 answer
UserWarning: Using slow pure-python SequenceMatcher. Install python-Levenshtein to remove this warning warnings.warn('Using slow pure-python SequenceMatcher. Install python-Levenshtein to remove this warning'
Python
47 votes385 views6 answers
Add rows to dataframe pandas
Python
0 vote340 views1 answer
How to save string characters into char array or list in python
Python