# Fibonacci Sequence Using Recursiondef recur_fibo(n):if n <= 1:return nelse:(recur_fibo(n-1) + recur_fibo(n-2))def isPositiveInteger(limit):return limit >= 0def main():limit = int(input("How many terms to include in fibonacci series: "))if isPositiveInteger(limit):print("The first {limit} terms of the fibonacci series are as follows:")print([recur_fibo(n) for n in range(limit)])else:print("Please enter a positive integer: ")if __name__ == '__main__':main()
此处可能存在不合适展示的内容,页面不予展示。您可通过相关编辑功能自查并修改。
如您确认内容无涉及 不当用语 / 纯广告导流 / 暴力 / 低俗色情 / 侵权 / 盗版 / 虚假 / 无价值内容或违法国家有关法律法规的内容,可点击提交进行申诉,我们将尽快为您处理。