quickselect VS d3.median

100%

quickselect VS d3.median

✓ Published0🌍 Public

Last edited Feb 14, 2017

Created on Feb 14, 2017

This example benchmarks the performance of `d3.median` against the `quickselect` algorithm on a dataset of one million random numbers. A single text element displays the comparison: both methods yield the same result, and quickselect’s runtime is shown as a percentage of d3.median’s. The code uses `d3.range`, `Math.random`, and `performance.now` for timing, with `partialSort` from the `quickselect` library to compute the median and `d3.format` for the percentage output.

AI-generated description

Exploring mourner/quickselect as a faster alternative to compute d3.median()

Note: a better alternative is probably simplestatistics.

See d3 issue #1833.

mit Licensed

Similar vizzes

Loading thumbnail…

simplestatistics.median VS d3.median

This visualization compares the performance of two median algorithms: D3's `d3.median` and the `median` function from the simple-statistics library (aliased as `ss.median`). It generates a dataset of one million random numbers using `d3.range(1000000).map(Math.random)`, times each function with `performance.now()`, and displays a text result in an SVG. The output shows whether the medians match and expresses the simple-statistics time as a percentage (formatted via `d3.format`) of D3's time, revealing the speed difference. The page loads both D3.v4 and simple-statistics 2.2.0 from CDN.

PPhilippe Rivière

79% match

Loading thumbnail…

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.

Mmbostock

63% match

Loading thumbnail…

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.

Mmbostock

62% match

Loading thumbnail…

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.

Mmbostock

61% match

Loading thumbnail…

D3 Example

A horizontal bar chart compares the operations-per-second benchmark results of 10 JavaScript event-emitting libraries, sorted from fastest to slowest. Rendered as static SVG, the visualization uses D3.js (version 3.5.5) for scales, axes, and data binding, and d3-tip for tooltips that display exact values. The data comes from a CSV file. The x-axis uses SI-prefix formatting (replacing G with B), and the visualization is implemented via `d3.scale.linear`, `d3.scale.ordinal`, and `d3.svg.axis`.

CCurran Kelleher

60% match

Loading thumbnail…

Data manipulation workings

This example demonstrates a variety of D3 data manipulation techniques on a small dataset of transaction records. It displays computed statistics such as the minimum, maximum, extent, sum, median, mean, and quantile using d3.min, d3.max, d3.extent, d3.sum, d3.median, d3.mean, and d3.quantile, alongside sorted arrays and a bisect result. The page also experiments with generating synthetic barcode-like data using an exponential distribution and attempts to combine string arrays with timestamped objects via JavaScript’s Array methods and d3.nest, though several of these exploratory operations are commented out or incomplete.

JJimMaltby

59% match

Loading thumbnail…

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.

Mmbostock

59% match

Loading thumbnail…

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.

Mmbostock

58% match