Suite de Fibonacci
Description du code
Exemple de récursion en PythonCode source ou contenu du fichier
Code Python (Suite de Fibonacci) (12 lignes)
import sys def fib(n): if n < 2: return n else: return fib(n - 1) + fib(n - 2) def main(): limit = int(sys.argv[1]) print fib(limit) main()
Autres extraits de codes en Python
- Suite de Fibonacci Exemple de récursion en Python
- Tous les extraits
English translation
You have asked to visit this site in English. For now, only the interface is translated, but not all the content yet.If you want to help me in translations, your contribution is welcome. All you need to do is register on the site, and send me a message asking me to add you to the group of translators, which will give you the opportunity to translate the pages you want. A link at the bottom of each translated page indicates that you are the translator, and has a link to your profile.
Thank you in advance.
Document created the 05/10/2009, last modified the 28/10/2018
Source of the printed document:https://www.gaudry.be/en/sniplet-rf-python/fibonacci-rec.py.html
The infobrol is a personal site whose content is my sole responsibility. The text is available under CreativeCommons license (BY-NC-SA). More info on the terms of use and the author.