广工anyview最后数题的答案（Answers to the last question in anyview）.docVIP

广工anyview最后数题的答案（Answers to the last question in anyview） /********** [9.023] exercise structure types are defined as follows: Struct date{int year; int month; int day;}; / / define the date structure type Struct student {char name[20]; Struct date birth; / / date of birth }; An array of structures s n is stored in the personal name and date of birth. Write a function, the largest individual for the age of n (that is the name of the minimum date of birth). **********/ Char *oldest (student s[], int n) {int J, k=0; For (j=1; jn-1; j++) {if (s[k].birth.years[j].birth.year) k=j; Else if (s[k].birth.year==s[j].birth.year) {if (s[k].birth.months[j].birth.month) k=j; Else if (s[k].birth.month==s[j].birth.month) If (s[k].birth.days[j].birth.day) k=j; } } Return s[k].name; } /********** [9.033] the exercise date and node list types of structures are defined as follows: Struct date{int year; int month; int day;}; / / date type of structure The structure of struct / studentNode node list type {char name[10]; / / name Struct date birth; / / date of birth Struct studentNode *next; }; L storage structure list ns name and date of birth. Write a function for the n people The maximum age (i.e. the minimum date of birth) name. **********/ Char *oldest (struct studentNode *L) / * if L is an empty table, or a null pointer null Otherwise it returns the oldest name table * / {struct studentNode *p; If (L==NULL) return NULL; For (p=L-next; P =NULL; p=p-next!) { If ((*p).Birth.year (*L).Birth.year) continue; If ((*p).Birth.year== (*L).Birth.year) { If ((*p).Birth.month (*L).Birth.month) continue; If ((*p).Birth.month== (*L).Birth.month (*p).Birth.day= (*L).Birth.day) continue; } L=p; } Return ((*L).Name); } /********** [9.063] exercise structure types are defined as follows: Struct course {int cID; / / course number, value 0~99 Char name[10]; / / name of course Float credit; / / credit value 0~5 Int semester; / / term value of 1~8 }; Structure array C storage N course information. Write a