Gist 810577150f4b252e8faa69e7060bf3af

Quicksort

The visualizer shows the Quicksort algorithm sorting a shuffled array of 240 items as a fan of lines, with the current pivot highlighted in red. Each step is animated via a timer, swapping line positions to reflect array changes. The code uses d3.v3 with a linear scale for angular displacement and an ordinal scale for horizontal positioning, rendering SVG lines and driving the animation through `setInterval`. The data is generated by a Fisher–Yates shuffle and processed through the quicksort function.

65% match

Quicksort VI

An animated quicksort network visualizes the sorting process of 100 shuffled values, with time progressing on the vertical axis and each swap rendered as a colored path. The value-to-color mapping uses a cubehelix color scale. The animation is drawn on a Canvas via `d3.transition` and custom tweening, while a precomputed list of swaps drives the sequence. Pressing the Alt key slows the animation. The implementation uses d3.v3, including ordinal and linear scales, and a custom `quicksort` function to generate swap pairs.

Mergesort I

The visualization animates the mergesort algorithm on 200 randomly shuffled values. Each value is rendered as a short line segment whose vertical position indicates the current working array and whose rotation reflects its numeric value, creating a dynamic, swirling pattern. The animation uses d3.v3, specifically `d3.transition` to sequence copy and swap actions, while `d3.scale.ordinal` and `d3.scale.linear` map indices, array positions, and values to visual attributes. The SVG lines update their `transform` attributes via `transition.attr("transform", transform)`, demonstrating the sorting process step-by-step.

Quicksort IV

The visualization animates the quicksort algorithm on 200 shuffled values, rendering each value as a rotated vertical line whose angle reflects its magnitude. A red line marks the active pivot, while black lines indicate the current partition and gray lines show inactive regions. Using D3.js v3 and SVG, the animation replays recorded swap and partition actions in reverse order, updating line positions and classes via `d3.transition`. The code generates the action log by recursively partitioning the array, then drives the playback through chained transition callbacks.

Quicksort I

A visualization of the quicksort algorithm shows each row as a snapshot of the array before a partition operation, with lines rotated to represent values. Orange lines indicate left-side elements greater than the pivot that need moving right, while green lines show right-side elements less than the pivot needing movement left. Built with D3 v3, it renders 200 shuffled numbers as SVG lines across multiple rows, each animated on mouseover to display values relative to the pivot using ordinal and linear scales, and uses the `quicksort` function to generate partition states.

Quicksort V

A visualization of quicksort on 100 elements, where each horizontal row represents the array state after a single swap and colored lines trace each element’s positional movement through the sorting process. The code uses d3.v3 with custom SVG path interpolators to render the straight and diagonal segments, and a cubehelix color scale to differentiate elements. Randomly shuffled data is generated with `d3.shuffle` and `d3.range`, and the quicksort algorithm is implemented manually to record swap operations.

63% match

Sequential Sort in Snap!

This example demonstrates a sequential sort algorithm implemented in Snap!, a block-based programming environment. The code defines a reporter block that repeatedly scans an unsorted list to find the largest remaining item, inserts it at the front of a new sorted list, and deletes it from the original. The visualization shows the step-by-step process of building the sorted list. The implementation uses Snap! custom blocks, list operations like `reportListLength`, `reportListItem`, `doInsertInList`, and `doDeleteFromList`, along with nested loops and conditional logic. No external JavaScript libraries are used; the data source is the input list provided by the user.

CCliffordAnderson

63% match

Quicksort II

This visualization shows every recursive step of quicksort on a shuffled array of 200 numbers, with each row representing the array state before recursing into a partition. Red lines mark the chosen pivots, while gray lines indicate inactive elements. The code uses d3.v3 with SVG rendering, employing ordinal and linear scales to map array positions and rotated line marks. The quicksort algorithm is implemented in JavaScript, generating the level data and pivot metadata for each state.