Search Results
| Search type | Search syntax |
|---|---|
| Tags | [tag] |
| Exact | "words here" |
| Author |
user:1234 user:me (yours) |
| Score |
score:3 (3+) score:0 (none) |
| Answers |
answers:3 (3+) answers:0 (none) isaccepted:yes hasaccepted:no inquestion:1234 |
| Views | views:250 |
| Code | code:"if (foo != bar)" |
| Sections |
title:apples body:"apples oranges" |
| URL | url:"*.example.com" |
| Saves | in:saves |
| Status |
closed:yes duplicate:no migrated:no wiki:no |
| Types |
is:question is:answer |
| Exclude |
-[tag] -apples |
| For more details on advanced search visit our help page | |
Results tagged with runtime-analysis
Search options not deleted
user 44640
Questions about methods for estimating the increase in runtime of an algorithm as the input size increases.
2
votes
0
answers
20
views
What would be the time complexity if a recursive function is inside a loop? [duplicate]
I am confused in calculating the time complexity for a recursive function inside a loop.
Function (int n){
if(n<=1) return;
for(int i=1;i<=3;i++)
Function(n/3);
}
in the text book …
- 121