Anonymous user
Sorting algorithms/Insertion sort: Difference between revisions
Sorting algorithms/Insertion sort (view source)
Revision as of 01:33, 11 November 2019
, 4 years ago→{{header|VBA}}
(→{{header|Scala}}: Incorrect edit by Gerard Schildberger. Please stay away from things you don't know about.) |
|||
Line 3,367:
<45,58,69,74,82,82,88,89,104,112>
</pre>
=={{header|Vala}}==
{{trans|Nim}}
<lang vala>void insertion_sort(int[] array) {
var count = 0;
for (int i = 1; i < array.length; i++) {
var val = array[i];
var j = i;
while (j > 0 && val < array[j - 1]) {
array[j] = array[j - 1];
j--;
}
array[j] = val;
}
}
void main() {
int[] array = {4, 65, 2, -31, 0, 99, 2, 83, 782};
insertion_sort(array);
foreach (int i in array)
print("%d ", i);
}</lang>
{{out}}
<pre>
-31 0 2 2 4 65 83 99 782
</pre>
=={{header|VBA}}==
{{trans|Phix}}<lang vb>Option Base 1
Line 3,392 ⟶ 3,418:
<pre>Before: 4, 15, delta, 2, -31, 0, alpha, 19, gamma, 2, 13, beta, 782, 1
After: -31' 0' 1' 2' 2' 4' 13' 15' 19' 782' alpha' beta' delta' gamma</pre>
=={{header|VBScript}}==
{{trans|REALbasic}}
| |||