The good-enough? test used in computing square roots will not be very effective for finding the square roots of very small numbers. Also, in real computers, arithmetic operations are almost always performed with limited precision. This makes our test inadequate for very large numbers. Explain these statements, with examples showing how the test fails for small and large numbers. An alternative strategy for implementing good-enough? is to watch how guess changes from one iteration to the next and to stop when the change is a very small fraction of the guess. Design a square-root procedure that uses this kind of end test. Does this work better for small and large numbers?
There are no comments yet.
You must log in to post a comment.Login
(check-equal? (round (* 1000 (square-root 4.0))) 2000.0) (check-equal? (round (* 1000 (square-root 100.0))) 10000.0) (check-equal? (round (* 1000 (square-root 1000000.0))) 1000000.0) (check-equal? (round (* 1000 (square-root 0.04))) 200.0)