docs: private IntIntPair totalPivotSearch(int k) {
      double max = 0;
      int i, j, pivotRow = k, pivotCol = k;
      double absValue;
      for(i = k; i < coeff.length; i++) {
        for(j = k; j < coeff[0].length; j++) {
          // compute absolute value of
          // current entry in absValue
          absValue = Math.abs(coeff[row[i]][col[j]]);
  
          // compare absValue with value max
          // found so far
          if(max < absValue) {
            // remember new value and position
            max = absValue;
            pivotRow = i;
            pivotCol = j;
          } // end if
        } // end for j
      } // end for k
      return new IntIntPair(pivotRow, pivotCol);
    }