tmp/tmppjfvj7am/{from.md → to.md}
RENAMED
|
@@ -1,14 +1,14 @@
|
|
| 1 |
#### Requirements for stable algorithms <a id="algorithm.stable">[[algorithm.stable]]</a>
|
| 2 |
|
| 3 |
When the requirements for an algorithm state that it is “stable” without
|
| 4 |
further elaboration, it means:
|
| 5 |
|
| 6 |
-
- For the
|
| 7 |
preserved.
|
| 8 |
-
- For the
|
| 9 |
-
|
| 10 |
-
- For the
|
| 11 |
-
|
| 12 |
-
|
| 13 |
-
|
| 14 |
|
|
|
|
| 1 |
#### Requirements for stable algorithms <a id="algorithm.stable">[[algorithm.stable]]</a>
|
| 2 |
|
| 3 |
When the requirements for an algorithm state that it is “stable” without
|
| 4 |
further elaboration, it means:
|
| 5 |
|
| 6 |
+
- For the sort algorithms the relative order of equivalent elements is
|
| 7 |
preserved.
|
| 8 |
+
- For the remove and copy algorithms the relative order of the elements
|
| 9 |
+
that are not removed is preserved.
|
| 10 |
+
- For the merge algorithms, for equivalent elements in the original two
|
| 11 |
+
ranges, the elements from the first range (preserving their original
|
| 12 |
+
order) precede the elements from the second range (preserving their
|
| 13 |
+
original order).
|
| 14 |
|