Gist 7e0901a05c7628a8da57d24617231ce0

100%

Gist 7e0901a05c7628a8da57d24617231ce0

✓ Published0🌍 Public

Last edited Sep 17, 2019

Created on Sep 17, 2019

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.

AI-generated description

Similar vizzes

Loading thumbnail…

Gist 3d2406a594700ec447ebd0b208ead916

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.

MMAKIO135

70% match

Loading thumbnail…

Gist 95bc6a1fc08d5057b64b1b1dc24c211e

This example demonstrates a JavaScript array manipulation that generates all possible single-step neighbors for a four-digit lock combination. It creates two variations for each digit: one decrementing the value (with 0 wrapping to 9) and one incrementing it (with 9 wrapping to 0), storing all eight resulting arrays in a `neighbors` list. The code uses standard JavaScript array methods like `forEach` and `slice`, along with a ternary operator for edge-case wrapping, to construct the neighbor variations. The output, logged via `console.log`, shows a matrix of four-element arrays representing every adjacent combination state.

GGugaGongadze

64% match

Loading thumbnail…

JavaScript Arrays

This example demonstrates fundamental JavaScript array operations, including mapping, reducing, and sorting, using a custom `range` function and a collection of key-value objects. The code logs a sorted version of the entries array to the console, ordering objects by their `key` property in ascending alphabetical order. It also includes commented-out examples of `map`, `reduce`, and object construction, showcasing how to transform data and aggregate values. The example relies on native JavaScript array methods and imports `ascending` from the D3 library (v7.8.5), though the primary operations use built-in functionality rather than D3-specific utilities.

Nnim@brejnholt.dk

64% match

Loading thumbnail…

javascript arrays

This example demonstrates how to manipulate JavaScript arrays, focusing on generating a range of numbers, filtering, mapping, and reducing, with sorting handled by comparing object keys. The visualization shows the process of creating an array using a custom `range` function and then sorting an array of entries alphabetically by their `key` property using a comparison function. The code uses built-in JavaScript array methods like `push`, `sort`, and `map`, and references the D3 library's `ascending` function for sorting. The output is logged to the console, showing the sorted entries.

GGullyPlook

64% match

Loading thumbnail…

Sample problems: objects and arrays

This example presents five JavaScript practice problems focused on manipulating objects and arrays, with output intended for the browser’s developer console rather than SVG or other visual rendering. The code demonstrates basic data operations such as merging object properties by matching names, finding common elements between arrays using nested loops and the `includes` method, sorting an array of state objects by population, and using a loop with the modulus operator to filter numbers. It relies on vanilla JavaScript for most tasks and uses the D3 v4 library’s `d3.range` function to generate a sequence of integers from 1 to 10.

CCraftbd

63% 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 Array

This example demonstrates JavaScript array operations, focusing on how to create and manipulate arrays in the browser console. The code defines a `range` function that generates an array of numbers from 0 to 4, then applies various array methods including `forEach`, `filter`, and `sort`. The final visible output shows how `.sort()` combined with `.reverse()` reorders the array `[0, 9, 1, 84, 23, 6]`, logging the reversed sorted result to the console. The visualization uses a large text message to display the result, with the logic implemented through raw JavaScript array prototypes rather than any external libraries.

Ddalia.miliauskaite@me.com

63% match

Loading thumbnail…

quickSort.js

This example visualizes the recursive quicksort algorithm sorting a small numeric array, showing the step-by-step partition process and final sorted order. The code defines a `quickSort` function that selects a pivot from the middle of the array, uses two pointers to swap elements out of place, and recursively sorts the subarrays on either side. It demonstrates the algorithm’s logic directly in JavaScript with console output, using no external libraries. The rendering approach is textual, logging the unsorted and sorted arrays to the console, while the source data is a hardcoded array `[7, 0, 2, 1, 9, 2]`. The example highlights the algorithm’s core mechanics rather than a graphical chart.

WWill Carter

63% match