[C] quickSort 알고리즘
#include void printArray(int arr[], int length);void quickSort(int arr[], int left, int right);int q = 1;int main(void) { int arr[6] = {2, 4, 3, 5, 1, 0}; printf("\nBefore Sorting : "); printArray(arr, 6); printf("\n"); quickSort(arr, 0, 5); printf("\nAfter Sorting : "); printArray(arr, 6);}void quickSort(int arr[], int left, int right) { int leftCounter = left; int rightCounter = right..
[C] Merge Sort 알고리즘 (합병 정렬)
#include void mergeSort(int arr[], int left, int right);void merge(int arr[], int left, int mid, int right);void printArray(int arr[], int length);int ms = 1; //mergeSort 함수 호출 횟수, 필수 아님int m = 1; //merge 함수 호출 횟수, 필수 아님int temp[6]; //임시 배열 생성int main(void) { int arr[6] = {29, 30, 6, 26, 23, 2}; printf("\nBefore Sorting : "); printArray(arr, 6); mergeSort(arr, 0, 5); printf("\nAfter Sorting..
