Recent questions tagged time-complexity

1 votes
0 answers
1411
Why [logn]! is not polynomial bounded where [loglogn]! is polynomial bounded? Note [ ] is greatest integer function
0 votes
1 answer
1412
0 votes
0 answers
1414
a) Order of finding k th Root ( express in terms of k and n where k represent 3 for cube root , n represent size of input )
0 votes
1 answer
1415
T(n) = 16T(n/4) + n!i got its ans as logn* n!is it correct ?
3 votes
3 answers
1416
2 votes
1 answer
1417
merge sort algo takes 30sec for input size of 64 in worst case, then max input size solvabe in 6 minutes?512 64 1024 2048
1 votes
2 answers
1421
What is the complexity of evaluating an infix expression having n operators?
3 votes
2 answers
1422
Consider the code j = n ;while (j >= 1){ for (i = 1 to j ) x = x + 1 ; j = n/2 ; }What is the time complexity?O(nlogn)O(n logn)O(n )None of the above
1 votes
1 answer
1424
1. n (log n)log n2. 2n n√n3. 2n nlog nexplain plz
2 votes
1 answer
1427
2 votes
3 answers
1429
Which is right method to apply for this substitute or recursion...Can we convert it in master theorem format
1 votes
1 answer
1430
running time of NFA to DFA conversion including the case where NFA has $\epsilon$-transition is ?
1 votes
2 answers
1432
$\sum\limits_{i=0}^n i^{3} = X$and following choices for X1.$\Theta(n^4)$2.$\Theta(n^5)$3. $O(n^5)$4.$\Omega(n^3)$possible values of $X$
1 votes
1 answer
1433
How to build Recurrence relation for Time complexity double foo(int n) { int i; double sum; if(n == 0) { return 1.0; } else { sum = 0.0; for(i = 0; i < n; i++) { sum += f...
2 votes
3 answers
1434
A machine took 200 sec to sort 200 names,using bubble sort.In 800 sec,it can approximately sort ?a. 400 names b. 800 names c. 750 names d. 850 names
1 votes
1 answer
1435
1 votes
1 answer
1436
Let f(n) = Ω(n), g(n) = O(n) and h(n) = θ(n). Then [f(n) ⋅ g(n)] + h(n) is _______.
0 votes
2 answers
1438
0 votes
3 answers
1440