Brandon Lucas
42fef80a47
Add benchmarks comparing Lux against 7 languages: - Rust, C, Go (compiled) - Node.js, Bun (JavaScript JIT) - Python (interpreted) Benchmarks: - Fibonacci (fib 35): recursive function calls - Prime counting (10k): loops and conditionals - Sum loop (10M): tight numeric loops - Ackermann (3,10): deep recursion - Selection sort (1k): sorting algorithm - List operations (10k): map/filter/fold with closures Results show Lux: - Matches C and Rust performance - 2-5x faster than Go - 7-15x faster than Node.js - 10-285x faster than Python Co-Authored-By: Claude Opus 4.5 <noreply@anthropic.com>
12 lines
285 B
Plaintext
12 lines
285 B
Plaintext
// Ackermann function benchmark - deep recursion
|
|
fn ack(m: Int, n: Int): Int = {
|
|
if m == 0 then n + 1
|
|
else if n == 0 then ack(m - 1, 1)
|
|
else ack(m - 1, ack(m, n - 1))
|
|
}
|
|
|
|
fn main(): Unit = {
|
|
let result = ack(3, 10)
|
|
Console.print("ack(3,10) = " + toString(result))
|
|
}
|