Fibonacci with pattern matching in Julia

100%

Fibonacci with pattern matching in Julia

✓ Published0🌍 Public

Last edited Feb 27, 2017

Created on Feb 16, 2017

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.

AI-generated description

Similar vizzes

Loading thumbnail…

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.

CCliffordAnderson

77% match

Loading thumbnail…

Example of Fib

This example contrasts two XQuery 3.1 implementations of the Fibonacci sequence, both computing the 30th term. The first defines a recursive function with a `switch` statement, while the second uses tail recursion with accumulator parameters. Each script uses the `declare function` syntax to expose `local:fib`, returning an `xs:integer` sequence. The example highlights alternative recursion strategies in XQuery, showing how the same mathematical result can be produced through different control-flow patterns without external libraries or visualizations.

CCliffordAnderson

68% match

Loading thumbnail…

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.

CCliffordAnderson

66% match

Loading thumbnail…

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.

CCliffordAnderson

64% match

Loading thumbnail…

Fibonacci w/continuations

This example shows a recursive implementation of the Fibonacci sequence using continuation-passing style (CPS) in MarkLogic’s XQuery dialect. It computes Fibonacci numbers up to 30 by passing a continuation function that receives the intermediate result, allowing tail-call optimization without stack growth. The code relies on MarkLogic’s `map` API (e.g., `map:contains`, `map:get`, `map:put`) to memoize previously calculated values, with the initial memo seeded as `{1:1, 2:1}`. The final continuation returns the computed value, demonstrating how CPS can express non-tail-recursive algorithms as chains of function calls.

CCliffordAnderson

62% match

Loading thumbnail…

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.

CCliffordAnderson

60% match

Loading thumbnail…

requirebin sketch

This example uses the typed-function library to define a recursive Fibonacci sequence generator, mapping numeric types `zero`, `one`, and `any` to specific function signatures. The code creates a `fib` function that dispatches based on argument type, then writes the first 20 Fibonacci numbers into the page body via `document.body.innerHTML`. The visualization is minimal, displaying the computed sequence as plain text. The sketch demonstrates typed function dispatch and recursion, with the source bundled through RequireBin and rendered directly in the browser.

HHypercubed

59% match

Loading thumbnail…

requirebin sketch

This example uses the `typed-function` library to define a polymorphic `fib` function with custom types for zero and one, then logs the first 20 Fibonacci numbers. The code adds type tests for exact numeric values and dispatches based on argument type, demonstrating dynamic function overloading in JavaScript. The output is generated by the Node.js `console.log` call, producing the sequence in the browser console via RequireBin.

HHypercubed

58% match