程序代码：

  #include <conio.h>
  #include <stdio.h>   
int max;  

 int fun( int arr[ ],int n )  

 { int pos,i;    

 max = arr[0];   

 pos = 0;    

 for ( i=1; i<n; i++) 

 
      if (max < arr[i])     
      { max = arr[i]; 
      pos=i; }   
      return(pos);  

 }   

 void main()  

 { 
     int a[10]={1,4,2,7,3,12,5,34,5,9}, n; 

 fun(a,n);   

 printf("The max is: %d ,pos is: %d\n", max , n);  

 }  

程序代码：

  #include <conio.h>
  #include <stdio.h>   
int max,pos;  

 void  fun( int arr[ ],int n )   

 { int i;    

 max = arr[0];   

 pos = 0;    

 for ( i=1; i<n; i++) 

 
      if (max < arr[i])     
      { max = arr[i]; 
      pos=i; }   
      return;  

 }   

 void main()  

 { 
     int a[10]={1,4,2,7,3,12,5,34,5,9}, n=10; 

 fun(a,n);   

 printf("The max is: %d ,pos is: %d\n", max ,pos);  

 }  

程序代码：

 #include <conio.h>
   #include <stdio.h> 
int max,pos;
  void  fun( int arr[],int n ) 
  { int i;  
  max = arr[0]; 
  pos = 0;  
  for ( i=1; i<n; i++)

       if (max < arr[i])   
       { max = arr[i];
       pos=i; } 
       
  } 
  void main()
  {
      int a[10]={1,4,2,7,3,12,5,34,5,9}, n=10;
  fun(a,n); 
  printf("The max is: %d ,pos is: %d\n", max ,pos+1);
  } 

[此贴子已经被作者于2016-6-16 12:59编辑过]