public class ArrayUtils {
//求數(shù)組的最大值(int)
 public static int getMax(int[] arr){
  int max = arr[0];
  for(int i = 0;i<arr.length;i++){
   if(max<arr[i]){
    max = arr[i];
   }
  }
  return max;
 }
//求數(shù)組的最小值(int)
 public static int getMin(int[] arr){
  int min = arr[0];
  for(int i = 0;i<arr.length;i++){
   if(min>arr[i]){
    min = arr[i];
   }
  }
  return min;
 }
//得到數(shù)組最大值的下標(biāo)(int)
 public static int getMaxIndex(int[] arr){
  int maxIndex = 0;
  for(int i = 0;i <arr.length;i++){
   if(arr[maxIndex]<arr[i]){
    maxIndex = i;
   }
  }
  return maxIndex;
 }
//得到數(shù)組最小值的下標(biāo)(int)
 public static int getMinIndex(int[] arr){
  int minIndex = 0;
  for(int i = 0;i <arr.length;i++){
   if(arr[minIndex]>arr[i]){
    minIndex = i;
   }
  }
  return minIndex;
 }
//獲得數(shù)組之和(int)
 public static int getSum(int[] arr){
  int sum = 0;
  for(int i = 0; i < arr.length;i++){
   sum += arr[i];
  }
  return sum; 
 }
//獲得平均值(int)
 public static int getAverage(int[] arr){
  int avg = getSum(arr)/arr.length;
  return avg;
 }
//打印數(shù)組(int)
 public static void printArray(int[] arr){
  for(int i = 0;i<arr.length;i++){
   if(i!=arr.length-1){
    System.out.print(arr[i]+",");
   }else{
    System.out.println(arr[i]);
   }
  }
 }
//選擇排序?qū)?shù)據(jù)進(jìn)行降序排序(int)
   public static void selectSortDescendingArray(int[] arr){
    for(int i = 0; i<arr.length-1;i++){//i<arr.length-1;最后一個不用比較
     for(int j = i+1;j<arr.length;j++){
      if(arr[i]<arr[j]){
       int temp = arr[j];
       arr[j] = arr[i];
       arr[i] = temp;
       }
     }
    }
   }
//選擇排序?qū)?shù)據(jù)進(jìn)行升序排序(int)
   public static void selectSortAscendingArray(int[] arr){
    for(int i = 0; i<arr.length-1;i++){//i<arr.length-1;最后一個不用比較
     for(int j = i+1;j<arr.length;j++){
      if(arr[i]>arr[j]){
       int temp = arr[j];
       arr[j] = arr[i];
       arr[i] = temp;
       }
     }
    }
   }
//冒泡排序?qū)?shù)據(jù)進(jìn)行降序排序(int)
  public static void bubbleSortDescendingArray(int[] arr){
   for(int i = 0;i<arr.length-1;i++){
    for(int j = 0;j<arr.length-1-i;j++){
     if(arr[j]<arr[j+1]){
      int temp = arr[j+1];
      arr[j+1] = arr[j];
      arr[j] = temp;
      }
    }
   }
  }
//冒泡排序?qū)?shù)據(jù)進(jìn)行升序排序(int)
  public static void bubbleSortAscendingArray(int[] arr){
   for(int i = 0;i<arr.length-1;i++){
    for(int j = 0;j<arr.length-1-i;j++){
     if(arr[j]>arr[j+1]){
      int temp = arr[j+1];
      arr[j+1] = arr[j];
      arr[j] = temp;
      }
    }
   }
  }
//二分查找(int)
  public static int binarySearch(int[] arr,int key){
   int min,mid,max;
   min = 0;
   max = arr.length-1;
   while(arr[min]<arr[max]){
    mid = (min+max)/2;
    if(key>arr[mid]){
     min = mid+1;
    }else if(key<arr[mid]){
     max = mid-1;
    }else {
     return mid;
    }
   }
   return -1;
  }
//*********************************************************************
  
//求數(shù)組的最大值(double)
 public static double getMax(double[] arr){
  double max = arr[0];
  for(int i = 0;i<arr.length;i++){
   if(max<arr[i]){
    max = arr[i];
   }
  }
  return max;
 }
//求數(shù)組的最小值(double)
  public static double getMin(double[] arr){
   double min = arr[0];
   for(int i = 0;i<arr.length;i++){
    if(min>arr[i]){
     min = arr[i];
    }
   }
   return min;
  }
//得到數(shù)組最大值的下標(biāo)(double)
  public static int getMaxIndex(double[] arr){
   int maxIndex = 0;
   for(int i = 0;i <arr.length;i++){
    if(arr[maxIndex]<arr[i]){
     maxIndex = i;
    }
   }
   return maxIndex;
  }
//得到數(shù)組最小值的下標(biāo)(double)
  public static int getMinIndex(double[] arr){
   int minIndex = 0;
   for(int i = 0;i <arr.length;i++){
    if(arr[minIndex]>arr[i]){
     minIndex = i;
    }
   }
   return minIndex;
  }
//獲得數(shù)組之和(double)
  public static double getSum(double[] arr){
   double sum = 0;
   for(int i = 0; i < arr.length;i++){
    sum += arr[i];
   }
   return sum; 
  }
//獲得平均值(double)
  public static double getAverage(double[] arr){
   double avg = getSum(arr)/arr.length;
   return avg;
  }
//打印數(shù)組(double)
    public static void printArray(double[] arr){
     for(int i = 0;i<arr.length;i++){
      if(i!=arr.length-1){
       System.out.print(arr[i]+",");
      }else{
       System.out.println(arr[i]);
      }
     }
    }
//選擇排序?qū)?shù)據(jù)進(jìn)行降序排序(double)
  public static void selectSortDescendingArray(double[] arr){
   for(int i = 0; i<arr.length-1;i++){//i<arr.length-1;最后一個不用比較
    for(int j = i+1;j<arr.length;j++){
     if(arr[i]<arr[j]){
      double temp = arr[j];
      arr[j] = arr[i];
      arr[i] = temp;
      }
    }
   }
  }
//選擇排序?qū)?shù)據(jù)進(jìn)行升序排序(double)
  public static void selectSortAscendingArray(double[] arr){
   for(int i = 0; i<arr.length-1;i++){//i<arr.length-1;最后一個不用比較
    for(int j = i+1;j<arr.length;j++){
     if(arr[i]>arr[j]){
      double temp = arr[j];
      arr[j] = arr[i];
      arr[i] = temp;
      }
    }
   }
  }
//冒泡排序?qū)?shù)據(jù)進(jìn)行降序排序(double)
 public static void bubbleSortDescendingArray(double[] arr){
  for(int i = 0;i<arr.length-1;i++){
   for(int j = 0;j<arr.length-1-i;j++){
    if(arr[j]<arr[j+1]){
     double temp = arr[j+1];
     arr[j+1] = arr[j];
     arr[j] = temp;
     }
   }
  }
 }
//冒泡排序?qū)?shù)據(jù)進(jìn)行升序排序(double)
 public static void bubbleSortAscendingArray(double[] arr){
  for(int i = 0;i<arr.length-1;i++){
   for(int j = 0;j<arr.length-1-i;j++){
    if(arr[j]>arr[j+1]){
     double temp = arr[j+1];
     arr[j+1] = arr[j];
     arr[j] = temp;
     }
   }
  }
 }
//二分查找(double)
   public static int binarySearch(double[] arr,double key){
    int min,mid,max;
    min = 0;
    max = arr.length-1;
    while(arr[min]<arr[max]){
     mid = (min+max)/2;
     if(key>arr[mid]){
      min = mid+1;
     }else if(key<arr[mid]){
      max = mid-1;
     }else {
      return mid;
     }
    }
    return -1;
   }

}