Anonymous user
Sorting algorithms/Insertion sort: Difference between revisions
no edit summary
No edit summary |
|||
Line 1,504:
}
insertionsort(c(4, 65, 2, -31, 0, 99, 83, 782, 1)) # -31 0 1 2 4 65 83 99 782</lang>
=={{header|Rascal}}==
<lang rascal>public list[int] insertionSort(a){
for(i <- [0..size(a)-1]){
v = a[i];
j = i-1;
while(j >= 0 && a[j] > v){
a[j+1] = a[j];
j = j-1;}
a[j+1] = v;}
return a;
}</lang>
An example output:
<lang rascal>rascal>insertionSort([10,3,4,1,2,8,5,9,6,7])
list[int]: [1,2,3,4,5,6,7,8,9,10]</lang>
=={{header|REALbasic}}==
| |||