What's the sorting algorithm when using Array.prototype.sort() with a compare function
.everyoneloves__top-leaderboard:empty,.everyoneloves__mid-leaderboard:empty,.everyoneloves__bot-mid-leaderboard:empty{ height:90px;width:728px;box-sizing:border-box;
}
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 utilise the same sorting algorithm like using without the compare function. If it does, does the compare function have performance impact on the algorithm. And if it doesn't, what sorting algorithm does it use?
Scenario e.g.
const arr = [23, 1, 5, 2, 10, 2]
arr.sort((a, b) => a - b)
javascript arrays algorithm sorting
add a comment |
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 utilise the same sorting algorithm like using without the compare function. If it does, does the compare function have performance impact on the algorithm. And if it doesn't, what sorting algorithm does it use?
Scenario e.g.
const arr = [23, 1, 5, 2, 10, 2]
arr.sort((a, b) => a - b)
javascript arrays algorithm sorting
"does using it with a compare function still utilise the same sorting algorithm like using without the compare function" - why wouldn't it?
– melpomene
Nov 23 '18 at 4:37
1
A compare function just tells about the relation between the two given arguments. It is the implementation algorithm, which decides the arguments to compare, and then the place of the given arguments in the original array after the compare function returns.
– 31piy
Nov 23 '18 at 4:50
add a comment |
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 utilise the same sorting algorithm like using without the compare function. If it does, does the compare function have performance impact on the algorithm. And if it doesn't, what sorting algorithm does it use?
Scenario e.g.
const arr = [23, 1, 5, 2, 10, 2]
arr.sort((a, b) => a - b)
javascript arrays algorithm sorting
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 utilise the same sorting algorithm like using without the compare function. If it does, does the compare function have performance impact on the algorithm. And if it doesn't, what sorting algorithm does it use?
Scenario e.g.
const arr = [23, 1, 5, 2, 10, 2]
arr.sort((a, b) => a - b)
javascript arrays algorithm sorting
javascript arrays algorithm sorting
edited Nov 23 '18 at 4:36
melpomene
62.8k55195
62.8k55195
asked Nov 23 '18 at 4:34
WenfangWenfang
2034
2034
"does using it with a compare function still utilise the same sorting algorithm like using without the compare function" - why wouldn't it?
– melpomene
Nov 23 '18 at 4:37
1
A compare function just tells about the relation between the two given arguments. It is the implementation algorithm, which decides the arguments to compare, and then the place of the given arguments in the original array after the compare function returns.
– 31piy
Nov 23 '18 at 4:50
add a comment |
"does using it with a compare function still utilise the same sorting algorithm like using without the compare function" - why wouldn't it?
– melpomene
Nov 23 '18 at 4:37
1
A compare function just tells about the relation between the two given arguments. It is the implementation algorithm, which decides the arguments to compare, and then the place of the given arguments in the original array after the compare function returns.
– 31piy
Nov 23 '18 at 4:50
"does using it with a compare function still utilise the same sorting algorithm like using without the compare function" - why wouldn't it?
– melpomene
Nov 23 '18 at 4:37
"does using it with a compare function still utilise the same sorting algorithm like using without the compare function" - why wouldn't it?
– melpomene
Nov 23 '18 at 4:37
1
1
A compare function just tells about the relation between the two given arguments. It is the implementation algorithm, which decides the arguments to compare, and then the place of the given arguments in the original array after the compare function returns.
– 31piy
Nov 23 '18 at 4:50
A compare function just tells about the relation between the two given arguments. It is the implementation algorithm, which decides the arguments to compare, and then the place of the given arguments in the original array after the compare function returns.
– 31piy
Nov 23 '18 at 4:50
add a comment |
1 Answer
1
active
oldest
votes
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
add a comment |
Your Answer
StackExchange.ifUsing("editor", function () {
StackExchange.using("externalEditor", function () {
StackExchange.using("snippets", function () {
StackExchange.snippets.init();
});
});
}, "code-snippets");
StackExchange.ready(function() {
var channelOptions = {
tags: "".split(" "),
id: "1"
};
initTagRenderer("".split(" "), "".split(" "), channelOptions);
StackExchange.using("externalEditor", function() {
// Have to fire editor after snippets, if snippets enabled
if (StackExchange.settings.snippets.snippetsEnabled) {
StackExchange.using("snippets", function() {
createEditor();
});
}
else {
createEditor();
}
});
function createEditor() {
StackExchange.prepareEditor({
heartbeatType: 'answer',
autoActivateHeartbeat: false,
convertImagesToLinks: true,
noModals: true,
showLowRepImageUploadWarning: true,
reputationToPostImages: 10,
bindNavPrevention: true,
postfix: "",
imageUploader: {
brandingHtml: "Powered by u003ca class="icon-imgur-white" href="https://imgur.com/"u003eu003c/au003e",
contentPolicyHtml: "User contributions licensed under u003ca href="https://creativecommons.org/licenses/by-sa/3.0/"u003ecc by-sa 3.0 with attribution requiredu003c/au003e u003ca href="https://stackoverflow.com/legal/content-policy"u003e(content policy)u003c/au003e",
allowUrls: true
},
onDemand: true,
discardSelector: ".discard-answer"
,immediatelyShowMarkdownHelp:true
});
}
});
Sign up or log in
StackExchange.ready(function () {
StackExchange.helpers.onClickDraftSave('#login-link');
});
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
StackExchange.ready(
function () {
StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fstackoverflow.com%2fquestions%2f53440697%2fwhats-the-sorting-algorithm-when-using-array-prototype-sort-with-a-compare-fu%23new-answer', 'question_page');
}
);
Post as a guest
Required, but never shown
1 Answer
1
active
oldest
votes
1 Answer
1
active
oldest
votes
active
oldest
votes
active
oldest
votes
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
add a comment |
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
add a comment |
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
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
answered Nov 23 '18 at 4:53
Oscar GodsonOscar Godson
13.5k3392172
13.5k3392172
add a comment |
add a comment |
Thanks for contributing an answer to Stack Overflow!
- Please be sure to answer the question. Provide details and share your research!
But avoid …
- Asking for help, clarification, or responding to other answers.
- Making statements based on opinion; back them up with references or personal experience.
To learn more, see our tips on writing great answers.
Sign up or log in
StackExchange.ready(function () {
StackExchange.helpers.onClickDraftSave('#login-link');
});
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
StackExchange.ready(
function () {
StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fstackoverflow.com%2fquestions%2f53440697%2fwhats-the-sorting-algorithm-when-using-array-prototype-sort-with-a-compare-fu%23new-answer', 'question_page');
}
);
Post as a guest
Required, but never shown
Sign up or log in
StackExchange.ready(function () {
StackExchange.helpers.onClickDraftSave('#login-link');
});
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
Sign up or log in
StackExchange.ready(function () {
StackExchange.helpers.onClickDraftSave('#login-link');
});
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
Sign up or log in
StackExchange.ready(function () {
StackExchange.helpers.onClickDraftSave('#login-link');
});
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
"does using it with a compare function still utilise the same sorting algorithm like using without the compare function" - why wouldn't it?
– melpomene
Nov 23 '18 at 4:37
1
A compare function just tells about the relation between the two given arguments. It is the implementation algorithm, which decides the arguments to compare, and then the place of the given arguments in the original array after the compare function returns.
– 31piy
Nov 23 '18 at 4:50