def iterativeTribonacci(n):
firstNumber = 0
secondNumber = 0
thirdNumber = 1
if(n < 2):
return 0
elif(n == 2):
return 1
else:
for i in range(3,n+1):
result = firstNumber + secondNumber + thirdNumber
firstNumber = secondNumber
secondNumber = thirdNumber
thirdNumber = result
return result
def recursiveTribonacci(n):
if(n < 2):
return 0
elif(n == 2):
return 1
else:
return recursiveTribonacci(n - 1) + recursiveTribonacci(n - 2) + recursiveTribonacci(n - 3)
k=8
print str(k)+'.element:'+str(iterativeTribonacci(k)) + ' for iterative method.'
print str(k)+'.element:'+str(recursiveTribonacci(k)) + ' for recursive method.'
8.element:24 for iterative method. 8.element:24 for recursive method.
def F(n):
if(n == 0):
return 1
return n - M(F(n - 1))
def M(n):
if(n == 0):
return 0
return n - F(M(n - 1))
k=12
female = F(k)
male = M(k)
print 'Female:'+str(female)+ ' Male:'+str(male) +' ('+str(k)+').element'
Female:8 Male:7 (12).element