Register

Self

289 views

1 Answer

0 0 votes
 

Masters theorem can't be applied on trigonometric function as f(n) in recurrence equation

Generally, masters relies on regularity condition and as the function has oscillatory values it violetes the regularity condition
Voting & Accepting an answer helps improve the community
← Previous · Packet SwitchingNext → · draw DFA that accept...
← Previous in category · GO Classes Test Seri...Next in category → · ISRO CSE 2023 | Ques...
Position:
Show:

Related questions

1 1 vote
2 answers 2 answers
603
603 views
vishal_prasad_singh asked Nov 5, 2025
603 views
Self Doubt
O(n)∗Ω(n)+Θ(n) = ?1.O(n)2.Ω(n)3.Θ(n)4. none 
0 0 votes
1 1 answer
463
463 views
Ayushhh_ asked Jul 15, 2024
463 views
self doubt
What is the time complexity of the following functionint i = n;while(i>=n){i = i-30;i=i+15;i=i+25;}
0 0 votes
3 3 answers
2.1k
2.1k views
Nisha Bharti asked Sep 26, 2022
2,122 views
Self doubt.
What is the time & space complexity of this algorithm?Main(){ for(i=n; i>10; i=i^1/4) { for(j=201; j<n^3; j=j+400) ...
0 0 votes
1 1 answer
1.6k
1.6k views
tusharb asked Feb 18, 2022
1,636 views
Algorithm self doubt
As we know the time complexity of solving the greedy knapsack algorithm depends mainly on the sorting algorithm used, Can we use counting sort as the sorting algorithm to...