Sort stability: Difference between revisions
Content added Content deleted
m (→{{header|Go}}: update text for current library.) |
|||
| Line 105: | Line 105: | ||
=={{header|Go}}== |
=={{header|Go}}== |
||
The sort package documentation makes no mention of stability. Inspection of the source shows multiple sort algorithms, including quicksort. Presumably then sorts are unstable. |
|||
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}}== |
||