수다닷컴

질문 제목 :
오른차순으로 삽입되게끔 수정좀 해주세영 ㅠ

오름차순으로 삽입이안되서 그러는데 더이상 잘 모르겟네영 ㅠ
수정좀 해주시거나 설명도 + 해주시면 더욱더 감사합니다 ㅠ질문 내용 :
#include stdio.h
#include stdlib.h
#include string.h
#define success 1
#define fail 0
//=====================================================
//typedef
//=====================================================
typedef struct __node{
int num;
struct __node *nextp;
}_node;
//======================================================
//global variable
//=======================================================
#define size 10
_node *freelistp;
_node *headptr;
_node node[size];
//
int i_init_freebuf()
{
int i = 0;
headptr = null;
//
for (i=0; i=size; i++)
{
node[i].num = 0;
if(i+1 != size)
node[i].nextp = &node[i+1];
}
node[i].nextp = null;
freelistp = &node[0];
return success;
}
//
int dsp_list(_node *headptr)
{
if( headptr ==null)
{
printf([ dsp_list ] empty !!\n);
return fail;
}
printf([ dsp_list ] the list contains :);
while( headptr )
{
printf( [%d], headptr-num);
headptr = headptr-nextp;
}
printf(\n);
return success;
}
//
_node* get_free_node()
{
_node* freenode = null;
if( !freelistp )
{
printf([ get_free_node() ] freebuffer empty !!\n);
return null;
}
freenode = freelistp;
freelistp = freenode-nextp;
printf([ get_free_node() ] get freebuffer - success!!\n);
return freenode;
}
//
_node* put_free_node(_node *freenode)
{
printf(node : [%d], freenode-num);
_node *ptr;
if( freenode == null)
{
printf([ put_free_node() ] parameter is null !!\n);
return null;
}
ptr =freelistp;
freelistp = freenode;
freenode-nextp = ptr;
printf([ put_free_node() ] free freebuffer - success!!\n);
return freenode;
}
//
int insert_node(int num)
{
_node *newptr;
_node *temp;
if(headptr == null){
headptr = (__node *) malloc(sizeof(__node));
headptr-num = num;
headptr-nextp = null;
}
else{
temp = headptr;
while(temp-nextp != null)
{
temp = temp-nextp;
}
newptr = (__node *) malloc(sizeof(__node));
newptr-num = num;
temp-nextp = newptr;
newptr-nextp = null;
}
get_free_node();
return success;
}
//
int delete_node(int num)
{
_node *temp;
_node *deltemp;
temp = headptr;
if (headptr-nextp == null){
headptr=null;
put_free_node(temp);
return success;
}
else if(headptr-num == num)
{
headptr = temp-nextp;
put_free_node(temp);
return success;
}
else{
while(1)
{
if(temp-nextp-num == num){
deltemp = temp-nextp;
break;
}
else{
temp=temp-nextp;
}
}
temp-nextp = deltemp-nextp;
put_free_node(deltemp);
return success;
}
}
int main()
{
int selmenu;
int retvalue;
char data[10];
i_init_freebuf();
printf( freelist = \n);
dsp_list(freelistp);
for (; ; )
{
//메뉴선택
printf( select \n);
printf(\t1 : insert 2 : delete 3 : exit\n\t);
retvalue = scanf(%d, &selmenu);
if(retvalue == eof || retvalue ==0 || selmenu 0 || selmenu 3)
{
printf(\t invalid selection. retry \n);
continue;
}
fflush(stdin);
switch (selmenu)
{
case 1:
printf(\tinput a value :);
retvalue = scanf(%s, data);
while(retvalue == 0 || strcmp(data, ) ==0 || strcmp(data, \n) == 0)
{
printf(\t invalid valid value. retry.);
retvalue = scanf(%s, data);
}
if (insert_node(atoi(data)) == success)
{
printf([ insert_node ] success - [%d]!!\n, atoi(data));
printf(\t freelist );
dsp_list(freelistp);
printf(\t linkedlist );
dsp_list(headptr);
}
else
{
printf([ insert_node ]fail - [%d]!!\n, atoi(data));
}
break;
case 2:
printf(\tinput a value :);
retvalue = scanf(%s, data);
while(retvalue == 0 || strcmp(data, ) ==0 || strcmp(data, \n) == 0)
{
printf(\t invalid value. retry.);
retvalue =scanf(%s, data);
}
if (delete_node(atoi(data)) == success)
{
printf([ delete_node ] success - [%d]!!\n, atoi(data));
printf(\t freelist );
dsp_list(freelistp);
printf(\t linkedlist );
dsp_list(headptr);
}
else
{
printf(deletion failed.[%d]\n, atoi(data));
}
break;
case 3:
//프로그램 끝냄
printf(exit.!!\n);
exit(0);
}
}
return success;
}
?xml:namespace prefix = v ns = urn:schemas-microsoft-com:vml /?xml:namespace prefix = o ns = urn:schemas-microsoft-com:office:office /?xml:namespace prefix = w ns = urn:schemas-microsoft-com:office:word /

신청하기