Sorting algorithms/Strand sort: Difference between revisions

Line 128:
sorted.insertBack(list.front);
list.removeFront();
int i = 0;
foreach (item; list) {
if (sorted.back <= item) {
sorted.insertBack(item);
if list.linearRemove(i == 0list[].find(item).take(1));
list.removeFront();
else
list.linearRemove(list[].find(item).take(1));
}
i++;
}
result = merge(sorted, result);
Anonymous user