Find the smallest Comparable in a subarray determined by indices first and last. - Java Collection Framework

Description

Find the smallest Comparable in a subarray determined by indices first and last.

Demo Code

//package com.java2s;

public class Main {
    /** Find the smallest Comparable in a subarray determined by
     * indices first and last./*from   w  w  w.j ava 2s .c o m*/
     * 
     * @param a  the array
     * @param first  the index of the first element of the subarray
     * @param last  the index of the last element of the subarray
     * @return the index of the smallest element of the subarray */
    public static <T extends Comparable<? super T>> int getIndexOfSmallest(
            T[] a, int first, int last) {
        int smallest = first;
        for (int index = first + 1; index <= last; index++) {
            if (a[smallest].compareTo(a[index]) == 1)
                smallest = index;
        }
        return smallest;
    }
}

• Previous
• Next

Related Tutorials

• inserts the element at the end of a particular sub-array into its sorted position in the rest of the array before it
• merges two sorted halves of an array into a single sorted array.
• is one char array Subset of another char array
• Given array indices that define a sorted subarray, place the element just above the subarray at the end of the subarray if it is smaller than the largest element and recurse on a 1-smaller subarray.
• Extracts a sub-array