edited by
423 views

Please log in or register to answer this question.

Related questions

1 votes
1 votes
2 answers
1
akankshadewangan24 asked Sep 20, 2018
843 views
If t(n) and s(n) denotes the time and space complexity of an algorithm with input size n element then which one of the following is always true?S(n)=O(t(n)) correct H...
0 votes
0 votes
3 answers
2
Subham Nagar asked Mar 20, 2018
1,185 views
An array $'A'$ has $n$ distinct integers. What is the tightest time complexity to check $A[i]=i$ for some $i$. Consider all elements of array within range from $1$ to $n$...
1 votes
1 votes
1 answer
3
2 votes
2 votes
1 answer
4