Register

Recent questions tagged time-complexity

1 votes
2 answers
721
Worst Case Time Complexity
What is the worst case time complexity to find kth smallest element into an array of ‘n’ element?
What is the worst case time complexity to find kth smallest element into an array of ‘n’ element?
User Avatar
2 votes
1 answer
722
Time Complexity
T(n)=4T(n/2)+n TC using iterative method with steps in short :) T(1) = 1
T(n)=4T(n/2)+nTC using iterative method with steps in short :)T(1) = 1
User Avatar
3 votes
1 answer
723
time complexity
time complexity questions like : h(n)=O(n2); f(n)= O(logn); g(n)=omega(n2); what is the complexity of :::: 1. h(n)-g(n)=?? 2. h(n)-f(n)=??? elaborate plz
time complexity questions like :h(n)=O(n2);f(n)= O(logn);g(n)=omega(n2);what is the complexity of :::: 1. h(n)-g(n)=?? 2. h(...
User Avatar
2 votes
0 answers
724
Algo:Time complexity
void fun(intn) { int s=0; for(i=1;i<=n;i++) { for(j=1;j<=i*i;j++) { if(j%i==0) { for(k=1;k<=j;K++) s++ } } } }
void fun(intn) { int s=0; for(i=1;i<=n;i++) { for(j=1;j<=i*i;j++) { if(j%i==0) { for(k=1;k<=j;K++) s++ } } } }
User Avatar
2 votes
1 answer
725
algorithms
User Avatar
2 votes
1 answer
726
Asymptotic Notation
Given h(n) < f(n) < g(n). statement 1: h(n)=O(f(n)); g(n)=Ω(f(n)) Statement 1 is True / False?
Given h(n) < f(n) < g(n).statement 1: h(n)=O(f(n)); g(n)=Ω(f(n))Statement 1 is True / False?
User Avatar
6 votes
1 answer
727
Recurrence Relation
$T(n) = 2T(\sqrt{n}) + n$
$T(n) = 2T(\sqrt{n}) + n$
User Avatar
2 votes
0 answers
728
Time Complexity
which function will grow faster? a) x$\sqrt{x}$ b) x!
which function will grow faster?a) x$\sqrt{x}$ b) x!
User Avatar
4 votes
1 answer
732
Implementation of queue using stack
In implementation of queue using stack, deletion of second element from front take Ο(1) time, when insertion take Ο(n) time. Which of the following is correct ? True / False
In implementation of queue using stack, deletion of second element from front take Ο(1) time, when insertion take Ο(n) time.Which of the following is correct ?True / Fa...
User Avatar
2 votes
1 answer
733
Complexity
#include<stdio.h> int calculate(int n) { int count=0; while(n!=0){ n=(n&(n<<1)); count++ } return count; } output for calculate(143)
#include<stdio.h int calculate(int n) { int count=0; while(n!=0){ n=(n&(n<<1)); count++ } return count; }output for calculate(143)
User Avatar
1 votes
0 answers
735
Time Complexity
foo(int n, int a[]) { int i=0,j=0; for(i=0;i<=n;i++) while (j<n && A[i]<A[j]) j++; } Time complexity of foo()
foo(int n, int a[]) { int i=0,j=0; for(i=0;i<=n;i++) while (j<n && A[i]<A[j]) j++; }Time complexity of foo()
User Avatar
2 votes
0 answers
736
Complexity of given program.
Consider the following C segment: main() { int sum = 0; for(int b=1; b<=n; b*=2) { for(int i=0; i<b; i++) { for(int j=0; j<n; j+=2) { sum += j; } for(int j=1; j<n; j*=2) { sum *= j; } } } } The complexity of above program is ____________.
Consider the following C segment:main() { int sum = 0; for(int b=1; b<=n; b*=2) { for(int i=0; i<b; i++) { for(int j=0; j<n; j+=2) { sum += j; } for(int j=1; j<n; j*=2) {...
User Avatar
1 votes
1 answer
737
Made-easy
A) Ο(logn) B) Ο(n logn) C) Ο(n)2 D) Ο(n2 logn)
A) Ο(logn)B) Ο(n logn)C) Ο(n)2D) Ο(n2 logn)
User Avatar
3 votes
1 answer
738
Time Complexity
What is the time complexity of the following code? void foo(int n) { int s=0; for( i=1 ; i<=n ; i++ ) for( j=1 ; j<= i*i ; j++) if( j%i==0 ) { for( k=1 ; k<=j ; k++ ) s++; } }
What is the time complexity of the following code?void foo(int n) { int s=0; for( i=1 ; i<=n ; i++ ) for( j=1 ; j<= i*i ; j++) if( j%i==0 )...
User Avatar
1 votes
0 answers
740
recurrence equation
what is recurrence relation of harmonic number/series ? and it's time complexity
what is recurrence relation of harmonic number/series ? and it's time complexity
User Avatar
3 votes
1 answer
741
quick sort
You have an array of n elements. Suppose you implement quick sort by always choosing the central element of the array as the pivot. Then the tightest lower bound for the best case performance is a) O(n2) b) O(nlogn) c) Θ(nlogn) d) O(n3)
You have an array of n elements. Suppose you implement quick sort by always choosing the central element of the array as the pivot. Then the tightest lower bound for the...
User Avatar
0 votes
3 answers
742
time complexity
i am getting t.c as O(n^5) but given answer as O(n^4) what should be the answer
i am getting t.c as O(n^5) but given answer as O(n^4) what should be the answer
User Avatar
1 votes
0 answers
743
MadeEasy Test Series 2018: Algorithms - Time Complexity
What is the worst case time complexity to count pairs of numbers with difference ‘k’ from an input array of ‘n’ numbers? a) O(logn) b) O(nlogn) c) O(n^2) d) O(n^2logn)
What is the worst case time complexity to count pairs of numbers with difference ‘k’ from an input array of ‘n’ numbers?a) O(logn)b) O(nlogn)c) O(n^2)d) O(n^2logn...
User Avatar
3 votes
1 answer
744
recurrence eq
how to solve this T(n)=T(n−1)+T(n−2) if T(0)=T(1)=1
how to solve this T(n)=T(n−1)+T(n−2) if T(0)=T(1)=1
User Avatar
–1 votes
0 answers
745
recurrece relation stuck at some step.
j= n∗(1+1/2+1/2^2+1/2^3+..........1/2^k) how to solve this?
j= n∗(1+1/2+1/2^2+1/2^3+..........1/2^k) how to solve this?
User Avatar
2 votes
1 answer
746
recurrence using Master theorem
can we solve this T(n) = T(n/2) + 1 using master theorem?
can we solve this T(n) = T(n/2) + 1 using master theorem?
User Avatar
0 votes
1 answer
747
recurrence relation
what is the recurrence relation for binary search and linear search? please explain how to derive them.
what is the recurrence relation for binary search and linear search?please explain how to derive them.
User Avatar
0 votes
3 answers
748
Asympotic Notation
$100n\log n = O(n\log n)$ How they are equal?
$100n\log n = O(n\log n)$How they are equal?
User Avatar
2 votes
1 answer
749
Algorithm Question
User Avatar
1 votes
0 answers
750
test series
What will be the time complexity for the following recurrence relation? T(n)=n1/2 T(n1/2)+100n if n>1 = 1,Otherwise Θ(n) Θ(n2) Θ(n log n) Θ(n log logn) can anyone solve this question and give the solution.
What will be the time complexity for the following recurrence relation?T(n)=n1/2 T(n1/2)+100n if n>1= 1,Otherwise Θ(n) Θ(n2) Θ(n log n) Θ(n log logn) ...
User Avatar
Page: