Fibonacci recursive

rowankovalenko536 22.05.2026 11:37

Fibonacci recursive

core.py

def factorial(n):
    if n == 0: return 1
    return n * factorial(n-1)

print(factorial(5))

main.py

from collections import Counter
def top_words(text, n=5):
    words = text.lower().split()
    return Counter(words).most_common(n)

print(top_words('the cat sat on the mat the cat'))

Fibonacci recursive

Are you sure you want to delete this post?