Repeated Steps of Algorithm

One of the most important aspects of algorithm design is locating the parts of the algorithm that repeat and embeding them in some looping construct. In the example you will note the In general if the problem is well stated then the sequence of steps used to solve the problem should be easy to determine.

Sequence	Question
Initialize variables	Write an algorithm that reads in the number of Y-data points the width of each rectangle (W) then reads in all the Y-data points
Process Data	The algorithm should then iteratively compute the area of each rectangle for each of the Y-data points and accumulate the total.
Print Final Results	After all points have been processed the algorithm should print the total area.