We went over an algorithm that approximates the sqr root of a number via binary search. A divide-and-conquer system can be used for computing logarithms.
Write an algorithm using no code that approximates the (bi- nary) logarithm y of a real number x ? 1, denoted by y = log(x). Also, suggest a sensible termination condition.