Anonymous user
Sorting algorithms/Insertion sort: Difference between revisions
Added an ActionScript version.
(→{{header|Prolog}}: Added PureBasic) |
(Added an ActionScript version.) |
||
Line 18:
Writing the algorithm for integers will suffice.
=={{header|ActionScript}}==
<lang ActionScript>function insertionSort(array:Array)
{
for(var i:int = 1; i < array.length;i++)
{
var value = array[i];
var j:int = i-1;
while(j >= 0 && array[j] > value)
{
array[j+1] = array[j];
j--;
}
array[j+1] = value;
}
return array;
}</lang>
=={{header|Ada}}==
| |||