tmp/tmpzoggli6m/{from.md → to.md}
RENAMED
|
@@ -3,11 +3,12 @@
|
|
| 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* algorithms the relative order of the
|
| 9 |
-
are not removed is preserved.
|
| 10 |
- For the *merge* algorithms, for equivalent elements in the original
|
| 11 |
-
two ranges, the elements from the first range
|
| 12 |
-
from the second range
|
|
|
|
| 13 |
|
|
|
|
| 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
|
| 9 |
+
elements that are not removed is preserved.
|
| 10 |
- For the *merge* algorithms, for equivalent elements in the original
|
| 11 |
+
two ranges, the elements from the first range (preserving their
|
| 12 |
+
original order) precede the elements from the second range (preserving
|
| 13 |
+
their original order).
|
| 14 |
|