code: def dumbguy_minimize(f, xmin, xmax, xstep):
      
  
      prev = f(xmin)
      this = f(xmin+xstep)
      for x in frange(xmin+xstep,xmax,xstep):
          next = f(x+xstep)
  
          # see if we're on top
          if this < prev and this < next: return x, this
  
          prev = this
          this = next
  
      return x, this
docs: This just steps x and looks for a peak
  
      returns x, f(x)