Python Coding Problem Program Needs Measure Time Takes Call Bottom Two Functions Iterative Q43863610
Python coding problem:
The program needs to measure the time it takesto call the bottom two functions, iterative and recursive, forseveral values of n (exponent), you can set thebase to 3.14159265359. The program willcreate a CSV file containing the following fields: n,iterative-time, recursive-time. The experiment should runto biggest possible value of n that your computer allows.
Please explain how to get the runtimes with the values of n.
Example of the csv file for n={1,2,3,4}
1,10,10
2,11,10
3,12,13
4,12,13
Iterative implementation double iterativePower(double base, int exponent){ double retVal 1.0; if (exponent < 0){ return 1.0 / iterativePower (base, -exponent); }else{ for (int i=0; i<exponent; i++) retVal *= base; } return retVal; } Recursive implementation double recursivePower(double base, int exponent){ if (exponent < 0){ return 1.0 / recursivePower(base, -exponent); 0){ }else if (exponent return 1.0; }else { return base * recursivePower(base, exponent 1); } } Show transcribed image text Iterative implementation double iterativePower(double base, int exponent){ double retVal 1.0; if (exponent
Expert Answer
Answer to Python coding problem: The program needs to measure the time it takes to call the bottom two functions, iterative and re…
OR