+ ##
+ ##
+ ## INPUTS:
+ ##
+ ## * ``f`` - The function whose root we seek.
+ ##
+ ## * ``a`` - The "left" endpoint of the interval in which we search.
+ ##
+ ## * ``b`` - The "right" endpoint of the interval in which we search.
+ ##
+ ## * ``epsilon`` - How close we should be to the actual root before we
+ ## halt the search and return the current approximation.
+ ##
+ ## OUTPUTS:
+ ##
+ ## * ``root`` - The root that we found.
+ ##
+ ## * ``iterations`` - The number of bisections that we performed
+ ## during the search.
+ ##