Sorting algorithms/Insertion sort: Difference between revisions
Sorting algorithms/Insertion sort (view source)
Revision as of 13:43, 20 November 2014
, 9 years agoAdded Sidef language.
m (→{{header|R}}) |
m (Added Sidef language.) |
||
Line 1,947:
Original source: [http://seed7.sourceforge.net/algorith/sorting.htm#insertionSort]
=={{header|Sidef}}==
<lang ruby>class Array {
method insertion_sort {
{ |i|
var j = i;
var k = self[i];
while ((j > 0) && (k < self[j - 1])) {
self[j] = self[j - 1];
j--;
};
self[j] = k;
} * self.offset;
return self;
}
}
var a = 10.of {100.rand.int};
say a.insertion_sort.dump;</lang>
=={{header|SNOBOL4}}==
| |||