Sorting algorithms/Insertion sort: Difference between revisions
Content added Content deleted
m (size_t & comment) |
m (→{{header|C}}) |
||
| Line 1,074: | Line 1,074: | ||
<lang c>#include <stdio.h> |
<lang c>#include <stdio.h> |
||
void insertion_sort(int*, size_t); |
void insertion_sort(int*, const size_t); |
||
void insertion_sort(int *a, size_t n) { |
void insertion_sort(int *a, const size_t n) { |
||
for(size_t i = 1; i < n; ++i) { |
for(size_t i = 1; i < n; ++i) { |
||
int key = a[i]; |
int key = a[i]; |
||
| Line 1,089: | Line 1,089: | ||
int main (int argc, char** argv) { |
int main (int argc, char** argv) { |
||
int a[] = {4, 65, 2, -31, 0, 99, 2, 83, 782, 1}; |
int a[] = {4, 65, 2, -31, 0, 99, 2, 83, 782, 1}; |
||