Anonymous user
Sorting algorithms/Strand sort: Difference between revisions
→{{header|D}}
m (→{{header|D}}: stableLinearRemove is just an alias for linearRemove) |
|||
Line 126:
sorted.insertBack(list.front);
list.removeFront();
int i = 0;
foreach (item; list) {
if (sorted.back <= item) {
sorted.insertBack(item);
if (
list.removeFront();
else
list.linearRemove(list[].find(item).take(1
}
i++;
}
result = merge(sorted, result);
| |||