Comment #43 on issue 90 by [email protected]: V8 doesn't stable sort
https://code.google.com/p/v8/issues/detail?id=90
This whole discussion is futile: Being stable or not is just one of many
properties of a sorting algorithm, see e.g.
https://en.wikipedia.org/wiki/Sorting_algorithm#Comparison_of_algorithms.
Do you care about average performance? Memory? Do you care about worst
behavior? Asymptotic complexity or raw speed on "your usual" input sizes
(i.e. constant factors)? etc. etc.
Depending on your use case, any of these properties may be mission-critical
or totally irrelevant, that's the reason why there are so many sorting
algorithms. There is simply no "best" algorithm, so most language/library
specifications offer you only a small handful (typically 1 or 2) of them
and leave the rest up to application/library/framework writers, who only
know what would be "best" for them.
Furthermore, using any kind of language or library is a game: There are
strict rules, which you have to follow and on which you can base your
assumptions. Everything beyond the rules is wishful thinking, and there are
often good reasons for the rules, even if you don't see them. Of course you
can rightfully complain about the rules, but those complaints should be
directed to the authors of the rules, not to the manufacturers of the game.
And if you don't like the rules, there are always other games to play... ;-)
--
You received this message because this project is configured to send all
issue notifications to this address.
You may adjust your notification preferences at:
https://code.google.com/hosting/settings
--
--
v8-dev mailing list
[email protected]
http://groups.google.com/group/v8-dev
---
You received this message because you are subscribed to the Google Groups "v8-dev" group.
To unsubscribe from this group and stop receiving emails from it, send an email
to [email protected].
For more options, visit https://groups.google.com/d/optout.
