Sorting an array by which value is closest to 1

Question

I need to sort an array of values.

var arr = [0.3, 0.76, 0.98, 1.12, 1.36, 1.9];

by which value is closest to 1, which would (in the above example) result in:

[0.98, 1.12, 0.76, 1.36, 0.3, 1.9];

I know that by using a custom sort function.

arr.sort(function(a, b){
    return b - a;
});

i can take control of how sort() works, however, i do not understand how i would design that custom function so that it would work in the desired way.

Perhaps someone can enlighten me.

Answer 1

Just check their distance from 1.

arr.sort(function(a, b){
    return Math.abs(1-a) - Math.abs(1-b);
});

Just to elaborate, it calculates the distance of two numbers from 1, i.e. for

• a=-10 and b=4, the distances are 11 and 3 respectively. The function returns a positive number, so 4 comes before -10 in the sorted array.
• For a=-1 and b=4, the distances would be 2 and 3, the function returns a negative number so -1 comes before 4 in the array.

As requested in the comments, the below adaptation would give preference to values below 1.

arr.sort(function(a, b){
    if(a<1 && b>=1){return -1;}
    if(a>=1 && b<1){return 1;}
    return (Math.abs(1-a) - Math.abs(1-b));
});