Sort stability: Difference between revisions
Content added Content deleted
m (whitespace) |
(Go answer) |
||
| Line 77: | Line 77: | ||
=={{header|Factor}}== |
=={{header|Factor}}== |
||
The <code>sorting</code> vocabulary implements a stable sort. [http://docs.factorcode.org/content/article-sequences-sorting.html <code>sorting</code> docs] |
The <code>sorting</code> vocabulary implements a stable sort. [http://docs.factorcode.org/content/article-sequences-sorting.html <code>sorting</code> docs] |
||
=={{header|Go}}== |
|||
Comments in sort.go of the standard library read, |
|||
<pre> |
|||
// Quicksort, following Bentley and McIlroy, |
|||
// ``Engineering a Sort Function,'' SP&E November 1993. |
|||
</pre> |
|||
There is no mention of stability. Presumably it is unstable. |
|||
=={{header|Haskell}}== |
=={{header|Haskell}}== |
||