Anonymous user
Sorting algorithms/Insertion sort: Difference between revisions
→{{header|C}}: add static
(→{{header|C}}: size should be an unsigned int, size_t is even better because it uses the proper size for your architecture (32-bit on x86, 64-bit on x86_64)) |
(→{{header|C}}: add static) |
||
Line 190:
=={{header|C}}==
<lang c>static void insertion_sort(int *a, const size_t n) {
size_t i, j;
int value;
Line 207:
insertion_sort(a, n);
return 0;
}</lang>▼
▲</lang>
=={{header|C++}}==
| |||