코딩/C언어
삽입정렬
런던전통손만두
2019. 9. 17. 17:32
반응형
|
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
|
#include <stdio.h>
void printArr(int *a, int n)
{
int i;
for (i = 0; i < n; i++)
printf("%3d", a[i]);
printf("\n");
}
void insertionSort(int* a, int n)
{
int i, j, key;
for (i = 1; i < n; i++) {
key = a[i];
for (j = i - 1; j >= 0 && a[j] > key; j--)
{
a[j + 1] = a[j];
}
a[j + 1] = key;
printArr(a, n);
}
}
int main(void)
{
int a[] = { 10, 50, 69, 27, 40, 72, 59, 21, 96, 4 };
int i;
insertionSort(a, 10);
for (i = 0; i < 10; i++)
printf("%3d", a[i]);
printf("\n");
}
|
cs |
결과:
반응형