Sorting algorithms/Shell sort: Difference between revisions

=={{header|Ada}}==

This is a generic implementation of the shell sort. Ada allows arrays to be indexed by integer or enumeration types starting at any value. This version deals with any kind or value of valid index type.

generic

type Element_Type is digits <>;

procedure Sort(Item : in out Array_Type);

end Shell_Sort;

----------

end Shell_Sort;

=={{header|C}}==

This implementation uses an array of pre-defined increments

#define ARRAYSIZE 100000 /* or whatever */

}

}

=={{header|D}}==

From the Python version, uses Phobos of D 1.

import std.stdio: writefln;

writefln(data); // [-5, 2, 4, 7, 8, 22]

}

=={{header|Forth}}==

This method will sort in place. If you want to preserve your unsorted array, use a copy of the array as an argument to this method.

int increment = a.length / 2;

while (increment > 0) {

}

}

=={{header|Python}}==

This method sorts in place. If you want to preserve your unsorted list, copy it first.

def shell(seq):

inc = len(seq) // 2

shell(data)

print data # [-5, 2, 4, 7, 8, 22]