D
Size: a a a
D
IL
IL
VL
const wideSort = (lastMod) => {
let result = [...lastMod];
for(let i = 0; i<=lastMod.length; i++){
result.sort((arrayA, arrayB) => +arrayA[i] - +arrayB[i]);
}
return result;
}
console.log(wideSort(lastMod));
D
const wideSort = (lastMod) => {
let result = [...lastMod];
for(let i = 0; i<=lastMod.length; i++){
result.sort((arrayA, arrayB) => +arrayA[i] - +arrayB[i]);
}
return result;
}
console.log(wideSort(lastMod));
D
VL
IL
IL
IL
IL
IL
D
const arraysComparator = elementsComparator => (arrayA, arrayB) => {
let result = 0;
let iterationsCap = Math.max(arrayA.length, arrayB.length);
for (let i = 0; i < iterationsCap; i++) {
const elementA = arrayA[i];
const elementB = arrayB[i];
if (elementA !== elementB) return elementsComparator(elementA, elementB);
}
}
let array = [
["16", "19", "3"],
["16", "18", "2"],
["16", "21", "1"],
["16", "17", "0"],
["16", "19", "2", "20", "21"],
]
array.sort(arraysComparator((a, b) => Number(a) - Number(b)));
console.log(array);
VL
IL
const arraysComparator = elementsComparator => (arrayA, arrayB) => {
let result = 0;
let iterationsCap = Math.max(arrayA.length, arrayB.length);
for (let i = 0; i < iterationsCap; i++) {
const elementA = arrayA[i];
const elementB = arrayB[i];
if (elementA !== elementB) return elementsComparator(elementA, elementB);
}
}
let array = [
["16", "19", "3"],
["16", "18", "2"],
["16", "21", "1"],
["16", "17", "0"],
["16", "19", "2", "20", "21"],
]
array.sort(arraysComparator((a, b) => Number(a) - Number(b)));
console.log(array);
D
D
IL
compareArrays
- это что?IL