countChange

100%

✓ Published0🌍 Public

Last edited Dec 1, 2014

Created on Dec 1, 2014

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.

AI-generated description

Similar vizzes

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

63% match

Loading thumbnail…

fractal

This interactive SVG visualization generates a branching tree fractal composed of circles. Mouse position controls the number of recursive iterations (left-right) and the branch angle (up-down). The code builds a fractal structure recursively, then renders it by updating SVG `<circle>` elements using D3 v4’s selectors and data-merging API. A text element displays the live count of circle elements, illustrating how animation lag increases with element count. The example highlights the performance limits of SVG rendering at scale.

CCurran Kelleher

60% match

Loading thumbnail…

Gist ee5686347047ba8685a25aaa85169791

This visualization tracks the cumulative frequency of a list of integer adjustments, showing the running total as it evolves through the sequence. It uses D3.js to render a line chart on an SVG canvas, with the x-axis representing the step number and the y-axis the accumulated sum. The data comes from a plain-text file of frequency changes, reminiscent of the Advent of Code challenge. The implementation likely employs `d3.scaleLinear` and `d3.line` to map the data points and draw the path, with axes generated via `d3.axisBottom` and `d3.axisLeft`.

BBBischof

60% match

Loading thumbnail…

Advent of Code

This visualization demonstrates the redistribution of memory blocks in the "Advent of Code" Day 6 challenge, tracking how many redistribution cycles occur before a state repeats. The code uses XQuery 3.1 with recursive functions `local:zero-out-highest` and `local:add-blocks` to reallocate blocks from the highest-value bank across the array, while `local:calculate-state` records each state as a hyphen-separated string and stops when a duplicate state appears. The data source is a hardcoded sequence of 16 integers representing the initial memory banks, and the output is the integer count of iterations performed until repetition, rendered as plain text. No external visualization libraries are used; the example focuses purely on algorithmic state computation.

CCliffordAnderson

58% match

Loading thumbnail…

fractal

A procedural tree fractal animates in real time as the mouse position dictates both branch angle and recursion depth. The visualization displays up to thousands of overlapping, randomly colored circles, with an on-screen counter revealing the exact number of SVG elements being rendered. Built with D3 v4, the `fractal()` function recursively computes circle positions while the `mousemove` event triggers a full redraw. This interactive example visually demonstrates how SVG rendering performance degrades as element counts increase, making the lag tangible to the user.

CCurran Kelleher

58% match

Loading thumbnail…

fractal

This example shows an interactive tree fractal that branches recursively into hundreds of thousands of circles, with the mouse position controlling the number of branches and their angle. The visualization responds to mouse movement by recalculating the fractal structure and re-rendering the SVG circles. The code uses D3 v4’s `selectAll` and `data` binding with an enter/merge pattern, but omits the `exit()` call, leaving obsolete circles in the DOM. Rendering relies on SVG `circle` elements positioned via `cx`, `cy`, and `r` attributes.

CCurran Kelleher

58% match

Loading thumbnail…

Fork of Fork of array to tree

This example converts a shuffled array of numbers into a hierarchical tree visualization. Using d3.stratify to structure the data and d3.tree to compute node positions, it renders red-stroked circles connected by black paths in an SVG. Each circle displays its corresponding array value as text, with a staggered transition duration that varies by tree depth, animating the label appearance. The visualization updates in place, removing and re-adding elements as new arrays are generated.

Sspandhanabadekol

57% match

Loading thumbnail…

Counter

A counter app shows a large numeric count that increases or decreases via two buttons, styled with large typography and a simple layout. It demonstrates the d3-component library for defining reusable components like `countDisplay`, `buttonPanel`, and `button`, while managing state with Redux. The top-level `app` component composes these pieces, and renders update on store subscriptions. The example bridges D3 v4's component pattern with Redux's reducer and dispatch flow.

CCurran Kelleher

57% match