Discussion on: Common Sorting Algorithms in JavaScript

View post

Excellent work Christina.
You're an expert of sorts. ;)

I perf-tested all of them.
The quickSort throws even on quite small arrays due to the stackoverflow recursion

The fastest is the merge sort, in the 1-2 second range for an array of 1M numbers.

First of all, good one 😂

Second, thanks for double checking and good to know about your findings! Did you test it in codepen by chance?

I perf-tested these locally.

An example usage per func...

//@perftests
const aNums = genRandNums(1, 1e4, 1e6);
timeInLoop("mergeSort", 1, () => mergeSort(aNums));

genRandNums Source Code

Oh this is awesome, thanks for sharing!