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 vote113 views1 answer
For en python
Python
0 vote136 views1 answer
Connect to spark cluster
Python
-1 vote78 views1 answer
What is mi casa in spanish
Python
1 vote130 views1 answer
Http client post python
Python
0 vote126 views2 answers
Diagonal difference hackerrank solution in python
Python
1 vote140 views1 answer
Os.execl(sys.executable, sys.executable, *sys.argv)
Python
0 vote140 views1 answer
Find-squares-and-odd-numbers-in-the-given-list
Python
1 vote122 views1 answer
What does [::-1] mean in python
Python
0 vote123 views1 answer
Restaurant management system in django
Python
2 votes119 views1 answer
Make first row columns pandas
Python