JavaScript implements a variety of sorting algorithms

First, how to evaluate the merits of the algorithm

Stability: If A is originally in front of B, while A=b, A is still in front of B;
Instability: If A is originally in front of B, and A=b, then a may appear behind B;

Sort within: All sorting operations are done in memory;
Out of order: Because the data is too large, so the data is placed on the disk, and the sorting through the disk and memory data transfer can be carried out;

Time complexity: The time it takes for an algorithm to execute.
Spatial complexity: The amount of memory required to run a program.

Link

JavaScript implements a variety of sorting algorithms