How to set the elements of an array according to a certain rule
Imagine we have array like this:
const words = ['luigi', 'Bar', 'Test', 'zac1', 'Alf0'];
Now I would like to sort this array alphabetically:
words.sort((a, b) => a.localeCompare(b));
Imagine we have array of super words. This words have high priority and should be on the top of 'words list'.
const superWords = ["zac1", "Test"]
So the desired result of words array will be:
const desiredResult = ["Test", "zac1","Alf0", "Bar", "luigi"]
How can I do it?
4 answers
-
answered 2022-05-04 10:14
Aneesh
This could help. You can click on 'Run code snippet' to see output:
const superWords = ['zac1', 'Test']; const words = ['luigi', 'Bar', 'Test', 'zac1', 'Alf0']; const desiredResult = superWords.sort((a, b) => a.localeCompare(b)); desiredResult.push( ...words .filter((word) => !superWords.includes(word)) .sort((a, b) => a.localeCompare(b)) ); console.log(desiredResult);
-
answered 2022-05-04 10:16
R4ncid
you can do this
const words = ['luigi', 'Bar', 'Test', 'zac1', 'Alf0']; words.sort((a, b) => { const superWords = ["zac1", "Test"] if(superWords.includes(a) && !superWords.includes(b)){ return -1 }else if(superWords.includes(b) && !superWords.includes(a)){ return 1 } return a.localeCompare(b) }) console.log(words)
-
answered 2022-05-04 10:18
Maik Lowrey
First step find doubles and the your can sort both arrays and afterwards you can concat the arrays.
let words = ['luigi', 'Bar', 'Test', 'zac1', 'Alf0']; const superWords = ["zac1", "Test"] words = words.filter(w => ! superWords.includes(w)); words.sort((a, b) => a.localeCompare(b)); superWords.sort((a, b) => a.localeCompare(b)); console.log(superWords.concat(words));
-
answered 2022-05-04 10:24
Sash Sinha
You could convert
superWords
into a Set forO(1)
lookup time usinghas
rather thanO(n)
usingincludes
whensuperWords
is an Array (wheren
is the number of words insuperWords
):const words = ['luigi', 'Bar', 'Test', 'zac1', 'Alf0']; const superWords = ['zac1', 'Test']; const superWordsSet = new Set(superWords); // This is O(n) but you only need to do this once. words.sort((a, b) => { if (superWordsSet.has(a) && !superWordsSet.has(b)) { return -1; } else if (!superWordsSet.has(a) && superWordsSet.has(b)) { return 1; } return a.localeCompare(b); }); console.log(words);
Performance
The
Set
has
method checks if a value is in aSet
object, using an approach that is, on average, quicker than testing most of the elements that have previously been added to theSet
object. In particular, it is, on average, faster than theArray.prototype.includes
method when anArray
object has alength
equal to aSet
object'ssize
.
do you know?
how many words do you know