Gist 3d2406a594700ec447ebd0b208ead916

100%

Gist 3d2406a594700ec447ebd0b208ead916

✓ Published0🌍 Public

Last edited Jun 18, 2018

Created on Jun 24, 2016

This example demonstrates a JavaScript implementation of the Fisher–Yates shuffle algorithm, providing two distinct array manipulation methods. The `shuffle()` function returns a new, shuffled copy of the original array without modifying it, while `permShuffle()` permanently rearranges the elements in place. The code extends the native `Array.prototype` with these custom methods, using modern JavaScript syntax including spread operators and destructuring assignments for element swapping. A usage example with a five-element array illustrates both behaviors, showing the original array preserved after copying and altered after permanent shuffling. The implementation relies solely on core JavaScript array operations and the built-in `Math.random()` function.

AI-generated description

Similar vizzes

Loading thumbnail…

Array method

This example demonstrates a JavaScript array-shuffling algorithm. It creates an array containing the numbers 1 through 90, then randomizes the order of those elements using the Fisher–Yates shuffle technique. The shuffled array is output to the browser’s console via `console.log`. The page uses no external libraries; it relies solely on vanilla JavaScript and the native `Math.random` function for randomness. The code is embedded directly in a minimal HTML file and executes on page load, with commented-out variations showing alternate array sizes.

EErik L

77% match

Loading thumbnail…

The Fisher–Yates shuffle is an algorithm for generating a random permutation of a finite set—in plain terms, the algorithm shuffles the set. The algorithm effectively puts all the elements into a hat; it continually determines the next element by randomly drawing an element from the hat until no elements remain. The algorithm produces an unbiased permutation: every permutation is equally likely. The modern version of the algorithm is efficient: it takes time proportional to the number of items being shuffled and shuffles them in place https://en.wikipedia.org/wiki/Fisher%E2%80%93Yates_shuffle

This visualization demonstrates the Fisher–Yates shuffle algorithm by animating its in-place swapping process across a list of numeric values. It shows how each iteration randomly selects an unshuffled position and exchanges it with the current index, progressively building a random permutation. The implementation uses a custom `swap` function built from Power Query’s `List.Range` and `List.Buffer` operations, with `Number.RandomBetween` driving the random selection. The code, written in the M language, relies on `List.Accumulate` to iterate through the list, highlighting the algorithm’s efficiency and unbiased nature without external libraries.

HHugoberry

72% match

Loading thumbnail…

Shuffle I

A Fisher–Yates shuffle is animated as 200 vertical line segments, each rotating to illustrate the random swapping of array positions. The visualization uses D3.js v3 with SVG and a transition system that chains animations step-by-step, reversing the shuffle steps to trace the algorithm’s progression. The `d3.scale.ordinal` and `d3.scale.linear` maps data indices to x-coordinates and rotation angles, while the `shuffle` function generates swap pairs for the animation sequence.

Mmbostock

71% match

Loading thumbnail…

Shuffle II

An array of 200 vertical lines rotates in place to visualize a Fisher–Yates shuffle, with shuffled elements rendered in black while unshuffled ones stay light gray. The animation plays the swap sequence in reverse, shuffling the array from a fully shuffled state back to its original order. Built with D3 v3, it uses ordinal and linear scales, SVG line elements, and chained transitions to update each line’s rotation transform after every swap. The shuffle function generates random pairwise swaps, and the code references DOM nodes directly to swap their positions efficiently.

Mmbostock

71% match

Loading thumbnail…

Gist 7e0901a05c7628a8da57d24617231ce0

This example demonstrates a manual JavaScript algorithm for rotating the elements of an array-like object, shifting the last item to the front while moving each preceding item one position backward. It uses no external libraries, relying on native object property access and assignment via `Object.keys()` and array index notation. The code defines a hardcoded sequence of four swap operations, storing the final value in a temporary `aux` variable to preserve it during reassignment, then logs the updated object to the console after each call. The data originates from an `images` object with an unspecified number of keys, though the logic assumes at least four properties to function correctly.

MMistyBlunch

70% match

Loading thumbnail…

random array Html

This example demonstrates a randomly shuffled array of numbers from 1 to 90 displayed as a vertical list of individual paragraph elements. The code first builds the array, then applies the Fisher-Yates shuffle algorithm using JavaScript’s `Math.random()` to permute the order. Each resulting number is rendered into a `<p>` element via the DOM API `document.createElement` and appended to a container. The page uses no external libraries, relying solely on vanilla HTML, CSS, and JavaScript within a single `index.html` file.

EErik L

65% match

Loading thumbnail…

Gist dc33dbae2a8fee3d6c026c07e216dc5a

This example shows a JavaScript function called `copyMachine` that duplicates an array’s contents a given number of times. The code uses a `while` loop and the spread operator `[...arr]` to append copies of the original array to itself, then stores the result in `newArr`. It demonstrates array mutation and reassignment within a loop, logging the final duplicated array to the console via `console.log`. The function handles a numeric `num` parameter, decrementing it until the loop ends, and returns the expanded array. No external libraries or visualization APIs are used; it is plain JavaScript array manipulation.

MMistyBlunch

63% match

Loading thumbnail…

JavaScript Arrays

This example demonstrates the fundamental array methods in JavaScript, including `range`, `filter`, `map`, `sort`, `forEach`, and `reduce`. The code uses D3 v6’s `ascending` and `decending` imports to properly sort arrays, while also showcasing custom comparator functions. It works with a simple generated range of numbers and a small dataset of key-value entries, logging results to the console. The page renders only the static title “JavaScript Arrays” with no visual output, focusing entirely on algorithmic array manipulation.

AAndre J Denais

63% match