from stack import *
import time

def timeStack(s, n):
    '''Print and return how long it takes to push and pop n items using Stack s.
    '''
    start = time.time()
    
    # Do stuff.
    for i in range(n):
        s.push(i)
    
    while not s.isEmpty():
        s.pop()
    
    end = time.time()
    print "Running time for", n, "items:", end - start
    return end - start

# The list of sizes to test.
sizes = [1000]
for i in range(1, 4):
    sizes.append(i * 10000)
print sizes

s1 = Stack()
s1times = []
for n in sizes:
    s1times.append(timeStack(s1, n))

s2 = UpStack()
s2times = []
for n in sizes:
    s2times.append(timeStack(s2, n))