Sorting algorithms/Insertion sort: Difference between revisions

Updated D code
(Updated D code)
Line 310:
<lang d>import std.stdio;
void insertionSort(T)(T[] data) pure nothrow {
foreach (i, value; data[1 .. $]) {
auto j = i + 1;
Anonymous user