Java Utililty Methods Array Max Value

int best = -1;
double value = (naturalNumbers) ? 0D : Double.MIN_VALUE;
for (int i = 0; i < array.length; ++i) {
    if (array[i] > value) {
        value = array[i];
        best = i;
return best;

if (weights == null)
    return -1;
if (weights.length == 1)
    return 0;
double max = weights[0];
int maxI = 0;
for (int i = 1; i < weights.length; i++)
    if (weights[i] > max)
...

assert (vec != null);
double max = vec[0];
int argmax = 0;
for (int i = 1; i < vec.length; i++) {
    final double tmp = vec[i];
    if (tmp > max) {
        max = tmp;
        argmax = i;
...

int result = 0;
for (int i = 1; i < args.length; i++) {
    if (Float.compare(args[result], args[i]) < 0)
        result = i;
return result;

int v = Integer.MIN_VALUE;
int ind = -1;
for (int i = 0; i < a.length; i++) {
    if (a[i] > v) {
        v = a[i];
        ind = i;
return ind;

int re = Integer.MIN_VALUE;
int arg = -1;
for (int i = 0; i < a.length; i++) {
    if (a[i] > re) {
        re = a[i];
        arg = i;
return arg;

return getArgmax(array);

int index = -1;
int max = Integer.MIN_VALUE;
for (int i = 0; i < array.length; i++) {
    if (array[i] > max) {
        max = array[i];
        index = i;
return index;

int i = input.length - 1;
int currentMaximum = input[i];
int currentArgmax = i;
while (i >= 0) {
    if (input[i] > currentMaximum) {
        currentMaximum = input[i];
        currentArgmax = i;
    i++;
return currentArgmax;

double[] out = new double[vals.length];
for (int i = 0; i < vals.length; i++) {
    out[i] = Math.max(maxVal, vals[i]);
return out;