Skip to content

Latest commit

 

History

History
9 lines (7 loc) · 395 Bytes

README.md

File metadata and controls

9 lines (7 loc) · 395 Bytes

Binary Search

The program in this example demonstrates a stream-based approach to locating a zero of a given continuous function in a given interval via the so-called binary search. Unlike Newton-Raphson's method, binary search does not need the derivative of the given function, though its convergence rate is (much) slower than that of Newton-Raphson's method.

Happy programming in ATS!!!