Register

Find the Time Complexity

972 views
0 votes
0 votes
Suppose, we have an array of n elements. find the time complexity to search two elements x, y such that:-

a) x+y < 100

b) x+y > 1000

Also, state the algorithm/approach for the same.
User Avatar

Please log in or register to answer this question.

Voting & Accepting an answer helps improve the community
← PreviousNext →
← Previous in categoryNext in category →

Related questions

1 votes
1 votes
1 answer
1
Akriti sood asked Jan 23, 2017
1,310 views
find the time complexity
What is the time complexity of the following function foo() void foo() { int i, j; for(i = 1; i <= n ; i++) for(j = i; j <= log(i); j++) printf(“gate”); } what is the time complexity? the answer given is nlogn. but I think it should be O(n)
What is the time complexity of the following function foo() void foo() { int i, j; for(i = 1; i <= n ; i++) for(j = i; j <= log(i); j++) printf(“gate”); } what is the...
User Avatar
2 votes
2 votes
1 answer
2
Akriti sood asked Jan 23, 2017
782 views
find the time complexity|testbook livetest
please tell the time complexity?i was getting O(2n)
please tell the time complexity?i was getting O(2n)
User Avatar
1 votes
1 votes
0 answers
3
Akriti sood asked Dec 22, 2016
683 views
find the time complexity
Consider the following function int foo(int n) { int count1=0, count2=0; if (n < 0) n = -n; if (n == 0) return 1; If (n == 1) return 0; while (n) { if (n & 1) count1++; n = n >> 1; if (n & 1) count2++; n = n>>1; } return foo(abs(count1 - count2)); } What is the time complexity for the above function?
Consider the following functionint foo(int n) { int count1=0, count2=0; if (n < 0) n = -n; if (n == 0) return 1; If (n == 1) return 0; while (n) { if (n & 1) count1++; n ...
User Avatar
1 votes
1 votes
2 answers
4
sh!va asked Dec 4, 2016
997 views
Find the time complexity of given loops
for (int i = 1; i <=m; i += c) { ---do something ---} for (int i = 1; i <=n; i += c) { ---do something --- } What will the the tiem complexity of given code pseudococde? A. O (max(m,n)) B. O(min(m,n)) C. O( m+n) D. O(mn)
for (int i = 1; i <=m; i += c){ -do something -}for (int i = 1; i <=n; i += c){ -do something - }What will the the tiem complexity of given code pseudococde?A. O (m...
User Avatar
Link Copied!