Tersest way to create an array of integers from 1..20 in JavaScript

by

Favorite method

Update Sep13,2015:

Just came up with this new method which works with browsers which support the ES6 standard:

> Array(5).fill().map((x,i)=>i)
[0, 1, 2, 3, 4]

Note the above does a tiny bit of extra work (fills with undefined) but is relatively minor vis-a-vis the speedup you can achieve by using a for loop, and if you forget the .fill you may be confused why your array is mysteriously [empty x 5]. You can encapsulate the above as a custom function, or alternatively use a somewhat more intended method:

> Array.from(Array(5),(x,i)=>i)
[0, 1, 2, 3, 4]

You can of course directly go from that into whatever you want to do, like python’s list comprehensions e.g. [i**2 for i in range(5)]:

> Array.from(Array(5), (_,i)=> i**2)
[0, 1, 4, 9, 16]

… or if you want to get more complicated…:

> Array.from(Array(5), (_,i)=> {
    const R = /*some computation*/;
    return /*etc*/;
});

[edit May,2021]: theoretically tersest way of defining such a function nowadays is f=i=>i?[...f(i-1),i]:[], where you replace f with range1 or whatever the name is, but which would be very slow (quadratic complexity) due to intermediate structures so should never be used. f=i=>i?f(i-1)&&x.push(i)&&x:x=[] is linear complexity but relies on abuse of notation and is unreadable and pollutes global variables as well. But, since defining arrow functions (which don’t bind but rather inherit this) is pretty terse nowadays, you could just wrap the above solution:

const range1 = n=> Array.from(Array(n), (_,i)=> i+i);
// range1(5)==[1, 2, 3, 4, 5]

Circumstantially, the tersest way to do a range(N), if you already have a list lying around of exactly that length N, is just to map it: e.g. rather than do Array.from(Array(myArr.length), (_,i)=> i**2), you would just do myArr.map((_,i)=> i**2). (This has no side-effect unless you want it to.)

everything below is historical:

After thinking about it a bit, this is the shortest implementation of the standard range(N) function in JavaScript I could come up with:

function range1(i){return i?range1(i-1).concat(i):[]}

Note: Do not use this in production; it’s O(N^2)

Contrast with current top-voted answer:

function range1(i){var x=[];var i=1;while(x.push(i++)<i){};return x}

Example:

> range1(5)
[1, 2, 3, 4, 5]

This is like the poster child for recursion, though I was expecting it to be longer until I thought of ternary-if-statement, which brings it down to 42 necessary characters.

Note that the “standard” range function returning [start,end) can be written by doing .concat(i-1).

Update: Ooh, I discovered an incredibly short version with ugly imperative syntax by abusing for loops, reverse-ordering, the fact that assignments return a value: for(y=[],i=20;y[--i]=i;){} consisting of only 25 characters (though you will want var y which you can insert into a for loop, and +1 if you don’t want 0…19). While it is not shorter if you need to define a function, it is shorter than i?r(i-1).concat(i):[] if you do not need to make a function.

Added some performance profiling testcases: it seems that everything besides a standard in-order for-loop is 10x slower, at least on V8. https://jsperf.com/array-range-in-javascript
(Of course, none of this matters if you’re programming in a functional style anyway and would hit every element with a function call anyway.)

More Related Contents:

  1. Is there a better way to convert negative numbers to positive in JavaScript? [duplicate]
  2. Cartesian product of multiple arrays in JavaScript
  3. Fastest way to flatten / un-flatten nested JSON objects
  4. Javascript Array.sort implementation?
  5. Fast stable sorting algorithm implementation in javascript
  6. How does this recursion work?
  7. Improving performance of click detection on a staggered column isometric grid
  8. Is it possible to get all arguments of a function as single object inside that function?
  9. How do I sort an array of objects based on the ordering of another array?
  10. Efficient way to insert a number into a sorted array of numbers?
  11. Recursively print all permutations of a string (Javascript)
  12. Where is my implementation of rot13 in JavaScript going wrong?
  13. Bresenham algorithm in Javascript
  14. Javascript algorithm to find elements in array that are not in another array
  15. Permutations without recursive function call
  16. How to wrap part of a text in a node with JavaScript
  17. Sorting Array with JavaScript reduce function
  18. Find difference between two strings in JavaScript
  19. Sieve of Eratosthenes algorithm in JavaScript running endless for large number
  20. Remove duplicate objects from an array using javascript
  21. Big O of JavaScript arrays
  22. Get the item that appears the most times in an array
  23. Optimized merge sort faster than quicksort
  24. Compare Strings Javascript Return %of Likely
  25. Combine json arrays by key, javascript
  26. JavaScript Math.random Normal distribution (Gaussian bell curve)?
  27. Number.sign() in javascript
  28. Diamond-square algorithm not working (rewrite code from JS to JAVA)
  29. Using an imported module inside Google App Script
  30. Algorithm of JavaScript “sort()” Function

Leave a Comment