长度n数组中查找最大元素

//扫描整个数组并返回最大的元素
void FindLargestInArray(int n,int[] a){
  int large = a[0];
  for(int i = 0;i<=n-1;i++){
    if(int i = 1;i<=n-1;i++){
      if(a[i] > large){
        large = a[i];
      }
    }
    System.out.println("Largest"+large);
  }
}

void findSmallestAndLargestInArray(int[] a,int n){
  int small = a[0];
  int large = a[0];
  for(int i = 1;i<n-1;i++){
    if(a[i]<small){
      small = a[i]
    }else if(a[i]>large){
      large = a[i];
    }
    System.out.println("Smallest:"+small+"Largest:"+large);
  }
}

//假设n为偶数
void findWithPairComparison(int[] a,int n){
  int large = small = -1;
  for(int i = 0;i<=n-1;i = i +2){
    if(a[i]<a[i+1]){
      if(a[i]<small){
        small = a[i];
      }
      if(a[i+1]>large){
        large = a[i+1];
      }
    }else{
      if(a[i+1]<small){
        small = a[i+1];
      }
      if(a[i] > large){
        large = a[i];
      }
    }
  }
  System.out.println("Smallest:"+small+"Largest:"+large);
}