標(biāo)題: c語言數(shù)組元素做函數(shù)實(shí)參 [打印本頁]

---

作者: liuda    時(shí)間: 2015-1-22 02:13
標(biāo)題: c語言數(shù)組元素做函數(shù)實(shí)參
本帖最后由 liuda 于 2015-1-22 02:17 編輯

1. 
   
2. //這個(gè)程序應(yīng)該不難，我想先自己試試
   
3. #include<stdio.h>
   
4. void main()
   
5. {int a[10],b[10],m,n,da=0,xiao=0,deng=0,l,k;
   
6. int cmp(int x,int y);
   
7. //各有10個(gè)元素，逐個(gè)比較統(tǒng)計(jì)<,>,==次數(shù)
   
8. printf("please input the elements of a[10]\n");
   
9. for(m=0;m<=9;m++)
   
10. {
    
11. scanf("%d",&a[m]);
    
12. }
    
13. printf("please input the elements of b[10]\n");
    
14. for(n=0;n<=9;n++)
    
15. {
    
16. scanf("%d",&b[n]);
    
17. }
    
18. for(k=0;k<=9;k++)
    
19. {l=cmp(a[k],b[k]);
    
20. if(l==1)
    
21. da++;
    
22. else if(l==0)
    
23. deng++;
    
24. else
    
25. xiao++;}
    
26. printf("a[i]>b[i]=%d times\na[i]<b[i]=%d time\nsa[i]==b[i]=%d times\n",da,xiao,deng);
    
27. if(da>xiao)
    
28. printf("a is bigger\n");
    
29. else if(da<xiao)
    
30. printf("b is bigger\n");
    
31. else
    
32. printf("a ==b\n");}
    
33. 
    
34. int cmp(int x,int y)
    
35. {int z;
    
36. if(x>y)
    
37. z=1;
    
38. else if(x<y)
    
39. z=-1;
    
40. else
    
41. z=0;
    
42. return(z);
    
43. }
    

復(fù)制代碼

---

歡迎光臨 (http://www.torrancerestoration.com/bbs/)

Powered by Discuz! X3.1