This assessment creates an Initial version of the auction project that allows user to register, login, and logout. Registered users can post items (advertisements) for auction.
he basic idea of the method of bisection is to start with an Initial interval, [a0,b0], that is chosen so that f(a0)f(b0) < 0. (This guarantees that there is at least one root of the function f(x) within the Initial interval.) We then iteratively bisect the interval, generating a sequence of intervals [ak,bk] that is guaranteed to converge to a solution to f(x) = 0.
This project asks you to write a program that allows you to specify an Initial
configuration. The program follows the rules of Life (listed shortly) to show the
continuing behavior of the configuration.
