import BSTIterative import AVLIterative import RandomArray bt = BSTIterative.BST() at = AVLIterative.AVL() arraylength = 10000 l = RandomArray.getRandomArray(arraylength) print("Processing random case") for i in range(len(l)): bt.insertIter(l[i]) at.insertIter(l[i]) print("BST level traversals: ", bt.traversecount) print("AVL level traversals: ", at.traversecount) print("Done") bt = BSTIterative.BST() at = AVLIterative.AVL() print("Processing worst case") for i in range(arraylength): bt.insertIter(i) at.insertIter(i) print("BST level traversals: ", bt.traversecount)
B.append(max_value) i, j = 0, 0 C = [None]*size for k in range(0,size): if A[i] <= B[j]: C[k] = A[i] i += 1 else: C[k] = B[j] j += 1 #print "merged %s and %s and got %s"%(A,B,C) return C times = [] for i in range(0,10): A = RandomArray.getRandomArray(10000) start = time.clock() print (Mergesort(A)) stop = time.clock() print ("Process Finished in %s seconds"%(stop-start)) times.append(stop-start) for i in range(0,10): print ("%s"%(times[i]))