Use the main routine and support routines from lab 1.
Write a program to move an object that follows a curved path through a given set of points starting from a stopped position, accelerating to some maximum speed and then decelerating to a stop at the initial position - and then repeat:
Initialization
| OR |
|
Simulation
Note that, because 't' monitonically increases, so does 's' and, therefore, so do the indices of the entries retrieved from the table. This should make your search more efficient since you can start the next search from the point of the previous search.