aparler/RosettaCodeData
1
0
Fork 0
Code Issues 12 Pull requests 3 Projects Releases Packages Wiki Activity Actions

Just another update

Browse source
This commit is contained in:
Ingy döt Net 2015-02-20 00:35:01 -05:00
parent a25938f123
commit 00a190b0a6
6591 changed files with 94363 additions and 23227 deletions
Download patch file Download diff file Expand all files Collapse all files

12
Task/Sorting-algorithms-Comb-sort/D/sorting-algorithms-comb-sort.d
View file

@ -1,22 +1,22 @@
import std.stdio, std.algorithm;
void combSort(T)(T[] input) {
void combSort(T)(T[] input) pure nothrow @safe @nogc {
int gap = input.length;
bool swaps = true;
while (gap > 1 || swaps) {
gap = max(1, cast(int)(gap / 1.2473));
swaps = false;
foreach (i; 0 .. input.length - gap)
foreach (immutable i; 0 .. input.length - gap)
if (input[i] > input[i + gap]) {
swap(input[i], input[i + gap]);
input[i].swap(input[i + gap]);
swaps = true;
}
}
}
void main() {
auto array = [28, 44, 46, 24, 19, 2, 17, 11, 25, 4];
combSort(array);
writeln(array);
auto data = [28, 44, 46, 24, 19, 2, 17, 11, 25, 4];
data.combSort;
data.writeln;
}