Run results for: Comparing various JavaScript sorting methods (large workload #3)

Run details:

User agent: Mozilla/5.0 (Macintosh; Intel Mac OS X 10_15_7) AppleWebKit/537.36 (KHTML, like Gecko) Chrome/137.0.0.0 Safari/537.36

Browser: Chrome 137

Operating system: Mac OS X 10.15.7

Device Platform: Desktop

Date tested: 11 months ago

Test name	Executions per second
localeCompare base	5121.2 Ops/sec
localeCompare sensitive	17.6 Ops/sec
Intl.Collator base	1920.9 Ops/sec
Intl.Collator sensitive	1911.0 Ops/sec
sort comparator with casing	2453.1 Ops/sec
sort comparator with custom heuristic	4875.0 Ops/sec
sort comparator	6930.2 Ops/sec

HTML Preparation code:

<script src='https://cdnjs.cloudflare.com/ajax/libs/lodash.js/4.17.5/lodash.min.js'></script>

Script Preparation code:

function shuffle(array) {
    var i = array.length,
        j = 0,
        temp;
    while (i--) {
        j = Math.floor(Math.random() * (i + 1));
        temp = array[i];
        array[i] = array[j];
        array[j] = temp;
    }
    return array;
}

var words = [
    "résumés", "clichéds", "naïvetés", "façadés", "fiancées", 
    "touchés", "coupés", "blaséds", "matinées", "exposés", 
    "détentes", "crèmes", "jalapeños", "piñatas", "señoritas", 
    "niçoises", "garçons", "déjàvus", "rôles", "têtes", 
    "soufflés", "àpropos", "vis-à-vis", "papiers", "crêpes", 
    "protégés", "élitistes", "décorés", "entrées", "soupçons", 
    "appliqués", "mêlées", "sautés", "attachés", "cafétiers"
];
var words1 = [];
var n = [];

// Repeat the words array enough times to exceed 10,000 words
while (words.length < 10000) {
    words.push(...words);
}

for (i = 0; i < words.length; i++) n.push(i);
var ranNums = shuffle(n);
for (i = 0; i < words.length; i++) words1.push(words[ranNums[i]]);
console.log('ORIGINAL', words1);

Tests:

localeCompare base
words1.sort((a,b) => a.localeCompare(b));
localeCompare sensitive
words1.sort((a,b) => a.localeCompare(b, undefined, { sensitivity: 'accent' }));
Intl.Collator base
const collator = new Intl.Collator('en', { numeric: true, sensitivity: 'base' }); words1.sort((a, b) => collator.compare(a, b));
Intl.Collator sensitive
const collator = new Intl.Collator('en', { numeric: true, sensitivity: 'accent' }); words1.sort((a, b) => collator.compare(a, b));
sort comparator with casing
words1.sort((a,b) => { if (a.toLowerCase() < b.toLowerCase()) { return -1; } if (a.toLowerCase() > b.toLowerCase()) { return 1; } return 0; });
sort comparator with custom heuristic
words1.sort(function (a, b) { return (a < b ? -1 : (a > b ? 1 : 0)); });
sort comparator
words1.sort();

Run results for: Comparing various JavaScript sorting methods (large workload #3)

localeCompare base

localeCompare sensitive

Intl.Collator base

Intl.Collator sensitive

sort comparator with casing

sort comparator with custom heuristic

sort comparator