【正文】 。amp。p1?wage)? } p2?next=NULL? return(head)? } void print(struct teacher *head) { struct teacher *p? p=head? if (head!=NULL) do{ printf(“%d\t%s\t%f\n”, p?no, p?name, p?wage)? p=p?next? } while(p!=NULL)? } ，假如已經(jīng)按學(xué)號升序排列，寫出插入一個新教師的結(jié)點(diǎn)的函數(shù) insert。p1?wage)? head=NULL? while(p1?no!=0) { n=n+1? if(n 1) head p1? else p2?next p1? p2=p1? p1=( struct teacher *)malloc(LEN)? scanf(“%d%s%f”,amp。 include include define NULL 0 define LEN sizeof(struct teacher) struct teacher {int no? char name[8]? float wage? struct teacher * next? }? int n? struct teacher *creat(void) { struct teacher *head? struct teacher *p1,*p2? n=0? p1=p2= (struct teacher *)malloc(LEN)? scanf(“%d%s%f”,amp。choice)? switch(choice){ case 1: new_friend(friends)? break? case 2: printf(請輸入要查找的聯(lián)系人名:)? scanf(%s, name)? search_friend(friends, name)? break? case 0: break? } }while(choice != 0)? printf(謝謝使用通訊錄功能!\n)? return 0? } /*新建聯(lián)系人*/ void new_friend(struct friends_list friends[ ]) { struct friends_list f? if(Count 50){ printf(通訊錄已滿!\n)? return? } printf(請輸入新聯(lián)系人的姓名:)? scanf(%s, )? printf(請輸入新聯(lián)系人的年齡:)? scanf(%d, amp。假設(shè)通信錄最多容納 50 名聯(lián)系人信息。amp。amp。,amp。 include struct {int year? int month? int day? }date? main() {int days? printf(“Input year,month,day:”)? scanf(“%d,%D,%d”,amp。,55, English , 1834}} ? main() { int i? struct teacher *p? for( i=0?i2?i++) printf(%s,\t%c,\t%d,\t%s,\t%f, tea[i].name,tea[i].sex,tea[i].age,tea[i].department,tea[i].salary)? for(p=tea?ptea+2?p++) printf(%s,\t%c,\t%d,\t%s,\t%f, p?name, p?sex, p?age, p?department, p?salary)? } 2. 定義一個結(jié)構(gòu)體變量（包括年、月、日）。,40, Computer , 1234 }, {Andy , 39。 include struct teacher { char name[8]? char sex? int age? char department[20]? float salary? } ? struct teacher tea[2]= {{Mary , 39。 include define ROW 3 define COL 4 void Transpose(int (*a)[COL], int (*at)[ROW], int row, int col)? void InputMatrix(int (*s)[COL], int row, int col)? void PrintMatrix(int (*s)[ROW], int row, int col)? main() { int s[ROW][COL]? /*s 代表原矩陣*/ int st[COL][ROW]? /*st 代表轉(zhuǎn)置后的矩陣*/ printf(Please enter matrix:\n)? InputMatrix(s, ROW, COL)? /*輸入原矩陣,s 指向矩陣 s的第 0行,是行指針*/ Transpose(s, st, ROW, COL)?/*對矩陣 s 進(jìn)行轉(zhuǎn)置,結(jié)果存放于 st 中*/ printf(The transposed matrix is:\n)? PrintMatrix(st, COL, ROW)? /*輸出轉(zhuǎn)置矩陣,*st 指向 st 的第 0 行,是行指針*/ } /* 函數(shù)功能：對任意row行 col 列的矩陣轉(zhuǎn)置 函數(shù)入口參數(shù)：指向一維整型數(shù)組的指針變量a，指向單元存放轉(zhuǎn)置前的矩陣元素 整型變量 row，矩陣的行數(shù)即二維整型數(shù)組的行數(shù) 整型變量 col，矩陣的列數(shù)即二維整型數(shù)組的列數(shù) 函數(shù)出口參數(shù)：指向一維整型數(shù)組的指針變量at，指向單元存放轉(zhuǎn)置后的矩陣元素 函數(shù)返回值： 無*/ void Transpose(int (*a)[COL], int (*at)[ROW], int row, int col) { int i, j? for (i=0? irow?