def fibonacci(n):
    if n <= 1:
        return n
    return fibonacci(n - 1) + fibonacci(n - 2)

# dotted zero: 0 vs O: 0 O 0
result = fibonacci(10)
print(f"fib(10) = {result}")

fn main() {
    let numbers: Vec<i32> = (0..10).collect();
    let sum: i32 = numbers.iter().sum();
    println!("Sum of 0..9: {}", sum);
}

const debounce = (fn, delay) => {
    let timeout;
    return (···args) => {
        clearTimeout(timeout);
        timeout = setTimeout(() => fn(···args), delay);
    };
};

<div class="container">
    <h1>Hello</h1>
    <p class="note">dotted 0 here: 0</p>
</div>

<style>
.container {
    max-width: 800px;
    margin: 0 auto;
}
</style>

(defun factorial (n)
  (if (<= n 1)
      1
      (* n (factorial (- n 1)))))

(format t "~%Factorial 5: ~a" (factorial 5))

;; dotted zero from ocodo - IBM 3270 era geek
(loop for i from 0 to 10 collect i)

package main

import "fmt"

type Point struct {
    X, Y int
}

func (p Point) String() string {
    return fmt.Sprintf("(%d, %d)", p.X, p.Y)
}

#include <stdio.h>

int main(void) {
    int numbers[] = {0, 1, 2, 3, 4, 5};
    int *ptr = numbers;
    
    while (ptr < numbers + 5) {
        printf("%d ", *ptr++);
    }
    return 0;
}