Bind Dates

1.         Create a binding table and contour diagram for any of the above Dates programs.

2. Range

Create an algorithm that reads in three values A, B, C and outputs the range R, which is the difference between the largest and smallest values. This must be done using the following subprograms. Provide the maximum hiding of variables and subs possible. The main program Range is to call a subprogram BigSmall3(I, J, K, L, S) , which finds the largest L and smallest S of the parameters I , J, K. This subprogram in turn calls two functions Big(P, Q, R) and Small(P, Q, R) , each of which must call a subprogram Sort2(G, H), which takes G and H, and arranges them so that G is largest and H is smallest.