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

Sync

Browse source
This commit is contained in:
Ingy döt Net 2013-10-27 22:24:23 +00:00
parent 6f050a029e
commit 776bba907c
3887 changed files with 59894 additions and 7280 deletions
Download patch file Download diff file Expand all files Collapse all files

10
Task/Sorting-algorithms-Permutation-sort/D/sorting-algorithms-permutation-sort-1.d
View file

@ -1,15 +1,15 @@
import std.stdio, std.algorithm, permutations2;
void permutationSort(T)(T[] items) /*pure nothrow*/ {
foreach (perm; permutations!false(items))
if (isSorted(perm)) {
items[] = perm;
foreach (const perm; items.permutations!false)
if (perm.isSorted) {
items[] = perm[];
break;
}
}
void main() {
auto data = [2, 7, 4, 3, 5, 1, 0, 9, 8, 6, -1];
permutationSort(data);
writeln(data);
data.permutationSort;
data.writeln;
}

8
Task/Sorting-algorithms-Permutation-sort/D/sorting-algorithms-permutation-sort-2.d
View file

@ -1,11 +1,11 @@
import std.stdio, std.algorithm;
void permutationSort(T)(T[] items) /*pure nothrow*/ {
while (nextPermutation(items)) {}
void permutationSort(T)(T[] items) pure nothrow {
while (items.nextPermutation) {}
}
void main() {
auto data = [2, 7, 4, 3, 5, 1, 0, 9, 8, 6, -1];
permutationSort(data);
writeln(data);
data.permutationSort;
data.writeln;
}