수다닷컴

다른코드들은 신경쓰지마시구요... merge_sort라는 함수를 호출해서 정렬하고 그 결과값을 출력하려고 하는데요

이상하게 합병 정렬만 결과가 출력이 안되네요 뭐가 문제인건가요?ㅠ

#includestdio.h
#includestdlib.h
#define MAX_ELEMENT 200
#define BUCKETS 10
#define DIGITS 4
#define MAX_QUEUE_SIZE 100
#define MAX_SIZE 200
int sorted[MAX_SIZE];
//내림차순 선택정렬
void swap(int *x, int *y)
{
int temp = *x;
*x = *y;
*y = temp;
}

void selection_sort(int list[], int n)
{
int i, j, max;
for(i=0; in-1; i++){
max = i;
for(j=i+1; jn; j++){
if(list[j]list[max]) max = j;
}
swap(&list[i], &list[max]);
}
}

void insertion_sort(int list[], int n)
{
int i, j, key;
for(i=1; in; i++){
key=list[i];
for(j=i-1; j=0 && list[j]key; j--)
list[j+1] = list[j];
list[j+1] = key;
}
}

void bubble_sort(int list[], int n)
{
int i, j;
for(i=n-1; i0; i--){
for(j=0; ji; j++)
if(list[j]list[j+1])
swap(&list[j], &list[j+1]);
}
}

inc_insertion_sort(int list[], int first, int last, int gap)
{
int i, j, key;
for(i=first+gap; i=last; i=i+gap){
key = list[i];
for(j = i-gap; j=first && keylist[j]; j = j-gap)
list[j+gap] = list[j];
list[j+gap] = key;
}
}
void shell_sort(int list[], int n)
{
int i, gap;
for(gap=n/2; gap0; gap=gap/2){
if((gap%2)==0) gap++;
for(i=0; igap; i++)
inc_insertion_sort(list, i, n-1, gap);
}
}

void merge(int list[], int left, int mid, int right)
{
int i, j, k, l;
i = left; j = mid+1; k = left;
while(i=mid && j=right){
if(list[i]=list[j])
sorted[k++] = list[j++];
else
sorted[k++] = list[i++];
}
if(imid){
for(l=i; l=right; i++)
sorted[k++]=list[l];
}
else{
for(l=i; l=mid; l++)
sorted[k++]=list[l];
}
for(l=left; l=right; l++)
list[l] = sorted[l];
}
void merge_sort(int list[], int left, int right)
{
int mid;
if(leftright){
mid = (left + right)/2;
merge_sort(list, left, mid);
merge_sort(list, mid+1, right);
merge(list, left, mid, right);
}
}

int partition(int list[], int left, int right)
{
int low, high;
int pivot;
low = left;
high = right + 1;
pivot = list[left];
do{
do
low++;
while(low=right && list[low] pivot);

do
high--;
while(high=left && list[high] pivot);
if(lowhigh) swap(&list[low], &list[high]);
}while(lowhigh);

swap(&list[left], &list[high]);
return high;
}
void quick_sort(int list[], int left, int right)
{
if(leftright){
int q= partition(list, left, right);
quick_sort(list, left, q-1);
quick_sort(list, q+1, right);
}
}
typedef struct{
int key;
}element;
typedef struct{
element heap[MAX_ELEMENT];
int heap_size;
}HeapType;
void init(HeapType *h)
{
h-heap_size = 0;
}
void insert_max_heap(HeapType *h, element item)
{
int i;
i = ++(h-heap_size);
while((i!=1) && item.key h-heap[i/2].key){
h-heap[i] = h-heap[i/2];
i /=2;
}
h-heap[i] = item;
}

element delete_max_heap(HeapType *h)
{
int parent, child;
element item, temp;
item = h-heap[1];
temp = h-heap[(h-heap_size)--];
parent = 1;
child = 2;
while(child = h-heap_size){
if((childh-heap_size) && (h-heap[child].key) h-heap[child+1].key)
child++;
if(temp.key = h-heap[child].key) break;
h-heap[parent] = h-heap[child];
parent = child;
child *= 2;
}
h-heap[parent] = temp;
return item;
}

void heap_sort(element a[], int n)
{
int i;
HeapType h;
init(&h);
for(i=0; in; i++){
insert_max_heap(&h, a[i]);
}
for(i=0; in; i++){
a[i] = delete_max_heap(&h);
}
}

typedef int data;
typedef struct{
data queue[MAX_QUEUE_SIZE];
int front, rear;
}QueueType;
void error(char *message)
{
fprintf(stderr,%s\n, message);
exit(1);
}
void init_q(QueueType *q)
{
q-front = q-rear = 0;
}
int is_empty(QueueType *q)
{
return (q-front == q-rear);
}
int is_full(QueueType *q)
{
return ((q-rear+1)%MAX_QUEUE_SIZE == q-front);
}
void enqueue(QueueType *q, data item)
{
if(is_full(q))
error(큐가 포화상태입니다);
q-rear = (q-rear+1)%MAX_QUEUE_SIZE;
q-queue[q-rear] = item;
}
data dequeue(QueueType *q)
{
if(is_empty(q))
error(큐가 공백상태입니다);
q-front = (q-front+1)%MAX_QUEUE_SIZE;
return q-queue[q-front];
}
void radix_sort(int list[], int n)
{
int i, b, d, factor = 1;
QueueType queues[BUCKETS];
for(b=0; bBUCKETS; b++) init_q(&queues[b]);
for(d=0; dDIGITS; d++){

for(i=0; in; i++)
enqueue(&queues[(list[i]/factor)%10], list[i]);

for(b=BUCKETS-1, i=0; b=0; b--)
while(!is_empty(&queues[b]))
list[i++] = dequeue(&queues[b]);
factor *=10;B *=10;
}
}

void main()
{
int i, n;
int list[MAX_SIZE];
printf(생성할숫자의 개수를 입력하세요);
scanf(%d, &n);
for(i=0; in; i++)
{
list[i] = rand()%1000;
printf(%d-, list[i]);
}
merge_sort(list, 0,i);
printf(\n 정렬 후 : \n);
for(i=0; in; i++)
{
printf(%d-, list[i]);
}
}

신청하기