diff options
| author | David Faulkner <[email protected]> | 2026-08-07 23:40:47 -0500 |
|---|---|---|
| committer | David Faulkner <[email protected]> | 2026-08-07 23:40:47 -0500 |
| commit | b3e9e62599532050fc776c5e8f076915b56c2235 (patch) | |
| tree | af252346106a61b18cc6fc6fdbd32e962d096f1c /fibonacci6.c | |
Import official C23 code examples for Modern C (Jens Gustedt, 2024)HEADupstream-importmain
- Add official C source files, Makefile, c23-fallback.h, and LICENSE
- Update README.md with study mirror notice
Diffstat (limited to 'fibonacci6.c')
| -rw-r--r-- | fibonacci6.c | 29 |
1 files changed, 29 insertions, 0 deletions
diff --git a/fibonacci6.c b/fibonacci6.c new file mode 100644 index 0000000..2090ccd --- /dev/null +++ b/fibonacci6.c @@ -0,0 +1,29 @@ +#include "c23-fallback.h" +#include <stdio.h> + +/** + ** Rewrite Fibonacci iteratively such that is proceeds in pairs of + ** values and hopefully doesn't spill any of the variables to memory. + **/ + +size_t fib2(size_t n) { + register size_t x1 = 1; // F(x1) for x1 = (n+1)%2 + 1 + register size_t x2 = n%2 ? 1 : 2; // F(x1+1) + for (register size_t i = (n-1)/2; i; --i) { + x1 += x2; + x2 += x1; + } + return x1; // F(y) with y = x1 + 2*((n-1)/2) + // = x1 + ((n-1)-((n+1)%2)) + // = ((n+1)%2 + 1)+((n-1)-((n+1)%2)) + // = n +} + +int main(int argc, char* argv[argc+1]) { + for (int i = 1; i < argc; ++i) { // process args + size_t const n = strtoull(argv[i], nullptr, 0); // arg -> size_t + printf("fib(%zu) is %zu\n", + n, fib2(n)); + } + return EXIT_SUCCESS; +} |
