수다닷컴

질문 제목 : 다단계 합병질문 요약 :파일에서 값을 읽어와서 대체선택으로 런드을 분배 하였습니다.
다단계합병을 수행해서 런들을 합병해야 하는데 어찌 구현해야 하는지 감조차 잡히지 않네요 ㅜ
고수님들께 부탁 드리겠습니다.질문 내용 :
#include stdio.h
#include stdlib.h
#include math.h
#include limits.h
#define MAX 100
//#define null INT_MAX

#define true 1
#define false 0
////////////// replacement selection /////////////
typedef struct{
int data,frozen;
}recode;
int replacementSelction(int M);
int allNull(recode buffer[],int M);
void initialBuffer(FILE *in,recode buffer[],int M);
int findMin(recode buffer[],int M);
int findMinIndex(recode buffer[],int minval);
int allFrozen(recode buffer[],int M);
void frozenFree(recode buffer[],int M);
void makeInput(); //숫자 만듬.
////////////// polyphase merge ////////////////
int polyphaseMerge(mergeM,runlength);
int numofdata=0; //총 데이타 수.
int main()
{
int passnum=0,runnum=0;
int M, mergeM;
double runlength;
makeInput(DATA_BOOK);

printf(M값 : );
scanf(%d,&M);
replacementSelction(M);
runnum = replacementSelction(M);
printf(MERGE 의 M 값 : );
scanf(%d,&mergeM);
passnum = polyphaseMerge(mergeM,runlength);
runlength = (double)numofdata/runnum;
runnum= runnum;
printf(\n);
printf(런의 개수 : %d\n, runnum);
printf(내부정렬 run.dat에 생성된 런의 길이 : %.1f\n, runlength);
printf(외부정렬 merge에서 생성된 pass의 개수 : %d\n, passnum);
return 0;
}
void makeInput()
{
FILE *in;
int i;
printf(생성할 데이터의 개수를 입력하시오 값은 10000 밑으로 생성됨 ? : );
scanf(%d,&numofdata);
if(!numofdata) return ;
getchar();
in = fopen(DATA_BOOK,wb);
for(i=0 ; inumofdata ;i++)
fprintf(in,%d ,rand()%10000);
fclose(in);
}

int polyphaseMerge(mergeM,runlength)
{B)
{
printf(이부분은 처리하지 못했습니다.\n);
return 1;
}

int replacementSelction(int M)
{
int run=0,minval,minIndex;
recode buffer[MAX];
FILE *in,*out;
in = fopen(DATA_BOOK, rb);
out = fopen(DATA_BOOK2.txt,wb);

initialBuffer(in,buffer,M);
while(!feof(in))
{
run++;
while(!allFrozen(buffer,M))
{
minval=findMin(buffer,M);
if(minval == null) break;
fprintf(out,%d ,minval);
minIndex = findMinIndex(buffer,minval);
if(fscanf(in,%d,&buffer[minIndex]) == EOF)
buffer[minIndex].data =null;
if(buffer[minIndex].data minval)
buffer[minIndex].frozen = 1;
}
if(allFrozen(buffer,M))
frozenFree(buffer,M);
if(!allNull(buffer,M))
fprintf(out,%s,/\n);
}
if(!allNull(buffer,M))
{
for(run++;;)
{
frozenFree(buffer,M);
minval=findMin(buffer,M);
minIndex=findMinIndex(buffer,minval);
if(minval == null)break;
fprintf(out,%d ,minval);
buffer[minIndex].data = null;
}
}
fclose(in);
fclose(out);
return run;
}
int allNull(recode buffer[],int M)
{
int i;
for(i=0;iM;i++)
{
if(buffer[i].data != null)
return false;
}
return true;
}
void initialBuffer(FILE *in,recode buffer[],int M)
{
int i;
for(i=0;iM;i++)
{
if(fscanf(in,%d,&buffer[i] ) == EOF)
buffer[i].data = null;
buffer[i].frozen = false;
}
}
int findMin(recode buffer[],int M)
{
int i,minval=INT_MAX;
for(i=0;iM;i++)
{
if( !(buffer[i].frozen) && minval buffer[i].data)
minval=buffer[i].data;
}
return minval;
}
int findMinIndex(recode buffer[],int minval)
{
int i=0;
while(true)
{
if(buffer[i++].data == minval)
break;
}
return i-1;
}
int allFrozen(recode buffer[],int M)
{
int i;
for(i=0;iM;i++)
{
if(!buffer[i].frozen)
return false;
}
return true;
}
void frozenFree(recode buffer[],int M)
{
int i;
for(i=0;iM;i++)
{
buffer[i].frozen = false;
}
}

신청하기