수다닷컴

질문 제목 :
각정렬을 모아서 swich문으로 선택하는 과제인데요..
아오류 안잡히네요 ㅜㅜ도와주세요

질문 내용
#include stdio.h
#include math.h
void selectionsort(int a[], int size);
void bubblesort(int a[], int size);
int partition(int a[], int begin, int end) ;
void quicksort(int a[], int begin, int end);
void insertionsort(int a[],int size);
void intervalsort(int a[], int begin, int end, int interval);
void shellsort(int a[],int size);
void merge(int a[], int m, int middle, int n);
void mergesort(int a[], int m, int n);
main()
{
int list[8]={12, 41, 64, 5, 21, 86, 21,32}, size=8, m;
printf(1. 선택정렬\n);
printf(2. 버블정렬\n);
printf(3. 퀵정렬\n);
printf(4. 삽입정렬\n);
printf(5. 셀정렬\n);
printf(6. 병합정렬\n);
printf(선택 );
scanf(%d,&m);
switch(m)
{
case 1: selectionsort(list, size); break;
case 2: bubblesort(list, size); break;
case 3: quicksort(list, 0, size-1); break;
case 4: insertionsort(list, size); break;
case 5: shellsort(list, size); break;
case 6: mergesort(list, 0, size-1); break;
}
getchar();
}

//선택정렬
void selectionsort(int a[], int size)
{
int i, j, t, min, temp;
printf(\n정렬할 원소 : );
for(t=0; tsize; t++) printf(%d , a[t]);
printf(\n\n 선택 정렬 수행 \n);
for (i=0; isize-1; i++) {
min = i;
for (j=i+1; jsize; j++) {
if (a[j]a[min]) min = j;
}
temp = a[i];
a[i] = a[min];
a[min] = temp;
printf(\n%d 단계 : , i+1);
for(t=0; tsize; t++) printf(%3d , a[t]);
}
}
//버블정렬
void bubblesort(int a[], int size)
{
int i, j, t, temp;
printf(\n정렬할 원소 : );
for(t=0; tsize; t++) printf(%d , a[t]);
printf(\n 버블 정렬 수행 );
for (i=size-1; i0; i--) {
printf(\n %d 단계, size-i);
for (j=0; j=i; j++) {
if (a[j-1]a[j]) {
temp = a[j-1];
a[j-1] = a[j];
a[j] = temp;
}
printf(\n\t);
for(t=0; tsize; t++) printf(%3d , a[t]);
}
}
}

//퀵정렬

int partition(int a[], int begin, int end)
{
int pivot, temp, l, r, t, size=end+1, i=0;

l=begin;
r=end;
pivot = (int)floor((begin+end)/2);
printf(\n [ %d단계 : pivot=%d] \n, ++i, a[pivot]);
while(lr){
while((a[l]a[pivot]) && (lr)) l++;
while((a[r]=a[pivot]) && (lr)) r--;
temp = a[l];
a[l] = a[r];
a[r] = temp;
if(l==pivot) {
for(t=0; tsize; t++) printf( %d, a[t]); printf(\n);
return r; }
}
temp = a[pivot];
a[pivot] = a[r];
a[r] = temp;
for(t=0; tsize; t++) printf( %d, a[t]);
printf(\n);
return r;
}

void quicksort(int a[], int begin, int end)
{
if(beginend){
int p;
p = partition(a, begin, end);
quicksort(a, begin, p-1);
quicksort(a, p+1, end);
}
}//삽입정렬
void insertionsort(int a[],int size)
{
int i, j, t, temp;
printf(\n정렬할 원소 : );
for(t=0; tsize; t++) printf(%d , a[t]);
printf(\n\n 삽입 정렬 수행 \n);
for (i=1; isize; i++) {
temp = a[i];
j = i;
while ((j0) && (a[j-1]temp)) {
a[j] = a[j-1];
j = j-1;
}
a[j] = temp;
printf(\n %d 단계 : , i);
for(t=0; tsize; t++) printf(%3d , a[t]);
}
}//셸정렬
void intervalsort(int a[], int begin, int end, int interval)
{
int i, j, item;
for(i=begin+interval; i=end; i=i+interval){
item = a[i];
for(j=i-interval; j=begin && itema[j]; j=j-interval)
a[j+interval] = a[j];
a[j+interval] = item;
}
}

void shellsort(int a[],int size)
{
int i, t, interval;
printf(\n정렬할 원소 : );
for(t=0; tsize; t++) printf(%d , a[t]);
printf(\n\n 셸 정렬 수행 \n);
interval=size/2;
while(interval = 1){
for (i=0; iinterval; i++)
intervalsort(a, i, size-1, interval);
printf(\n interval=%d , interval);
for(t=0; tsize; t++) printf(%d , a[t]);
printf(\n);
interval=interval/2;
}
}//병합정렬
void merge(int a[], int m, int middle, int n)
{
int sorted[30];
int i, j, k, t, size=n+1;
i = m;
j = middle+1;
k = m;

while (i=middle && j=n){
if(a[i]=a[j]){
sorted[k]=a[i];
i++;
}
else{
sorted[k]=a[j];
j++;
}
k++;
}
if(imiddle) for(t=j; t=n; t++,k++) sorted[k]=a[t];
else for(t=i; t=middle; t++,k++) sorted[k]=a[t];
for(t=m; t=n; t++) a[t] = sorted[t];
printf(\n 병합 정렬 );
for(t=0; tsize; t++) printf(%4d , a[t]);
}

void mergesort(int a[], int m, int n)
{
int middle;
if(mn){
middle = (m+n)/2;
mergesort(a, m, middle);
mergesort(a, middle+1, n);
merge(a, m, middle, n);
}
}:

신청하기