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 38 39 40 41 42 43 44 45 46 47 48 49 #include void readMatrix(int a[][3]); void matrixAdd(int a[][3], int b[][3], int x[][3]); void printMatrix(int a[][3]); int main(void) { int a[3][3], b[3][3], sum[3][3]; printf("(3 X 3) 행렬 A 입력: \n"); readMatrix(a); //printMatrix(a); printf("(3 X 3) 행렬 B 입력: \..

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 #include int comb(int n, int r, int** memo) { if (r == 0 || r == n) { memo[n][r] = 1; return memo[n][r]; } else { if (memo[n - 1][r - 1] == 0) memo[n - 1][r - 1] = comb(n - 1, r - 1, memo); if (memo[n - 1][r] == 0) memo[n - 1][r] = comb(n - 1, r, memo); memo[n][r] = memo[n - 1][r - 1] + me..

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 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 #include #include #include void printCode(char code[]) { int i; printf("--------------------------------------------------------\n"); printf("alphabet:\tABCDEFGHIJKLMNOPQRSTUVWXYZ\n"..

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 #include #include void printArr(int *a, int start, int end) { int i; for (i = start; i start) quickSort(a, start, index-1); if (index + 1

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 54 55 56 57 58 59 60 61 62 63 64 #include #include void printArr(int *a, int start, int end) { int i; for (i = start; 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 #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