The algorithms in this chapter addressed the discrete search problem, that is, searching for a value in a given sequence. Similar algorithms can be derived for the continuous case, that is, searching...

The algorithms in this chapter addressed the discrete search problem, that is, searching for a value in a given sequence. Similar algorithms can be derived for the continuous case, that is, searching for points at which a continuous function takes a given value. Describe parallel algorithms for locating (within a given tolerance) the point at which a certain function (i) assumes its largest value and (ii) is equal to zero.