Secretary Solution Daut Modulated Liquid Poker bad math

gistfile1.py

import math
import random
def dautFind(sec):
	random.shuffle(sec)
	START_LENGTH = len(sec)
	currentLength = START_LENGTH
	end = int(currentLength / math.e)
	maxRank = max(sec[0:end])
	# print "In the first n/e elements the greatest value found was ", maxRank
	currentRank = 0
	start = end
	currentLength = START_LENGTH - start
	end = start + int( currentLength / math.e)
	found = False
	while start != len(sec) - 1 and not found:
		# print "The current max rank is ", maxRank
		# print "Start Index: ", start
		# print "End Index: ", end
		# print "Current Set", sec[start:end]
		currentRank = max(sec[start:end])
		if currentRank > maxRank:
			# print "The maximum value of the current set ", currentRank, " is greater than the current max of ", maxRank 
			found = True
		else:
			maxRank = currentRank
			# print "The new max is: ", maxRank
		start = end
		currentLength = START_LENGTH - start
		end = start + int( currentLength / math.e)
		#special where rounding causes the index at n-2 not to be evaluated
		if start == end and end != START_LENGTH:
			end += 1
	if found:
		return currentRank
	else:
		return sec[START_LENGTH - 1]

NUMBER_OF_SEC = 50
NUMBER_OF_TRIALS = 100000
sec = list(range(0, NUMBER_OF_SEC))
winners = 0
total = 0
for x in range(NUMBER_OF_TRIALS):
	result = dautFind(sec)
	total += result
	if result == (NUMBER_OF_SEC - 1):
		winners += 1
print float(total) / float(NUMBER_OF_TRIALS)
print float(winners) / float(NUMBER_OF_TRIALS)