/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 vote151 views1 answer
Generate unique id from given string python
Python
0 vote141 views3 answers
Write a Python program to count total number of notes in given amount.
Python
3 votes144 views1 answer
2x + 9y = -7 6x - 3y = 9
Python
5 votes143 views3 answers
Convert categorical column to int in pandas
Python
2 votes180 views1 answer
Difference between w+ and r+ in python
Python
0 vote171 views2 answers
Django template in views.py
Python Django
0 vote143 views1 answer
Loading in pyqt5
Python
5 votes132 views1 answer
Python undefine variable
Python
1 vote137 views1 answer
Python recursive sum of digit
Python
0 vote145 views1 answer
Tqdm 2 progress bars
Python