수다닷컴

질문 제목 : 정렬에서 어떤게 잘못 되었는지 혹시 알려주실 수 있을까요?질문 내용 : #include stdio.h
#include stdlib.h
#define swap(x,y,t) ((t)=(x),(x)=(y),(y)=(t))
#define buckets 10
#define digit 4
typedef struct {
int queue[100];
int front,rear;
} queuetype;
typedef struct {
int heap[10];
int heap_size;
} heaptype;

void mergesort(int n,int n1);
void main()
{
int score[6],sorted[10],method,order;
int i,j,k,l,least,temp,key,gap,pivot,low,high;
int left=0,mid,right=6;
printf(정렬하고 싶은 숫자 6개를 적으시오 : );for(i=0; i6; i++)
scanf(%d,&score[i]);printf(정렬 방법을 선택하시오\n1.선택정렬\t2.삽입정렬\n3.버블정렬\t4.셸 정렬\n);
printf(5.합병정렬\t6.퀵 정렬\n7.기수정렬\t8.힙 정렬\n);
scanf(%d,&method);
printf(순서를 정하시오\n1.오름차순\t2.내림차순\n);
scanf(%d,&order);switch(method)
{
case 1:
printf(선택정렬을 선택하셨습니다\n);
for(j=0; j5; j++)
{
least = j;
for(k=i+1; k6; k++)
if(score[k]score[least]) least = k;
swap(score[i],score[least],temp);
}

break;
case 2:
printf(삽입정렬을 선택하셨습니다\n);
for(j=1; j6; j++)
{
key=score[j];
for(k=j-1; k=0 && score[k]key; k--)
score[k+1] = score[k];
score[k+1] = key;
}
break;
case 3:
printf(버블정렬을 선택하셨습니다\n);
for(j=6-1; j0; j--)
{
for(k=0; kj; k++)
if(score[k]score[k+1])
swap(score[k],score[k+1],temp);
}
break;
case 4:
printf(셸 정렬을 선택하셨습니다\n);
for(gap = 6/2; gap0; gap = gap/2)
{
if((gap%2) == 0) gap++;
for(l=0; lgap; l++)
for(i=l+gap; i=5; i=i+gap){
key = score[l];
for(j=i-gap; j=i && keyscore[j]; j=j-gap)
score[j+gap]=score[j];
score[j+gap]=key;
}
} break;
case 5:
printf(합병정렬을 선택하셨습니다\n);
mergesort(left,right);
for(i=left; i=right; i++)
sorted[i] = score[i];
mid = (left/right) / 2;
i=left; j=mid+1; k=left;
while(i=mid && j=right)
if(sorted[i] sorted[j])
score[k++] = sorted[i++];
else
score[l++] = sorted[j++];
while (i = mid)
score[k++] = sorted[j++];
break;
case 6:
printf(퀵 정렬을 선택하셨습니다\n);
low = left;
high = right+1;
pivot = score[left];
do {
do
low++;
while (high = left && score[low]pivot);
do
high--;
while(high = left && score[high]pivot);
if(lowhigh) swap(score[low],score[high],temp);
} while(lowhigh);swap(score[left],score[high],temp);
break;}
switch(order)
{
case 1:
&nbbr /printf(오름차순을 선택하셨습니다\n);
for(i=0; i6; i++)
printf(%d ,score[i]);
break;
case 2:
printf(내림차순을 선택하셨습니다);
for(i=5; i=0; i--)
printf(%d ,score[i]);
break;}
}

void mergesort(int left,int right)
{
int mid;
if(leftright){
mid = (left+right)/2;
mergesort(left,mid);
mergesort(mid+1,right);
}}

신청하기