수다닷컴

typedef struch cnode *npointer;
struch cnode {
int rum;
char grade;
npointer link;
};
void insert_front(npointer node);
void c_printf();
void find_grade(char sgrade);
npointer ptr = NULL;main()
{
int cond=1 i;
npointer temp;
char sgrade;while (cond) {
temp = (npointer)malloc(sizeof(struct cnode));
printf(Enter id and grade : );
scanf(%d %c,&(temp -num), &(temp -grade));
insert_front(temp);
printf(Continue?(0/1) : );
scanf(%d,%cond);
}c_print();
printf(Enter grade to be searched : );
scanf( %c, &sgrade);
find_grade(sgrade);
}void find_grade(char sgrade)
{
nponter temp = ptr;
if (ptr) {
do {
if (temp -grade == sgrade)
printf(%d : %c\n, temp -num, temp -grade);
temp = temp - link;
}while (temp != ptr);
}
}void isenrt_front(npointer node)
{
if (!ptr) {
ptr = node;
node - link = node;
}
else {
node - link = ptr - link;
ptr - link = node;
}
}void c_print()
{
npointer temp = ptr;
if(ptr) {
do {
printf(%d : %c\n, temp -num , temp -grade);
temp = temp - link;
} while (temp - link;
}
}

신청하기