Created
November 27, 2015 12:21
-
-
Save BurcakAsal/9fa33f8a1cf7da7e3a56 to your computer and use it in GitHub Desktop.
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
{ | |
"cells": [ | |
{ | |
"cell_type": "code", | |
"execution_count": 5, | |
"metadata": { | |
"collapsed": false | |
}, | |
"outputs": [ | |
{ | |
"name": "stdout", | |
"output_type": "stream", | |
"text": [ | |
"8.element:24 for iterative method.\n", | |
"8.element:24 for recursive method.\n" | |
] | |
} | |
], | |
"source": [ | |
"def iterativeTribonacci(n):\n", | |
" firstNumber = 0\n", | |
" secondNumber = 0\n", | |
" thirdNumber = 1\n", | |
" \n", | |
" if(n < 2):\n", | |
" return 0\n", | |
" elif(n == 2):\n", | |
" return 1\n", | |
" else:\n", | |
" for i in range(3,n+1):\n", | |
" result = firstNumber + secondNumber + thirdNumber\n", | |
" firstNumber = secondNumber\n", | |
" secondNumber = thirdNumber\n", | |
" thirdNumber = result\n", | |
" \n", | |
" \n", | |
" return result\n", | |
" \n", | |
"\n", | |
"\n", | |
"def recursiveTribonacci(n):\n", | |
" if(n < 2):\n", | |
" return 0\n", | |
" elif(n == 2):\n", | |
" return 1\n", | |
" else:\n", | |
" return recursiveTribonacci(n - 1) + recursiveTribonacci(n - 2) + recursiveTribonacci(n - 3)\n", | |
"\n", | |
"\n", | |
"k=8\n", | |
"\n", | |
"print str(k)+'.element:'+str(iterativeTribonacci(k)) + ' for iterative method.'\n", | |
"print str(k)+'.element:'+str(recursiveTribonacci(k)) + ' for recursive method.'\n" | |
] | |
}, | |
{ | |
"cell_type": "code", | |
"execution_count": 12, | |
"metadata": { | |
"collapsed": false | |
}, | |
"outputs": [ | |
{ | |
"name": "stdout", | |
"output_type": "stream", | |
"text": [ | |
"Female:8 Male:7 (12).element\n" | |
] | |
} | |
], | |
"source": [ | |
"def F(n):\n", | |
" if(n == 0):\n", | |
" return 1\n", | |
"\n", | |
" return n - M(F(n - 1))\n", | |
"\n", | |
" \n", | |
"def M(n):\n", | |
" if(n == 0):\n", | |
" return 0\n", | |
"\n", | |
" return n - F(M(n - 1))\n", | |
"\n", | |
"k=12 \n", | |
" \n", | |
"female = F(k)\n", | |
"male = M(k)\n", | |
"\n", | |
"print 'Female:'+str(female)+ ' Male:'+str(male) +' ('+str(k)+').element' \n" | |
] | |
} | |
], | |
"metadata": { | |
"kernelspec": { | |
"display_name": "Python 2", | |
"language": "python", | |
"name": "python2" | |
}, | |
"language_info": { | |
"codemirror_mode": { | |
"name": "ipython", | |
"version": 2 | |
}, | |
"file_extension": ".py", | |
"mimetype": "text/x-python", | |
"name": "python", | |
"nbconvert_exporter": "python", | |
"pygments_lexer": "ipython2", | |
"version": "2.7.9" | |
} | |
}, | |
"nbformat": 4, | |
"nbformat_minor": 0 | |
} |
Sign up for free
to join this conversation on GitHub.
Already have an account?
Sign in to comment