C语言程序设计实验与习题答案

...

printf(\*\\n\printf(\

printf(\}

void find(int a[],int n) {

int x;

int low=0,high=n-1,mid;

printf(\scanf(\while(low<=high) {

mid=(low+high)/2; if(x==a[mid]) break;

else if(x>a[mid]) low=mid+1; else high=mid-1; }

nThis data can ’t be founthdeindatabase!\

else {

printf(\gotoxy(7+3*(mid+1)-2,23);putchar(25); } }

void insert(int a[],int n) {

int x,k,i;

printf(\scanf(\a[n]=x;

for(i=0;i

if(xk;i--) a[i]=a[i-1]; a[k]=x;

gotoxy(1,24); delline();

printf(\for(i=0;i<=n;i++) printf(\}

void Delete(int a[],int n)

...

...

{

int x,low,high,mid,i;

printf(\scanf(\low=0; high=n-1;

while(low<=high) {mid=(low+high)/2 ; if(a[mid]==x) break;

if(a[mid]>x) high=mid-1; if(a[mid]

if(low>high) printf(\else {

for( ;mid

printf(\for(i=0;i<=n-2;i++) printf(\}

}

main() {

int a[50],n=0; char com; input(a,&n); sort(a,n); clrscr(); menu(a,n); com=getch(); switch(com) {

case ’1’:find(a,n);break; case ’2’:insert(a,n);break; case ’3’:Delete(a,n);break; default: break; }

getch(); }

/*DT made it in 2009/05/16*/

...

...

程序填空：

（1）#include #define N 4 void main()

{ int a[N][N],s1=0,s2=1,max,i,j; for(i=0; i

scanf(\max=

a[0][0]

; &a[i][j]

);

for(i=0;i

s1=s1+a[i][j]

;

N ;j++)

if(i+j==N-1) s2*=a[i][j]; if(a[i][j]> }

printf(\}

（2）#include #define M 4 #define N 3 void main( )

{int a[M][N]={{1,2,3},{4,5,6},{7,8,9},{10,11,12}}; int sum=

0

,i,j; max

)max=a[i][j];

for(i=0;i

（1）#in#include #define M

3

a[j][N-1]

;

a[M-1][i]

;

#define N 4 void main( )

{int a[M][N]={{1,2,3,4},{5,6,7,8 },{9,10,11,12}}; int b[N][M]; int i,j;

for(i=0;i

printf(\printf(\

...

...

for(i=0;i

b[i][j]=a[j][i];

printf(\for(i=0;i

printf(\printf(\}

（2）#include void main()

{int d[][4] ={{0,0,0,0}},i,j; printf(\\

for(i=0;i<4;i++) for(j=0;j<4;j++) scanf(\for(i=0;i<4;i++) for(j=0;j<4;j++)

if(d[i][j]

{printf(\为了保持每行的间隔与每列的相同 */

for(j=0;j<4;j++) if(j>=i)

printf(\为了使位数不同的数输出依然保持三角型else

printf(\

} }

设计性实验：

（1）#include #define M 3 #define N 6 void main() {

int i,j,max,min,m=0,n=0,p=0,q=0; int a[M][N]; for(i=0;i

...

*/