Lecture Notes on 20 Feb 2023

# finds square root of n using binary search
def sqrt_binary (n):
  old_guess = n
  new_guess = 1
  lo = 1
  hi = n
  tol = 1.0e-8
  while (abs(new_guess - old_guess) > tol):
    old_guess = new_guess
    mid = (lo + hi) / 2
    mid2 = mid * mid
    if (mid2 > n):
      hi = mid
    else:
      lo = mid
    new_guess = mid
  return new_guess

# finds square root using a rapid iterative methd
def sqrt_iter (n):
  old_guess = n
  new_guess = n / 2
  tol = 1.0e-8
  while (abs (new_guess - old_guess) > tol):
    old_guess = new_guess
    new_guess = ((n / old_guess) + old_guess) / 2
  return new_guess


def main():
  print (sqrt_binary(5))
  print (sqrt_iter(5))

main()