SHstation SHstation

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 void printArr(int *a, int n) { int i; for (i = 0; i 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

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 #include void bubbleSort(int* a, int n) { int i, j, k; int num; for (i = n - 1; i > 0; i--) { for (j = 0; j a[j + 1]) { num = a[j]; a[j] = a[j + 1]; a[j + 1] = num; } for (k = 0; k

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 #include void selectionSort(int* a, int n) { int i, j, k; int max, maxIndex; for (i = n - 1; i >= 0; i--) { max = -1; for (j = 0; j

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 #include #include void pick( char people[][20], int itemSize, int* bucket, int bucketSize, int k) { //중복 조합 int i, lastIndex, smallest, item; if (k == 0) { for (i = 0; i

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 38 39 40 #include #include void pick(char people[][20], int itemSize, int* bucket, int bucketSize, int k) { //중복 조합 int i, j, lastIndex, smallest, item, flag; if (k == 0) { for (i = 0; i

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 38 39 40 #include #include void pick(int itemSize, int* bucket, int bucketSize, int k) { //중복 조합 int i, lastIndex, smallest, item, total = 0; if (k == 0) { for (i = 0; i

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 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 #include #include void pick(int money[], int itemSize, int* bucket, int bucketSize, int k) { int i, lastIndex, smallest, item, total = 0; if (k == 0) { for (i = 0; i

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 #include #include void pick(char *items, int itemSize, int* bucket, int bucketSize, int k) { //중복 조합 int i, lastIndex, smallest, item; if(k == 0 ) { for (i = 0; i