crude fibonacci solution

Fibonacci using Dynamic Array

This example shows a command-line program that computes and prints a Fibonacci sequence stored in a dynamically allocated array. It prompts the user for the number of periods, then uses `malloc` from the C standard library to allocate memory for the values. The program calculates each Fibonacci number iteratively, printing them with `printf` in a formatted layout, breaking to a new line every three entries. It concludes by displaying the final computed value. The visualization relies solely on text output, with no graphics or external libraries beyond the standard C I/O and memory management functions.

TTipTopCoder

64% match

crude combination solution

This example prints a triangular table of binomial coefficients, displaying every combination value nCk for n from 0 up to a user-supplied integer. The output is generated by a recursive factorial function and a combination function that divides factorials, with each row showing increasing k values for a fixed n. The script validates input as non-negative integers and terminates with an error message otherwise, using Python’s built-in `input()`, `split()`, and `isdigit()` methods. The visualization is purely text-based, rendered to the console via `print()` statements with formatted strings.

Aanemochore

61% match

Fibonacci sequence in XQuery

This example visualizes the Fibonacci sequence by generating and plotting the first fifteen numbers through XQuery code. The visualization shows the numeric progression of the sequence, with each value computed recursively via the `local:fibo-numbers` function, which takes two starting integers and a limit. The rendering approach is plain text or tabular output, as the code only returns the sequence values without graphical mapping. It uses standard XQuery 3.0 functions and user-defined functions, with no external libraries or APIs, focusing purely on functional sequence generation. The data source is the code’s own hardcoded initial parameters, 0 and 1, and the result is a simple list of integers.

59% match

Fibonacci in Scala

This example demonstrates a functional definition of the Fibonacci sequence in Scala, highlighting two equivalent recursive implementations: one using nested conditionals and another using pattern matching with a match expression. The visualization shows how the recursive calls unfold, with the second implementation (fib2) called for inputs 10 and 200 to illustrate growth. The code relies on Scala’s standard library, including the Int type and the match keyword, but does not use external visualization libraries. The rendering approach is minimal, focusing on the source code itself as the primary visual artifact, with no graphical output or data source beyond the hardcoded integers passed to the functions.

58% match

Fibonacci Sequence in Elm

This example presents an interactive Fibonacci sequence calculator built in Elm, starting with a simple recursive function and progressing through increasingly feature-rich versions. The code demonstrates Elm’s model-update-view architecture using `beginnerProgram`, with buttons firing `Increment` and `Decrement` messages that adjust a numeric counter. A text display shows the current model value and the corresponding Fibonacci number computed via a naive recursive definition. The visualization uses no external graphics library, instead relying on core Elm `Html` elements like `h2`, `button`, and `p` to render the interface and results.

Dynamic Programming

The visualization displays the first 40 Fibonacci numbers as a vertical sequence of text labels, with each number rendered in an SVG text element. It compares classic recursive, memoized recursive, and iterative implementations of the Fibonacci function, logging results to the console. Using D3 v5, the code computes values via `simpleFib` and binds them to SVG text nodes with `svg.selectAll()`. The data comes from the United Nations World Population Prospects 2019, though the visualization itself focuses on algorithmic outputs rather than demographic data.

VVlad Bogo

XQuery Fibonacci

This example computes the 30th Fibonacci number using a recursive XQuery function defined in a separate module. It demonstrates XQuery 3.1’s switch expression and integer arithmetic through the `local:fib` function, which calls itself until it reaches the base cases of 0 and 1. The final result is returned directly without any visualization, showing a pure server-side computation. The source code is stored as a gist by CliffordAnderson.

Fibonacci with pattern matching in Julia

This example demonstrates a pattern-matching–based implementation of the Fibonacci sequence in Julia, showing how the `Match.jl` library's `@match` macro can express recursive function cases inline. The code defines a `fib` function that dispatches on the integer argument, with explicit base cases for 0 and 1 and a recursive fallback case for larger numbers. The example relies on Julia's `typeof` check to constrain inputs to non-negative `Int64` values, then uses `Match.jl`'s pattern syntax (e.g., `0 => 0`, `_ => fib(num-1) + fib(num-2)`) to handle each branch. The rendering is purely computational, with no external data sources or graphical output.