C函数查找整数数组中的最大元素

Question

Consider the C function

int largest(int list[], int n, int l);

• list is a list of n integers.
• l is temp space for the function

The function is supposed to return the largest integer in the list of n integers in the array list .

int largest(int list[], int n, int l) {
   int i;
   for(i=0; i<n; i++) {
      if(list[i] > l) {
         l = list[i];
      }
   }
   return l;
}

Why is this function returning bad data at times?

Answer 1

Looks to me like you are trying to print the value l but you are not actually storing the return value of the function. Also you don't need to pass l as a parameter to your function.

Do this instead:

   // Declare the function prototype without int l.
   int largest(int list[], int n);

   // Actual function that searches for largest int.
   int largest(int list[], int n) 
   {
      int i;
      int l = list[0]; // Point to first element. 

      // Notice loop starts at i = 1.
      for(i = 1; i < n; i++) 
      {
         if(list[i] > l) 
           l = list[i]; 
      }

      return l;
   }

Then where you call your function do this:

int l = largest(list, n);

This code above just ensures that you store the value that your function returns.

Answer 2

You never initialize l , so it will return the existing value of this if none of the items in the list were larger than it. If you never initialized it in the calling function then the behaviour is undefined, which would explain your "bad data".