Which algorithm does the JavaScript Array#sort() function use?

JavaScript's Array.sort() method doesn't mandate a specific sorting algorithm in the ECMAScript specification. This gives JavaScript engines freedom to choose the most efficient implementation for their environment.

Engine-Specific Implementations

Different JavaScript engines use different sorting strategies based on performance optimizations and array characteristics.

Mozilla Firefox (SpiderMonkey)

SpiderMonkey primarily uses merge sort, which provides stable O(n log n) performance. The implementation can be found in Mozilla's C codebase.

Chromium/WebKit (V8 Engine)

V8 uses a hybrid approach called Timsort (based on merge sort and insertion sort) for optimal performance across different data patterns. The algorithm selection depends on:

• Array size: Insertion sort for small arrays (
• Data type: Different optimizations for numbers vs strings
• Partially sorted data: Timsort excels with real-world data

Example: Observing Sort Behavior

// Small array - likely uses insertion sort internally
let small = [3, 1, 4, 1, 5];
console.log("Small array:", small.sort());

// Large numeric array
let large = Array.from({length: 1000}, () => Math.floor(Math.random() * 1000));
let sorted = large.sort((a, b) => a - b);
console.log("Large array first 10:", sorted.slice(0, 10));

// String array
let strings = ["zebra", "apple", "banana", "cherry"];
console.log("Strings:", strings.sort());

Small array: [ 1, 1, 3, 4, 5 ]
Large array first 10: [ 0, 0, 1, 1, 1, 2, 2, 3, 3, 4 ]
Strings: [ 'apple', 'banana', 'cherry', 'zebra' ]

Algorithm Comparison

Key Characteristics

Regardless of the underlying algorithm, JavaScript's Array.sort() guarantees:

• Stability: Equal elements maintain their relative order
• In-place sorting: Modifies the original array
• Default lexicographic sorting: Converts elements to strings for comparison

Performance Implications

// Always provide a compare function for numbers
let numbers = [10, 5, 40, 25, 1000, 1];

// Wrong: lexicographic sort
console.log("Default sort:", numbers.sort());

// Correct: numeric sort
console.log("Numeric sort:", numbers.sort((a, b) => a - b));

Default sort: [ 1, 10, 1000, 25, 40, 5 ]
Numeric sort: [ 1, 5, 10, 25, 40, 1000 ]

Conclusion

JavaScript engines use sophisticated sorting algorithms optimized for different scenarios. Modern engines like V8 use Timsort for excellent real-world performance, while maintaining the stability and reliability that developers expect from Array.sort().