///////
//
// Student: Russell Lowke
//     T.F: Francis Crick
// Unit Eight, pencil-and-paper - question 2 [worth 2pts],  8/2/2002
//
//  Explain how to implement two stacks in one array of size n in such a way
//  that neither stack overflowflow unless the total number of elements combined in
//  in both stacks together is n + 1.
//

Each stack should be placed at opposite ends of the array.

For instance, if the array is of size n = 30 the first stack would start at index [0], while
the second stack would start at index [29].

When pushing onto the first stack, the stack grows positively (increments++) along the array.
Conversely, when pushing onto the second stack, the stack grows negatively (decrements--) 
along the array.

When the two arrays meet the stacks are are full, and their elemets combined will be n.
Overflow would occur past this point (combined = n + 1).