Flatten an array in Javascript without recursion

100%

Flatten an array in Javascript without recursion

✓ Published0🌍 Public

Last edited Apr 21, 2016

Created on Apr 21, 2016

This example compares two JavaScript functions for flattening nested arrays, showing that the iterative approach is faster than the recursive one. The code uses the Benchmark.js library to time both methods on a nested array of integers, with the suite reporting each function’s operations per second. The recursive version, `flattenRecursive`, relies on `concat` and `forEach`, while the iterative `flatten` uses a `while` loop with `shift` to mutate the list in place. The output, logged via `console.log`, highlights the fastest method, demonstrating the performance trade-off between recursion and iteration.

AI-generated description

Similar vizzes

Loading thumbnail…

flatten Arrays

This example visualizes the recursive flattening of nested arrays into a single linear sequence. It shows a branching tree of values collapsing inward as the algorithm traverses each level, with individual elements animating into a final horizontal row. The code uses a custom `flatten` function that recursively iterates through nested arrays and pushes non-array values into a result array. Rendering relies on D3’s force simulation to position the collapsing nodes and transition paths, while the data itself is generated from arbitrary nested array structures defined in the source gist.

MMAKIO135

69% match

Loading thumbnail…

PowerArray vs....

This example benchmarks the `forEach` method across multiple JavaScript libraries—native `Array.prototype.forEach`, `fast.js`, `underscore`, and `lodash`—applied to three data types: plain arrays, `Float32Array`, and a custom `PowerArray` class. It shows that native `forEach` on a plain array is the baseline, while `fast.js` and `underscore` achieve similar or better throughput on arrays, with `powerArray.forEach` leading all variants. The code uses `process.hrtime()` for high-resolution timing and computes operations per second from a 10-million-element dataset. Results highlight that typed arrays (`Float32Array`) generally slow down iteration, except with `lodash` and `underscore`, which still lag behind array-based calls.

HHypercubed

62% match

Loading thumbnail…

Freecodecamp

This example visualizes the process of refactoring a JavaScript function that returns the largest number from each sub-array in a nested array. It shows three successive code versions—using `Math.max.apply`, the spread operator with `Math.max(...arr[i])`, and a manual nested loop—to achieve the same result. The code relies on standard JavaScript array methods and the `Math.max` API, with no external libraries. The visualization likely renders the code side-by-side or as a sequence, highlighting syntax differences and algorithmic approaches. The data source is the hardcoded sample array passed to each function call, demonstrating how the output remains identical across implementations.

EEelsie

60% match

Loading thumbnail…

PowerArray benchmarks

This visualization benchmarks the performance of different `forEach` implementations across arrays and typed arrays, showing that native methods on standard arrays are slower than optimized libraries like lodash, underscore, and fast.js, while PowerArray’s custom method rivals them. The bar chart compares operations per second (ops/sec) for each tested scenario, sourced from a benchmark suite generated by Node.js’s `Benchmark` module. The code uses `Benchmark.Suite` to run trials on plain arrays, `Uint16Array`, and PowerArray instances, with libraries like `fast.js`, `underscore`, `lodash`, and native `Array.prototype.forEach` called directly or via `.call`. Data comes from the gist’s `Results.txt` output, and the visualization likely plots these numeric results to highlight performance gaps.

HHypercubed

59% match

Loading thumbnail…

Gist 71504fe8a72f82b34a64b5586bf0a67f

This example demonstrates a nested-loop algorithm for removing duplicate values from an array, highlighting the logic behind the process. The code defines `removeDuplicatesNested`, which compares each element against every other element using a nested `for` loop, tracking potential matches with a `duplicateFound` flag. It pushes non-duplicate items into a new `returnArray`, though the inner loop’s condition incorrectly checks `returnArray` instead of the original `array`, leading to flawed duplicate detection. The implementation relies solely on standard JavaScript array methods and loops, with no external libraries or rendering APIs. The data source is the input array passed directly to the function, and the visualization focuses on the control flow and comparison steps rather than graphical output.

WWill Carter

59% 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

59% match

Loading thumbnail…

Gist c0ec6bb768fd2672307b0807e4ee46fb

This example benchmarks four JavaScript loop styles—a standard `for` loop, a reversed `for` loop, a `for…of` loop, and `forEach`—on a fixed array of ten numbers. It measures execution time by repeating each loop a thousand times via `performance.now()` timestamps, accumulating the total milliseconds. The code defines each loop as a separate function and calls them through a `test` helper, logging the sum to the console. The comparison uses a simple in-memory data array, with no external libraries, focusing on raw loop performance in a JavaScript environment.

MMAKIO135

59% match

Loading thumbnail…

JavaScript Arrays - Javan

This example demonstrates JavaScript array manipulation through a console-based sequence of operations. It shows how arrays can be built with `push()`, generated with a custom `range` function that returns a new array, and transformed using `map()` to multiply each element, and reduced with `reduce()` to sum all values. The code also illustrates converting an array of key-value objects into a single object by reducing with an accumulator. All output is logged to the browser console rather than rendered visually.

JJavan Friedel

58% match