I need help finding the Run Time Analysis of these code(s): Provide the tightest big-Oh bound on the run time for each of the following methods. Please explain how you got the answer and why it is case. d.void jedi (int n){if( n <= 147 )time += 54;else{for (int i=0; i i.int pow (double x, int n){if( n==0 )return 1;else{double halfpower = pow (x,n/2);if( n % 2 == 0 ){return halfpower*halfpower;}else{return halfpower*halfpower*x;}}}

In the above question there are two different programs which is shows different return or output in…

Answered: I need help finding the Run Time…

Database System Concepts

7th Edition

ISBN:9780078022159

Author:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan

Publisher:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan

Chapter1: Introduction

Section: Chapter Questions

Problem 1PE

See similar textbooks

Related questions

Question

I need help finding the Run Time Analysis of these code(s): Provide the tightest big-Oh bound on the run time for each of the following methods. Please explain how you got the answer and why it is case.

d.
void jedi (int n)
{
if( n <= 147 )
time += 54;
else
{
for (int i=0; i<n/2; i++)
time++;
jedi (n/3);
for (int i=0; i<13*n; i++)
time++;
jedi ( (2*n) /3);
}
}

i.
int pow (double x, int n)
{
if( n==0 )
return 1;
else
{
double halfpower = pow (x,n/2);
if( n % 2 == 0 )
{
return halfpower*halfpower;
}
else
{
return halfpower*halfpower*x;
}
}
}

Expert Solution

Step by step

Solved in 2 steps

SEE SOLUTION Check out a sample Q&A here

Knowledge Booster

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