Space complexity python

O(1)- no loops
O(log n)- binary search.
O(sqrt n) - finding prime number
O(n)- any normal loop
O(n log n)- binary sorting
0(n^k)- k nested loops
O(2^n)- very rarely recursive programs
0(n!)-itertools

Similar codes

1 vote215 views1 answer
Install sklearn-features
Python
0 vote230 views1 answer
Filter startswith django
Python Django
0 vote202 views1 answer
Save numpy arrayw with PIL
Python
46 votes250 views6 answers
Python for loop array index
Python
0 vote217 views1 answer
.lowertkinter
Python
1 vote199 views1 answer
Fake migration
Python
2 votes261 views1 answer
Truncate templat tag django
Python Django
0 vote207 views1 answer
How to install package offline
Python
1 vote213 views1 answer
How to put in code to download discord py
Python
14 votes238 views6 answers
Char in python
Python