Java List Min minIndex(List list)

Description

Returns the index of the minimum element in the list, using the elements' natural ordering, or -1 if the list is empty.

License

Open Source License

Parameter

Parameter	Description
list	a list

Return

the index of the minimum element

Declaration

public static <T extends Comparable<? super T>> int minIndex(List<T> list) 

Method Source Code

//package com.java2s;
/*/*from  ww  w  . j av a2 s .c  o m*/
 * Copyright (c) 2013-2014 Massachusetts Institute of Technology
 *
 * Permission is hereby granted, free of charge, to any person obtaining a copy
 * of this software and associated documentation files (the "Software"), to deal
 * in the Software without restriction, including without limitation the rights
 * to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
 * copies of the Software, and to permit persons to whom the Software is
 * furnished to do so, subject to the following conditions:
 *
 * The above copyright notice and this permission notice shall be included in
 * all copies or substantial portions of the Software.
 *
 * THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
 * IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
 * FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
 * AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
 * LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
 * OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN
 * THE SOFTWARE.
 */

import java.util.List;

public class Main {
    /**
     * Returns the index of the minimum element in the list, using the elements'
     * natural ordering, or -1 if the list is empty.
     * @param list a list
     * @return the index of the minimum element
     */
    public static <T extends Comparable<? super T>> int minIndex(List<T> list) {
        if (list.isEmpty())
            return -1;
        if (list.size() == 1)
            return 0;
        int best = 0;
        //TODO: alternative implementation for non-RandomAccess lists?
        for (int i = 1; i < list.size(); ++i)
            if (list.get(i).compareTo(list.get(best)) < 0)
                best = i;
        return best;
    }
}

Related

1. min(List runtimeList)
2. min(List numberList)
3. min(List numbers)
4. min(List objectList)
5. minAbsVal(List vals)
6. minLength(List patterns)
7. minList(Iterable iterable)
8. minmax(List values)
9. minSize(List... lists)