Arranging Array by Nearest Solution

Question

Arranging Array by Nearest Solution

I need help sorting an unsorted array containing calculation results:

const solution = 955

const unsortedArray =
[
  [["solution result cab"],[955.709]],
  [["solution result abc"],[951.11]],
  [["solution result cba"],[954.709]],
  [["solution result bac"],[957.709]]
]

My goal is to sort the array based on the closest deviation from the solution:

[
  [["solution result cab"],[955.709]],
  [["solution result cba"],[954.709]],
  [["solution result bac"],[957.709]],
  [["solution result abc"],[951.11]]
]

Is there a way to implement range comparison in sort(), or is there a more efficient solution?

javascript arrays sorting multidimensional-array

Answer 1

Answer №1

To determine which element is larger based on their absolute differences from the solution, you can create a compare function. If the result is a positive number, the first element is considered bigger, while a negative result indicates that the second element is larger.

function findDifference(a, b) {
  const absDifferenceA = Math.abs(a[1][0] - solution);
  const absDifferenceB = Math.abs(b[1][0] - solution);
  return absDifferenceA - absDifferenceB;
}

After defining this function, you can use

unsortedArray.sort(findDifference)

.

Answer 2

To determine which element is larger based on their absolute differences from the solution, you can create a compare function. If the result is a positive number, the first element is considered bigger, while a negative result indicates that the second element is larger.

function findDifference(a, b) {
  const absDifferenceA = Math.abs(a[1][0] - solution);
  const absDifferenceB = Math.abs(b[1][0] - solution);
  return absDifferenceA - absDifferenceB;
}

After defining this function, you can use

unsortedArray.sort(findDifference)

.

Answer 3

Answer №2

According to the documentation on Array.prototype.sort, a sorting function can be provided as an argument:

const compareDifferenceFrom = (target) => {
  (valA, valB) => Math.abs(valA[1][0] - target) - Math.abs(valB[1][0] - target)
}

unsortedList.sort(compareDifferenceFrom(target))

Answer 4

According to the documentation on Array.prototype.sort, a sorting function can be provided as an argument:

const compareDifferenceFrom = (target) => {
  (valA, valB) => Math.abs(valA[1][0] - target) - Math.abs(valB[1][0] - target)
}

unsortedList.sort(compareDifferenceFrom(target))

Arranging Array by Nearest Solution

Answer №1

Answer №2

Similar questions

Map does not provide zero padding for strings, whereas forEach does

Permission error encountered during Typescript installation

Using Jquery to store input values from within <td> elements in an array

Retain the jQuery dropdown menu in an open state while navigating to a different webpage on the

Effortless method to handle package.json configurations

Modifying an array without altering the reference

How can you use yargs (npm package) to generate an error message when a command is not recognized?

Script in Javascript halting Internet Explorer's operation

Using a foreach loop in PHP to retrieve the elements' index from an array

Combining Json attributes in Jquery Grouping

Header cannot be set once they have already been sent

Close the parent electron window while keeping the child window open

A guide to crafting a fresh WordPress post with the help of the wpapi library for Node.js

best practices for sending multiple requests using node js

Assign the textbox's value to be the earliest selected date from the datepicker

Unpredictable image sorting tool

Having trouble with preventDefault() not working during a keyup event?

Steps for integrating an Angular 2 App into Express.js as a view

Is there a compelling case for implementing Meteor in 2017?

Tips for extracting a value from a currently active list item's anchor tag with JQuery on Mapbox API?