Sort array of Objects while iteration - JavaScript

Question

I have an array of object that I'm iterating and pushing to a new array.
I also want that the new array will be sorted by a specific value (without using .sort()) Array

arr1 = [
   {name: "three", value: 16}
   {name: "one", value: 2}
   {name: "two", value: 12}
]

Wanted result

arr2 = [
   {name: "one", value: 2},
   {name: "two", value: 12},
   {name" "three", value: 16}
]

tried

arr1.forEach(item => {
if (arr2.length) {
   const lastObj = arr2[arr2.length - 1];
   if (item.value > lastObj.value) {
     arr2.push(item)
   } else {
    arr2.unshift(item)
   }
} else {
 arr2.push(item)
}
})

I would look at sorting algorithms since you only ever look at the first index, not going to work. — epascarello
– epascarello, Commented Apr 13, 2020 at 0:10
Try to clone this array and write a comparator for the new array so this is left untouched. — LearningEveryday
– LearningEveryday, Commented Apr 13, 2020 at 0:28

ariel · Accepted Answer · 2020-04-13 00:26:04Z

1

Comparing to a single value won't work, because the next value could be between the previous elements. Sorting is a very complicated matter and extensively studied by computer science. If you don't want to touch your original array, just clone it before sorting:

arr1 = [
   {name: "three", value: 16},
   {name: "one", value: 2},
   {name: "two", value: 12}
]

arr2 = [...arr1].sort((a, b) => a.value - b.value);
console.log(arr2);

answered Apr 13, 2020 at 0:26

ariel

16.2k13 gold badges65 silver badges75 bronze badges

Sign up to request clarification or add additional context in comments.

Comments

Melchia · Accepted Answer · 2020-04-13 00:40:56Z

1

Just sort the array based on the value

const arr1 = [
   {name: "three", value: 16},
   {name: "one", value: 2},
   {name: "two", value: 12},
];

const output = arr1.sort((a,b) => a.value - b.value);

console.log(output);

answered Apr 13, 2020 at 0:40

Melchia

24.5k23 gold badges110 silver badges130 bronze badges

Comments

Cagri Tacyildiz · Accepted Answer · 2020-04-13 09:31:48Z

merge is a good way to sort without using sort()

arr1 = [
   {name: "three", value: 16},
   {name: "one", value: 2},
   {name: "two", value: 12}
]
console.log(mergeSort(arr1))
function mergeSort(arr)
{
    if (arr.length < 2)
        return arr;

    var middle = parseInt(arr.length / 2);
    var left   = arr.slice(0, middle);
    var right  = arr.slice(middle, arr.length);

    return merge(mergeSort(left), mergeSort(right));
}

function merge(left, right)
{
    var result = [];

    while (left.length && right.length) {
        if (left[0].value <= right[0].value) {
            result.push(left.shift());
        } else {
            result.push(right.shift());
        }
    }

    while (left.length)
        result.push(left.shift());

    while (right.length)
        result.push(right.shift());

    return result;
}

ari3 · Accepted Answer · 2022-05-15 18:40:32Z

0

you can't compare actual value to not defined in sort array value. its crashing everything, your idea.

answered May 15, 2022 at 18:40

ari3

11 bronze badge

Collectives™ on Stack Overflow

Sort array of Objects while iteration - JavaScript

4 Answers 4

Comments

Comments

Comments

Comments

Your Answer

Hot Network Questions

Collectives™ on Stack Overflow

4 Answers 4

Comments

Comments

Comments

Comments

Your Answer

Sign up or log in

Post as a guest

Related