Fibonacci recursive

reeseweber497 22.05.2026 11:12

Fibonacci recursive

Just for fun

algo.py

def reverse_string(s): return s[::-1]

print(reverse_string("hello"))

data.py

def caesar_cipher(text, shift=3):
    result = ""
    for ch in text:
        if ch.isalpha():
            base = ord("A") if ch.isupper() else ord("a")
            result += chr((ord(ch) - base + shift) % 26 + base)
        else: result += ch
    return result

print(caesar_cipher("Hello World"))

test.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?