소개글

insertion/quick/merge/heap/bubble/upgrade_bubble/shell/radix

등등...모든 정렬에 관련된 것들을 C로 구현해 봤습니다.

많이들 참고하세요.

목차

없음

본문내용

void insertion_sort(element list[], int size);
void quicksort(element list[], int left, int right);
void merge(element list[], element sorted[], int left, int middle, int right);
void merge_pass(element list[], element sorted[], int size, int length);
void merge_sort(element list[], int size);
int rmerge(element list[], int lower, int upper);
int listmerge(element list[], int first, int second);
void heapsort(element list[], int size);
void bubblesort(element list[], int size);
void upgrade_bubblesort(element list[], int size);
void shellsort(element list[], int size, int sublist[], int subsize);