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>
15 lines
295 B
Plaintext
15 lines
295 B
Plaintext
// Sum loop benchmark - tight numeric loop
|
|
fn sumTo(n: Int): Int = {
|
|
sumLoop(n, 0)
|
|
}
|
|
|
|
fn sumLoop(n: Int, acc: Int): Int = {
|
|
if n <= 0 then acc
|
|
else sumLoop(n - 1, acc + n)
|
|
}
|
|
|
|
fn main(): Unit = {
|
|
let result = sumTo(10000000)
|
|
Console.print("Sum to 10M: " + toString(result))
|
|
}
|