int foo1(int n) { int i, sum = 0; if (n==1) { return 1; } for(i=1; i<=n; i*=3) { sum += i; %3D }

Systems Architecture
7th Edition
ISBN:9781305080195
Author:Stephen D. Burd
Publisher:Stephen D. Burd
Chapter10: Application Development
Section: Chapter Questions
Problem 6VE
icon
Related questions
Question

Topic: Analysis of Algorithms 

Answer this item in handwritten manner. 

Find the running time in Big-Oh notation. (see attached photo)

int foo1(int n) {
int i, sum = 0;
%D
if (n==1) {
return 1;
}
for(i%3D1%; i<=n; i*=3){
sum
m += i;
{
return sum + foo1(n-1);
}
Transcribed Image Text:int foo1(int n) { int i, sum = 0; %D if (n==1) { return 1; } for(i%3D1%; i<=n; i*=3){ sum m += i; { return sum + foo1(n-1); }
Expert Solution
steps

Step by step

Solved in 2 steps with 1 images

Blurred answer
Knowledge Booster
Computational Systems
Learn more about
Need a deep-dive on the concept behind this application? Look no further. Learn more about this topic, computer-science and related others by exploring similar questions and additional content below.
Similar questions
  • SEE MORE QUESTIONS
Recommended textbooks for you
Systems Architecture
Systems Architecture
Computer Science
ISBN:
9781305080195
Author:
Stephen D. Burd
Publisher:
Cengage Learning
C++ for Engineers and Scientists
C++ for Engineers and Scientists
Computer Science
ISBN:
9781133187844
Author:
Bronson, Gary J.
Publisher:
Course Technology Ptr