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>
16 lines
337 B
C
16 lines
337 B
C
// Ackermann function benchmark - deep recursion
|
|
#include <stdio.h>
|
|
#include <stdint.h>
|
|
|
|
int64_t ack(int64_t m, int64_t n) {
|
|
if (m == 0) return n + 1;
|
|
if (n == 0) return ack(m - 1, 1);
|
|
return ack(m - 1, ack(m, n - 1));
|
|
}
|
|
|
|
int main() {
|
|
int64_t result = ack(3, 10);
|
|
printf("ack(3,10) = %ld\n", result);
|
|
return 0;
|
|
}
|