/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 vote288 views1 answer
Python mouse listener
Python
4 votes296 views2 answers
Compare multiple columns in pandas
Python
0 vote326 views1 answer
Python - regexp to find part of an email address
Python
0 vote274 views1 answer
Dataframe rank groupby
Python
0 vote278 views1 answer
Newsapi in python
Python
0 vote300 views1 answer
Twin axis python
Python
144 votes255 views9 answers
Python write to file
Python
1 vote269 views1 answer
Localhost postgres settings django
Python Django
3 votes297 views1 answer
Python - exclude rowin data frame based on value
Python
0 vote273 views2 answers
Make gif from images in python
Python