컴퓨터공학/알고리즘
-
#include #define MAX_SIZE 10 #define SWAP(x, y, t) ((t) = (x), (x) = (y), (y) = (t)) int list[MAX_SIZE] = { -25,23,4,5,-77,43,97,18,96,-95 }; void prn_sort(int list[], int n); void bubble_sort(int list[], int n); void main() { int n = MAX_SIZE; printf("\n-----정렬 전 데이터-----\n"); prn_sort(list, n); bubble_sort(list, n); printf("\n-----정렬 후 데이터-----\n"); prn_sort(list, n); } void bubble_sort(int li..
버블정렬#include #define MAX_SIZE 10 #define SWAP(x, y, t) ((t) = (x), (x) = (y), (y) = (t)) int list[MAX_SIZE] = { -25,23,4,5,-77,43,97,18,96,-95 }; void prn_sort(int list[], int n); void bubble_sort(int list[], int n); void main() { int n = MAX_SIZE; printf("\n-----정렬 전 데이터-----\n"); prn_sort(list, n); bubble_sort(list, n); printf("\n-----정렬 후 데이터-----\n"); prn_sort(list, n); } void bubble_sort(int li..
2021.12.29 -
#include #define MAX_SIZE 10 #define SWAP(x, y, t) ((t) = (x), (x) = (y), (y) = (t)) int list[MAX_SIZE] = { -25,23,4,5,-77,43,97,18,96,-95 }; void prn_sort(int list[], int n); void selection_sort(int list[], int n); void main() { int n = MAX_SIZE; printf("\n-----정렬 전 데이터-----\n"); prn_sort(list, n); selection_sort(list, n); printf("\n-----정렬 후 데이터-----\n"); prn_sort(list, n); } void selection_so..
선택정렬#include #define MAX_SIZE 10 #define SWAP(x, y, t) ((t) = (x), (x) = (y), (y) = (t)) int list[MAX_SIZE] = { -25,23,4,5,-77,43,97,18,96,-95 }; void prn_sort(int list[], int n); void selection_sort(int list[], int n); void main() { int n = MAX_SIZE; printf("\n-----정렬 전 데이터-----\n"); prn_sort(list, n); selection_sort(list, n); printf("\n-----정렬 후 데이터-----\n"); prn_sort(list, n); } void selection_so..
2021.12.29