Hello! The first paragraph!

The second one here!

This post should be an article about one interesting (or not) algo but I want to optimize it before publishing. Because rn it sucks. If Ill fail to do that maybe Ill post the beta version

text and new text
from the new line

Code Example (Python)


def hello_world():
    print("Hello, World!")
    
# Call the function
hello_world()

# This is a longer example to demonstrate collapsing
def fibonacci(n):
    """Calculate the nth Fibonacci number"""
    if n <= 0:
        return 0
    elif n == 1:
        return 1
    else:
        a, b = 0, 1
        for _ in range(2, n + 1):
            a, b = b, a + b
        return b

# Generate the first 10 Fibonacci numbers
for i in range(10):
    print(f"Fibonacci({i}) = {fibonacci(i)}")

Code Example (C++)


#include <iostream>
#include <vector>

int main() {
    std::cout << "Hello, World!" << std::endl;
    
    // This is a longer example to demonstrate collapsing
    std::vector<int> fibonacci(15);
    fibonacci[0] = 0;
    fibonacci[1] = 1;
    
    std::cout << "Fibonacci Series:" << std::endl;
    std::cout << fibonacci[0] << " " << fibonacci[1] << " ";
    
    for(int i = 2; i < 15; i++) {
        fibonacci[i] = fibonacci[i-1] + fibonacci[i-2];
        std::cout << fibonacci[i] << " ";
    }
    std::cout << std::endl;
    
    return 0;
}