/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 vote240 views1 answer
Convert arrary to int
Python
0 vote223 views1 answer
How To Generate The Requirements Of Your Python Project Based On Your Imports
Python
4 votes229 views1 answer
What should you call a decimal value in python
Python
0 vote225 views1 answer
Fibonacci sequence generator python
Python
1 vote228 views2 answers
How to add up a list in python
Python
0 vote225 views1 answer
Matmul shorthand numpy
Python
0 vote238 views1 answer
Python Django How To Bulk Update
Python
0 vote212 views1 answer
Url encoded path using python
Python
1 vote241 views1 answer
Change index function for class python
Python
0 vote316 views1 answer
|safe django
Python Django