Anonymous user
Sorting algorithms/Insertion sort: Difference between revisions
Improved D code
m (→String sort) |
(Improved D code) |
||
Line 313:
foreach (i; 1 .. data.length) {
auto value = data[i];
while (j >= 0 && data[j] > value) {
data[j + 1] = data[j];
| |||