使用带有比较函数的 Array.prototype.sort() 时的排序算法是什么

Question

I've known that when using Array.prototype.sort() , different browsers have their own sorting algorithm implementation. But I'm curious, does using it with a compare function still utilizes the same sorting algorithm as using without the compare function? If it does, does the compare function have a performance impact on the algorithm? And if it doesn't, what sorting algorithm does it use?

Scenario eg

const arr = [23, 1, 5, 2, 10, 2]
arr.sort((a, b) => a - b)

Answer 1

Yes, it's the same sort function. Technically when not passing a comparison function it is still using a comparison function as a default. Mozilla has a pretty detailed explanation of the comparison function it uses when none is supplied: https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Global_Objects/Array/sort#Description