Anonymous user
Sorting algorithms/Insertion sort: Difference between revisions
→{{header|C}}: useless var
(→{{header|C}}: need stddef for size_t) |
(→{{header|C}}: useless var) |
||
Line 191:
=={{header|C}}==
<lang c>#include <stddef.h>
static void insertion_sort(int *a, const size_t n) {
size_t i, j;
Line 205 ⟶ 206:
int main(void) {
int a[] = {4, 65, 2, -31, 0, 99, 2, 83, 782, 1};
return 0;
}</lang>
|