fix bs fibo

Author: elringus

samples/bench/bootsharp/Program.cs

@@ -36,5 +36,8 @@ public class Export (IImport import) : IExport
 {
     public int EchoNumber () => import.GetNumber();
     public Data EchoStruct () => import.GetStruct();
-    public int Fi (int n) => n <= 1 ? n : Fi(n - 1) + Fi(n - 2);
+    public int Fi (int n) => F(n);
+    // Due to heavy recursion, a significant degradation accumulates due to constant
+    // dereferencing of the instance on each iteration, hence using the static version.
+    private static int F (int n) => n <= 1 ? n : F(n - 1) + F(n - 2);
 }

samples/bench/readme.md

@@ -6,16 +6,16 @@
 
 ## Benches
 
+- `Fibonacci` — compute with heavy recursion
 - `Echo Number` — interop with raw numbers
 - `Echo Struct` — interop with JSON-serialized structs
-- `Fibonacci` — compute performance
 
 All results are relative to the Rust baseline (lower is better).
 
 ## 2024 (.NET 9)
 
 |             | Rust  | Zig   | .NET LLVM | Bootsharp | .NET AOT | Go      |
 |-------------|-------|-------|-----------|-----------|----------|---------|
-| Fibonacci   | `1.0` | `1.0` | `1.0`     | `1.5`     | `1.7`    | `3.8`   |
+| Fibonacci   | `1.0` | `1.0` | `1.0`     | `1.0`     | `1.7`    | `3.8`   |
 | Echo Number | `1.0` | `0.9` | `1.6`     | `14.0`    | `23.5`   | `718.7` |
 | Echo Struct | `1.0` | `1.1` | `2.0`     | `2.5`     | `5.9`    | `15.2`  |