Skip to main content
SimilarExport ZIP
100%

Gist 63d8bf6ae5ef850809c429573e052edc

✓ Published0🌍 Public
HHsuHsiaoHsuan
Last edited Aug 12, 2018
Created on Aug 12, 2018

This example demonstrates the computation of the 8181st Fibonacci number using an iterative method with Java’s `BigDecimal` class to handle arbitrarily large integer results. The code defines two functions: a naive recursive version that would be impractical for large inputs, and an optimized iterative loop that builds the sequence by adding the previous two values. The main method prints the final result for 8181, showcasing how `BigDecimal` enables precise arithmetic beyond standard primitive type limits.

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
63% 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
60% 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
60% match
Loading thumbnail…

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.

CCliffordAnderson
56% 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
56% match
Loading thumbnail…

I like this example of grabbing elements from a List until you reach your desired sum.

This example demonstrates a functional approach to accumulating values from a numeric sequence, stopping once the running total exceeds 100. The code constructs a range of integers from 1 to 10,000 using Scala’s `1 to 10000` collection, then applies `takeWhile` with a closure that mutates an external `var sum`. The predicate adds each element to `sum` and tests the condition `sum <= 100`, effectively yielding the shortest prefix whose cumulative sum is just under the target. The visualization likely shows the resulting list and the final sum, highlighting how `takeWhile` short-circuits iteration without materializing the full sequence.

BBBischof
55% match
Loading thumbnail…

Gist 718a9dfea4f5678607c3

This example shows the number of ways to reach a target integer (40) by adding fixed step sizes of 2, 3, 6, 7, or 8, where negative values contribute zero and zero contributes one. The code defines a recursive function `furtburl` and wraps it with a custom `memoize` decorator that caches results by argument tuple, avoiding redundant re-computation. It uses plain Python with a dictionary cache and function decoration, then calls `furtburl(40)` to compute the count. The visualization displays the resulting integer value, though no graphical library or rendering is involved.

BBBischof
55% 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
54% match