In this assignment you will write your own square root function and a main program to test it. The square root function will return a tuple the includes the square root of the number as well as the number of iterations it took to arrive at that solution. The pseudocode for the function and main program is given as follows: import math EPSILON = 1.0e-14 def square_root(number): approximation = 1 previous = 0 iterations = 0 while ((absolute value of (approximation * approximation minus number) is greater than EPSILON) and previous != approximation): previous = approximation approximation = 0.5 * (approximation + number / approximation) iterations += 1 return (approximation, iterations) print('This program calculates the square root of an inputted number') print('and the number of iterations that the algorithm took to reach') print(f'a degree of accuracy of {EPSILON}.') answer = “yes” while answer[0] equals “Y” or answer[0] equals “y”: number = float(input('Enter a nonnegative number: ')) while number is less than 0: number = float(input('Please enter a nonnegative number: ')) # the function call returns a tuple sqrt_number, iterations = the function call print(f'The square root of {number} is {sqrt_number:.15}.') print(f'The number of iterations needed were {iterations}.') answer = input('Do you wish to continue (y/n)? ') print('Goodbye') This is what i have so far but its wrong import math EPSILON = 1.0e-14 def sqrt_root(number): approximation = 1 previous = 0 iterations = 0 while((abs(approximation*approximation - number) > EPSILON) and previous != approximation): iterations += 1 return(approximation,iterations) print('This program calculates the square root of an inputted number') print('and the number of iterations that the algorithm took to reach') print(f'a degree of accuracy of {EPSILON}.') answer = "yes" while answer[0] == "Y" or answer[0] == "y": number = float(input('Enter a nonnegative number:')) while number < 0: number = float(input('Please enter a nonnegative number: ')) sqrt_number = number iterations = number print(f'The square root of {number} is {sqrt_number:.15}.') print(f'The number of iterations needed were {iterations}.') answer = input('Do you wish to continue (y/n)? ') print('Goodbye')
In this assignment you will write your own square root function and a main
square root function will return a tuple the includes the square root of the number as well as the
number of iterations it took to arrive at that solution. The pseudocode for the function and main
program is given as follows:
import math
EPSILON = 1.0e-14
def square_root(number):
approximation = 1
previous = 0
iterations = 0
while ((absolute value of (approximation * approximation minus number)
is greater than EPSILON) and previous != approximation):
previous = approximation
approximation = 0.5 * (approximation + number / approximation)
iterations += 1
return (approximation, iterations)
print('This program calculates the square root of an inputted number')
print('and the number of iterations that the
print(f'a degree of accuracy of {EPSILON}.')
answer = “yes”
while answer[0] equals “Y” or answer[0] equals “y”:
number = float(input('Enter a nonnegative number: '))
while number is less than 0:
number = float(input('Please enter a nonnegative number: '))
# the function call returns a tuple
sqrt_number, iterations = the function call
print(f'The square root of {number} is {sqrt_number:.15}.')
print(f'The number of iterations needed were {iterations}.')
answer = input('Do you wish to continue (y/n)? ')
print('Goodbye')
This is what i have so far but its wrong
print('Goodbye')
Trending now
This is a popular solution!
Step by step
Solved in 5 steps with 3 images