Register

Recent questions tagged time-complexity

5 votes
2 answers
841
Time Complexity
Consider the following function Void func(int n){ Int k=n; Int i=0; for(;i<n;i++){ while(k>1){ k>>=1; } } What is the worst case time complexity of the function?
Consider the following functionVoid func(int n){Int k=n;Int i=0;for(;i<n;i++){while(k>1){k>>=1;}}What is the worst case time complexity of the function?
User Avatar
1 votes
0 answers
843
MST Kruskal
First statement is False because complexity will be O(E2). I think the second statement is true? But not sure
First statement is False because complexity will be O(E2).I think the second statement is true? But not sure
User Avatar
5 votes
1 answer
844
Testbook Test Series
User Avatar
6 votes
2 answers
845
Min Heap
In a min-heap, the next largest element of a particular element can be found in ___ time. A) O(1) B) O(log n) C) O(n)
In a min-heap, the next largest element of a particular element can be found in ___ time.A) O(1)B) O(log n)C) O(n)
User Avatar
1 votes
1 answer
846
Fibonacci-Sequence
Which of the following is true about time complexity for generating $\color{blue} {n^{th}}$ Fibonacci number ? a)$O(n)$ b)$O(Logn)$ c)$O(2^n)$ d)$\Omega(n)$
Which of the following is true about time complexity for generating $\color{blue} {n^{th}}$ Fibonacci number ? a)$O(n)$b)$O(Logn)$c)$O(2^n)$d)$\Omega(n)$
User Avatar
5 votes
0 answers
848
Time Complexity
//n is a prime number here int main() { for(i=1;i<=n;i=2*i) { for(j=1;j<=n;j++) { if(n%i==0) { k=1; while(k<=n) { a=b+c; k=k+1; } } } } }
//n is a prime number hereint main() { for(i=1;i<=n;i=2*i) { for(j=1;j<=n;j++) { if(n%i==0) { k=1; while(k<=n) { a=b+c; k=k+1; } } } } }
User Avatar
0 votes
1 answer
850
Algo doubt
An array a of unknown size is filled with special symbol let's say # . Time required to find the size of a is: Please give proper explanation
An array a of unknown size is filled with special symbol let's say # . Time required to find the size of a is:Please give proper explanation
User Avatar
0 votes
1 answer
851
Algorithm doubt
In sorted array of size n time required to verify if there exist 2 number a and b such that a+ b = s in worst case Where s is a constant.
In sorted array of size n time required to verify if there exist 2 number a and b such that a+ b = s in worst case Where s is a constant.
User Avatar
4 votes
1 answer
852
AceTest Series: Algorithms - Time Complexity
for (i=n ; i>0 ; i--) { for ( j=1;j<n ; j=j*2) { for ( k=0;k<j ;k++) { } } } time complexity ?? how to find of inner and innermost loop?
for (i=n ; i>0 ; i ) { for ( j=1;j<n ; j=j*2) { for ( k=0;k<j ;k++) { } } }time complexity ??how to find of inner and innermost loop?
User Avatar
3 votes
0 answers
853
T(n) = T ( n/2 ) + 2^n Applying Masters Theorem in this case.
$T(n) = T (n/2) + 2^n$ How can we apply masters theorem in this case?
$T(n) = T (n/2) + 2^n$How can we apply masters theorem in this case?
User Avatar
2 votes
1 answer
854
CLR 3rd Edition page no. 42 Q.n. c
Wha is the relationship between the running time of insertion sort and the number of inversions in the input array ? Is the circled text should be greater instead of less .Plz justify . PS: This image has been taken from solun manual of CLR.
Wha is the relationship between the running time of insertion sort and the number of inversions in the input array ?Is the circled text should be greater instead of less ...
User Avatar
1 votes
2 answers
855
Self Doubt
What will be the time complexity of A() { int i,j,k,n; for(i=1;i<=n;i++) { for(j=1;j<=(i^2);j++) { for(k=1;k<=(n/2);k++) { printf("ABCD"); } } } }
What will be the time complexity of A() { int i,j,k,n; for(i=1;i<=n;i++) { for(j=1;j<=(i^2);j++) { for(k=1;k<=(n/2);k++) { printf("ABCD"); } } } }
User Avatar
1 votes
1 answer
856
Self Doubt
What will be the time complexity of the following code? A() { int i,j,k,n; for(i=1;i<=n;i++) { for(j=1;j<=i;j++) { for(k=1;k<=100;k++) { printf("ABCD"); } } } }
What will be the time complexity of the following code?A() { int i,j,k,n; for(i=1;i<=n;i++) { for(j=1;j<=i;j++) { for(k=1;k<=100;k++) { printf("ABCD"); } } } }
User Avatar
5 votes
1 answer
858
Algo: Time complexity
T(n) = 4T(n/2) + n2.$\sqrt{2}$ In thetha notation?
T(n) = 4T(n/2) + n2.$\sqrt{2}$In thetha notation?
User Avatar
4 votes
1 answer
860
GATEFORUM
for(i=0;i<=n;i++){ for(j=0;j<=i2;j++){ for(k=0;k<=$\frac{n}{2}$;k++){ x=y+z; }}} How many times the x=y+z statement will execute?
for(i=0;i<=n;i++){ for(j=0;j<=i2;j++){ for(k=0;k<=$\frac{n}{2}$;k++){ x=y+z;}}}How many times the x=y+z statement will execute?
User Avatar
1 votes
1 answer
862
Master Theorem
User Avatar
1 votes
2 answers
863
Alo doubt
Complexity of equation - T(n)=. 2T(n-1)-1 if n>0 1. Otherwise
Complexity of equation -T(n)=. 2T(n-1)-1 if n>0 1. Otherwise
User Avatar
0 votes
1 answer
864
time complexity
time taken to delete a node from min heap if you know the value but not position To find the position of the number in min heap should not be log(n) why is it so O(n)
time taken to delete a node from min heap if you know the value but not positionTo find the position of the number in min heap should not be log(n)why is it so O(n)
User Avatar
3 votes
2 answers
865
Time complexity
Given a 2D array X[m][n] which has m rows and n columns. The array X is row wise and column wise sorted (i.e) each individula row and column is sorted. What is the complexity to search an element in this array a)O(m*n) b)O(m2) or O(n2) c)O(log2(m*n)) d)O(m+n)
Given a 2D array X[m][n] which has m rows and n columns. The array X is row wise and column wise sorted (i.e) each individula row and column is sorted. What is the comple...
User Avatar
4 votes
1 answer
866
Merge sort
True or False Merge sort on Linked list takes O(nlogn)
True or FalseMerge sort on Linked list takes O(nlogn)
User Avatar
1 votes
1 answer
867
Long integer multiplication
Given 2 long integers having n digits , it is required to multiply them.Assuming the numbers are represented in an array of size n . The time complexity to multiply them using traditional divide and conquer is
Given 2 long integers having n digits , it is required to multiply them.Assuming the numbers are represented in an array of size n . The time complexity to multiply them ...
User Avatar
2 votes
1 answer
868
priority based scheduling
Given that ready contains at some point of time a maximum of n process , the time complexity to schedule and dispatch a process from ready queue onto CPU using priority based scheduling is a)O(n) b)O(logn) c)O(nlogn) d)O(1)
Given that ready contains at some point of time a maximum of n process , the time complexity to schedule and dispatch a process from ready queue onto CPU using priority ...
User Avatar
3 votes
1 answer
869
Time complexity
Solve the following recurrence relation $T(n)=4T(n/2)+n^2 \sqrt 2$
Solve the following recurrence relation$T(n)=4T(n/2)+n^2 \sqrt 2$
User Avatar
Page: