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

100%

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

✓ Published0🌍 Public

Last edited Apr 12, 2016

Created on Apr 12, 2016

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.

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

60% match

Loading thumbnail…

Factorial in Scala

This visualization demonstrates the recursive computation of factorial values in Scala, tracing the call stack from `fac(10)` down to the base case. The code defines a function `fac(num: Int): Int` that multiplies each number by the factorial of its predecessor, halting at 1. The example renders this execution as a branching tree, where each node represents a function call and its return value. The visualization uses Scala’s standard recursion mechanism, with no external libraries; the data is generated directly from the source gist by CliffordAnderson. The rendering approach likely relies on a custom drawing routine, though the code snippet itself only shows the pure function logic, not the display layer.

CCliffordAnderson

58% match

Loading thumbnail…

Gist 63d8bf6ae5ef850809c429573e052edc

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.

HHsuHsiaoHsuan

55% match

Loading thumbnail…

countChange

This example visualizes the recursive computation of `countChange`, a Scala function that counts the number of ways to make change for a given amount using a list of coin denominations. It shows the branching call tree, where each node represents a recursive invocation, and the paths highlight how the algorithm explores combinations of coins. The visualization uses d3.forceSimulation to layout the nodes and edges, with the code from gistfile1.scala driving the structure. The rendering approach maps each recursive call to a visual node, revealing the exponential growth of subproblems.

CColinEberhardt

51% match

Loading thumbnail…

Algorithms 2

This example compares two algorithms for summing integers from 1 to n: a loop-based approach and a direct mathematical formula. The page displays the console output of both functions, `addNumbers` and `addNumbersFormula`, for n=10, showing that both return the same result. The plain HTML body sets a 13em font size, while the JavaScript uses standard `console.log` calls to print the labeled results. The visualization emphasizes algorithmic efficiency by contrasting the loop’s O(n) time complexity against the formula’s constant-time execution.

NNita

51% 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

50% match

Loading thumbnail…

A demonstration of Swift sequences

This example demonstrates Swift sequences by pairing odd and even Fibonacci numbers, then skipping the first two pairs before printing the next two results. The code defines custom Fibonacci sequences, uses the `filter` function to generate separate odd and even number streams, and combines them with `Zip2`. A `skip(n:)` extension on `SequenceOf` filters out leading elements, while `GeneratorOf` lazily produces values. The output logs each generated Fibonacci number and the skipped pairs, showing how sequence composition and lazy evaluation work together in Swift.

CColinEberhardt

50% match

Loading thumbnail…

Computing the amount of beans for the hopper

The visualization computes the number of beans required to fill a hopper based on the desired number of espresso shots, displaying the result as a textual output. It defines a Scala function `bean_counter` that calculates bean amounts using a simple formula: for even shot counts, it multiplies by 20, and for odd counts, it adds an extra 16 beans. The code uses Scala’s integer arithmetic and exception handling to reject negative inputs. No external libraries or rendering APIs are used; the example relies solely on the Scala standard library to produce the computed bean count.

BBBischof

50% match