Sort method in javascript

JavaScript Array sort()

The sort() sorts the elements of an array. The sort() overwrites the original array. The sort() sorts the elements as strings in alphabetical and ascending order.

See Also:

Sort Compare Function

Sorting alphabetically works well for strings («Apple» comes before «Banana»). But, sorting numbers can produce incorrect results. «25» is bigger than «100», because «2» is bigger than «1». You can fix this by providing a «compare function» (See examples below).

Syntax

Parameters

When sort() compares two values, it sends the values to the compare function, and sorts the values according to the returned (negative, zero, positive) value.

The sort function will sort 40 as a value lower than 100.

When comparing 40 and 100, sort() calls the function(40,100).

The function calculates 40-100, and returns -60 (a negative value).

Return Value

More Examples

Sort numbers in ascending order:

Sort numbers in descending order:

const points = [40, 100, 1, 5, 25, 10];

// Sort the numbers in ascending order
points.sort(function(a, b));

const points = [40, 100, 1, 5, 25, 10];

// Sort the numbers in descending order:
points.sort(function(a, b));

const points = [40, 100, 1, 5, 25, 10];

// Sort the numbers in ascending order:
points.sort(function(a, b));

let highest = points[points.length-1];

Related Pages:

Browser Support

sort() is an ECMAScript1 (ES1) feature.

ES1 (JavaScript 1997) is fully supported in all browsers:

Chrome	Edge	Firefox	Safari	Opera	IE
Yes	Yes	Yes	Yes	Yes	Yes

Источник

JavaScript Sorting Arrays

The reverse() method reverses the elements in an array.

You can use it to sort an array in descending order:

Example

Numeric Sort

By default, the sort() function sorts values as strings.

This works well for strings («Apple» comes before «Banana»).

However, if numbers are sorted as strings, «25» is bigger than «100», because «2» is bigger than «1».

Because of this, the sort() method will produce incorrect result when sorting numbers.

You can fix this by providing a compare function:

Example

Use the same trick to sort an array descending:

Example

The Compare Function

The purpose of the compare function is to define an alternative sort order.

The compare function should return a negative, zero, or positive value, depending on the arguments:

When the sort() function compares two values, it sends the values to the compare function, and sorts the values according to the returned (negative, zero, positive) value.

If the result is negative, a is sorted before b .

If the result is positive, b is sorted before a .

If the result is 0, no changes are done with the sort order of the two values.

The compare function compares all the values in the array, two values at a time (a, b) .

When comparing 40 and 100, the sort() method calls the compare function(40, 100).

The function calculates 40 — 100 (a — b) , and since the result is negative (-60), the sort function will sort 40 as a value lower than 100.

You can use this code snippet to experiment with numerically and alphabetically sorting:

const points = [40, 100, 1, 5, 25, 10];
document.getElementById(«demo»).innerHTML = points;

function myFunction1() points.sort();
document.getElementById(«demo»).innerHTML = points;
>

function myFunction2() points.sort(function(a, b));
document.getElementById(«demo»).innerHTML = points;
>

Sorting an Array in Random Order

Example

The Fisher Yates Method

The above example, array.sort(), is not accurate. It will favor some numbers over the others.

The most popular correct method, is called the Fisher Yates shuffle, and was introduced in data science as early as 1938!

In JavaScript the method can be translated to this:

Example

const points = [40, 100, 1, 5, 25, 10];

for (let i = points.length -1; i > 0; i—) let j = Math.floor(Math.random() * (i+1));
let k = points[i];
points[i] = points[j];
points[j] = k;
>

Find the Highest (or Lowest) Array Value

There are no built-in functions for finding the max or min value in an array.

However, after you have sorted an array, you can use the index to obtain the highest and lowest values.

Example

const points = [40, 100, 1, 5, 25, 10];
points.sort(function(a, b));
// now points[0] contains the lowest value
// and points[points.length-1] contains the highest value

Example

const points = [40, 100, 1, 5, 25, 10];
points.sort(function(a, b));
// now points[0] contains the highest value
// and points[points.length-1] contains the lowest value

Sorting a whole array is a very inefficient method if you only want to find the highest (or lowest) value.

Using Math.max() on an Array

You can use Math.max.apply to find the highest number in an array:

Example

Math.max.apply(null, [1, 2, 3]) is equivalent to Math.max(1, 2, 3) .

Using Math.min() on an Array

You can use Math.min.apply to find the lowest number in an array:

Example

Math.min.apply(null, [1, 2, 3]) is equivalent to Math.min(1, 2, 3) .

My Min / Max JavaScript Methods

The fastest solution is to use a «home made» method.

This function loops through an array comparing each value with the highest value found:

Example (Find Max)

function myArrayMax(arr) <
let len = arr.length;
let max = -Infinity;
while (len—) <
if (arr[len] > max) <
max = arr[len];
>
>
return max;
>

This function loops through an array comparing each value with the lowest value found:

Example (Find Min)

function myArrayMin(arr) <
let len = arr.length;
let min = Infinity;
while (len—) <
if (arr[len] < min) <
min = arr[len];
>
>
return min;
>

Sorting Object Arrays

JavaScript arrays often contain objects:

Example

Even if objects have properties of different data types, the sort() method can be used to sort the array.

The solution is to write a compare function to compare the property values:

Example

Comparing string properties is a little more complex:

Example

cars.sort(function(a, b) <
let x = a.type.toLowerCase();
let y = b.type.toLowerCase();
if (x < y)
if (x > y)
return 0;
>);

Stable Array sort()

ES2019 revised the Array sort() method.

Before 2019, the specification allowed unstable sorting algorithms such as QuickSort.

After ES2019, browsers must use a stable sorting algorithm:

When sorting elements on a value, the elements must keep their relative position to other elements with the same value.

Example

In the example above, when sorting on price, the result is not allowed to come out with the names in an other relative position like this:

Complete Array Reference

For a complete Array reference, go to our:

The reference contains descriptions and examples of all Array properties and methods.

Источник