Dla niestacjonarnych leniów

dlalenia.java

2:

public static int whereIsMaxValue(int[] table) {
  int max;
  int maxIndex = -1;
  for (int i = 0; i < table.length; i++) {
    if (table[i] > max) {
      max = table[i];
      maxIndex = i;
    }
  }
  return maxIndex;
}

3:

public static int whereIsMinValue(int[] table) {
  int max = Integer.MAX_VALUE;
  int maxIndex = -1;
  for (int i = 0; i < table.length; i++) {
    if (table[i] < max) {
      max = table[i];
      maxIndex = i;
    }
  }
  return maxIndex;
}

public static void exchangeMinMaxValues(int[] table) {
  int maxIndex = whereIsMaxValue(table);
  int minIndex = whereIsMinValue(table);
  
  int maxValue = table[maxIndex];
  int minValue = table[minIndex];
  
  table[maxIndex] = minValue;
  table[minIndex] = maxValue;
}