All three of the following complaints have to do with the fact that this
implementation requires us to control the order in which Maple does things
by hand. In other words, the implementation is not fully automated.
- We have to make a choice about whether to evaluate the assignment to
neg or the assignment to pos during each repetition. It would be nice
if Maple would do this for us.
- We have to repeat the process over and over, and we have to decide when
to stop. It would be nice if Maple would do the repetitions for us and decide
when we've gotten close enough to the answer.
- Each time that we use this approach, we've got to type in the seven
assignment statements that make it up. It would be nice to package this
implementation up into something resembling a function, so that we could use it
Return to lesson.
Joseph L. Zachary
Department of Computer Science
University of Utah