Register

Recent questions tagged time-complexity

0 votes
1 answer
601
Dynamic programming
Given a sequence of n real numbers a1,a2,a3...an then to find contiguous subsequence ai,ai+1,ai+2....aj. Such that it's sum is maximum. How much time the above problem will take if you use dynamic programming?
Given a sequence of n real numbers a1,a2,a3...an then to find contiguous subsequence ai,ai+1,ai+2....aj. Such that it's sum is maximum. How much time the above problem wi...
User Avatar
0 votes
1 answer
602
Masters theorem
Solve by using master's theorem
Solve by using master's theorem
User Avatar
0 votes
2 answers
603
Time complexity
Find the time complexity using Master's theorem : (Also mention if Master's theorem can't be applied why not?) T(n)=2T(n/2)+nlogn
Find the time complexity using Master's theorem : (Also mention if Master's theorem can't be applied why not?)T(n)=2T(n/2)+nlogn
User Avatar
0 votes
3 answers
604
Masters theorem
Solve using Master's Theorem $T(n)=T(n/2)+$ 2n
Solve using Master's Theorem$T(n)=T(n/2)+$ 2n
User Avatar
1 votes
0 answers
606
Algorithms-Time Complexity
What is the time complexity of the below code? for($k=n^{10};k \geq 5;k=k^{\frac{1}{7}},k=k^2$) { $k=k^5;$ $k=k-10$ } My answer comes to be $O(log_{\frac{7}{10}}log_5(n^{10}))$ Please verify.
What is the time complexity of the below code?for($k=n^{10};k \geq 5;k=k^{\frac{1}{7}},k=k^2$){ $k=k^5;$ $k=k-10$}My answer comes to be $O(log_{\frac{7}{10}}log_5(n^{...
User Avatar
1 votes
1 answer
607
TIme complexity
Q.14 What is the time complexity of the following recursive function? int Dosomething (int n) { if(n≤2) return 1; else return (Dosomething (floor(sqrt(n))) + n); (a) Ѳ(n 2 ) (c) Ѳ(log 2 n) (b) Ѳ(nlog 2 n) (d) Ѳ(log 2 log 2 n)
Q.14 What is the time complexity of the following recursive function?int Dosomething (int n) {if(n≤2)return 1;elsereturn (Dosomething (floor(sqrt(n))) + n);(a) Ѳ(n 2 )...
User Avatar
2 votes
2 answers
608
Time Complexity Of the Algorithm
Q.6 The time complexity of an algorithm T(n), where n is the input size, is given by— T(n)= T(n-1) + 1/n, if n>1 = 1, otherwise. The order of the algorithm is— (a) log n (c) n^2 (b) n (d) n*n
Q.6 The time complexity of an algorithm T(n), where n is the input size, is given by— T(n)= T(n-1) + 1/n, if n>1 = 1, otherwise.The order of the algorithm is�...
User Avatar
0 votes
4 answers
609
UGC NET CSE | July 2018 | Part 2 | Question: 21
The solution of the recurrence relation $T(m) = T(3m/4)+1$ is $\Theta (\lg \: m)$ $\Theta (m)$ $\Theta (m\lg m)$ $\Theta (\lg\lg m)$
The solution of the recurrence relation $T(m) = T(3m/4)+1$ is$\Theta (\lg \: m)$$\Theta (m)$$\Theta (m\lg m)$$\Theta (\lg\lg m)$
User Avatar
0 votes
3 answers
611
Made easy workbook
User Avatar
4 votes
0 answers
614
time complexity
for(int i=0; i < n; i++) { for(int j=0; j < (2*i); j+=(i/2)) { cout<<"Hello Geeks"; } } is it o(nlogn)??
for(int i=0; i < n; i++) { for(int j=0; j < (2*i); j+=(i/2)) { cout<<"Hello Geeks"; } }is it o(nlogn)??
User Avatar
4 votes
7 answers
615
Searching
Q) Consider a sorted array of n numbers. What would be the time complexity of the best known algorithm to find a pair a and b such that |a-b| = k , k being a positive integer. a) O(logn) b) O(n) c)O(nlogn) d)O(n^2) Which of the option is Correct And Why?
Q) Consider a sorted array of n numbers. What would be the time complexity of the best known algorithm to find a pair a and b such that |a-b| = k , k being a positive int...
User Avatar
0 votes
1 answer
616
Sorting:
You have to sort 1 GB of data with only 100 MB of available main memory. Which sorting technique will be most appropriate? 1)QuickSort 2)MergeSort 3)HeapSort 4)Selection Sort Explain? How
You have to sort 1 GB of data with only 100 MB of available main memory. Which sorting technique will be most appropriate?1)QuickSort2)MergeSort3)HeapSort4)Selection Sort...
User Avatar
0 votes
2 answers
617
Time complexity
To construct binary search tree either from preorder or postorder what is the efficient time complexity ? can we construct unique BST along with post and preorder ?Then what is the significance of using PRE+INORDER or POST+INORDER
To construct binary search tree either from preorder or postorder what is the efficient time complexity ?can we construct unique BST along with post and preorder ?Then wh...
User Avatar
0 votes
2 answers
618
what is the time complexity of below code ?
foo(int n) { for(int i=0 ; i<n ;i++) for(int j=i ; j<=i*i ;j++) if(j%i==0) { for(int k=0;k<j;k++) printf("hii"); } } How to proceed here for analyzing the time complexity ?
foo(int n) { for(int i=0 ; i<n ;i++) for(int j=i ; j<=i*i ;j++) if(j%i==0) { for(int k=0;k<j;k++) printf("hii"); } } How to proceed here for analyzing the time complexity...
User Avatar
0 votes
1 answer
619
#algorithm
15.4-1 is it right ??? ans is 6 ?? is there any other method to determine the lcs coz it requires time to compute till the whole traversal of matrix
15.4-1 is it right ???ans is 6 ??is there any other method to determine the lcs coz it requires time to compute till the whole traversal of matrix
User Avatar
0 votes
1 answer
623
self doubt
all NP problems have the complexity exponential ???
all NP problems have the complexity exponential ???
User Avatar
0 votes
0 answers
624
Recurrence Equation
To prove that the time complexity of equation T(n) = T(α n) + T((1 – α)n) + βn is Θ(n logn).
To prove that the time complexity of equationT(n) = T(α n) + T((1 – α)n) + βnisΘ(n logn).
User Avatar
0 votes
2 answers
625
Complexity!!!
Hello anyone can help me to find big O for this algorithm please.... f=1; x=3; for (int i = 1; i <= n; i*=2) for (int j = 1; j <= i * i; j++) if (i % j == 0) for (int k = 1; k <= j; k++) f=f*x;
Hello anyone can help me to find big O for this algorithm please.... f=1;x=3;for (int i = 1; i <= n; i*=2) for (int j = 1; j <= i * i; j++) if (i % j == 0) ...
User Avatar
2 votes
1 answer
627
Time Complexity in
What is the time Complexity of 2T(n/2) + nlogn? Can we apply Master's Theorem?
What is the time Complexity of 2T(n/2) + nlogn? Can we apply Master's Theorem?
User Avatar
0 votes
1 answer
628
time complexity
what is the time complexity of the following program? int unknown(int n) { int i,j,k=0; for(i=n/2;i<=n;i++) for(j=2;j<=n;j=j*2) k=k+n/2; return (k); } Please explain briefly.
what is the time complexity of the following program? int unknown(int n) { int i,j,k=0; for(i=n/2;i<=n;i++) for(j=2;j<=n;j=j*2) k=k+n/2; return (k); }Please explain brief...
User Avatar
3 votes
2 answers
629
Merge Sort
The average no. of comparisons performed by the merge sort algorithm, in merging two sorted lists of length 2 is - a) 8/3 b) 8/5 c) 11/7 d) 11/6
The average no. of comparisons performed by the merge sort algorithm, in merging two sorted lists of length 2 is -a) 8/3b) 8/5c) 11/7d) 11/6
User Avatar
0 votes
1 answer
630
time complexity
What is the time complexity of the following program? main() { i = n; while(i>=1) { i=i/2; i=i/3; i=i/5; i=i*10; i=i-10; } } I am getting actual answer as $\log _3n$+ n/10 = O(n). Please explain briefly.
What is the time complexity of the following program?main(){ i = n;while(i>=1) { i=i/2; i=i/3; i=i/5; i=i*10; i=i-10;}}I am getting actual ...
User Avatar
Page: