C程序设计精编5.数组.pptx

;授课提纲1;授课提纲2;1.一维数组的定义及其初始化;1.一维数组的定义及其初始化;1.一维数组的定义及其初始化;1.一维数组的定义及其初始化;授课提纲1;2.数组元素的引用;#includestdio.h

intmain(void)

{

intyear,month,day,dth;

intConvertDate(int,int,int);

printf(Enteryear,month,day:);

scanf(%d,%d,%d,year,month,day);

dth=ConvertDate(year,month,day);

printf(Itis%dstoftheyear.,dth);

return(0);

};intConvertDate(intyear,intmonth,intday)

{

inti,dth=0;

intdayrun[12]={31,29,31,30,31,30,31,31,30,31,30,31};

intdaypin[12]={31,28,31,30,31,30,31,31,30,31,30,31};

if((year%4==0year%100!=0)||year%400==0)

for(i=0;imonth-1;i++)

dth+=dayrun[i];

else

for(i=0;imonth-1;i++)

dth+=daypin[i];

dth+=day;

return(dth);

};授课提纲1;#includestdio.h

#defineN5

intn;

intmain(void)

{

intk=0,max;

intresult[N],MaxValue(intresult[N]);

printf(\ninputresult[%d]~result[%d]:,k,N-1);

for(;kN;k++)

scanf(%d,result[k]);

max=MaxValue(result);

printf(\nmax=%d,subscript=%d\n,max,n);

return(0);

};#includestdio.h

#defineN5

intn;

intMaxValue(intresult[N])

{

intk=0,max=result[0];

for(k=1;kN;k++)

if(result[k]max)

{

max=result[k];

n=k;

}

return(max);

};授课提纲1;例5-3-1：输入8个整型数，用冒泡排序法将其按从小到大的顺序输出。;#includestdio.h

#defineN8

intmain(void)

{

intx[N];

inta;

voidsort(intx[N]);

printf(输入%d个待排序的数:,N);

for(a=0;aN;a++)

scanf(%d,x[a]);

sort(x);

printf(\n排序结果为：);

for(a=0;aN;a++)

printf(%5d,x[a]);

return(0);

};授课提纲1;#includestdio.h

#includestdlib.h

intmain(void)

{

chara[10],b[10];

inti,f(chars[],chart[]);

printf(Entertwostrings:);

scanf(%s%s,a,b);

i=f(a,b);

printf(%d\n,i);

system(pause);

return(0);

};授课提纲2;#includestdio.h

#includestring.h

#includestdlib.h

#defineN80

intma