import helper helper.resetTimer() arr = helper.makeArray(40, 1000) t = helper.readTimerMilliseconds() print "===== took: %d ms =========" % t print "\n".join(arr)
#Un-comment print lines to verify sorting function works import a1 import sys import helper if(sys.argv[1] == None): print "File usage: <stringlen> <arraylen>" stringlen = int(sys.argv[1]) arraylen = int(sys.argv[2]) helper.resetTimer() arr = helper.makeArray(stringlen, arraylen) time = helper.readTimerMilliseconds() #print "\n".join(arr) print "------------>Took: %d ms to construct" %time helper.resetTimer() a1.quicksort(arr) time = helper.readTimerMilliseconds() #print "\n".join(arr) print "------------>Took: %d ms to sort" %time
import csci2020u.mergesort as merge import sys import helper if len(sys.argv) == 3: strlen = int(sys.argv[1]) arrlen = int(sys.argv[2]) else: print "Usage: <strlen> <arrlen>" sys.exit() array = helper.makeArray(strlen, arrlen) helper.resetTimer() array2 = merge.sort(array) t = helper.readTimerMilliseconds() print "Sorted everything in %d ms" % t print "\n".join(array2)