Collections.min with Comparator : Collections « Collections Data Structure « Java






Collections.min with Comparator

   

import java.util.Collections;
import java.util.Set;
import java.util.TreeSet;

class MainClass {
  public static void main(String[] args) {
    String[] coins = { "Penny", "nickel", "dime", "Quarter", "dollar" };

    Set set = new TreeSet();
    for (int i = 0; i < coins.length; i++)
      set.add(coins[i]);

    System.out.println(Collections.min(set));
    System.out.println(Collections.min(set, String.CASE_INSENSITIVE_ORDER));

    System.out.println("");

    System.out.println(Collections.max(set));
    System.out.println(Collections.max(set, String.CASE_INSENSITIVE_ORDER));
  }
}

   
    
    
  








Related examples in the same category

1.Minimum and maximum number in array
2.Shuffling the Elements of a List or Array: use Collections.shuffle() to randomly reorder the elements in a list
3.Shuffle the elements in the array
4.Create an empty collection object
5.Collections.reverse
6.Use Collections.sort to sort custom class and user defined Comparator
7.Collections.shuffle to shuffle a list
8.Collections.fill
9.Demonstrates the use of final collections
10.Use Collections.shuffle to shuffle listUse Collections.shuffle to shuffle list
11.Making a Collection Read-Only
12.Shuffle generic list
13.Create List containing n Copies of Specified Object Example
14.Create and demonstrate an immutable collection.
15.Sort and Search a LinkedList.
16.Finding an Element in a Sorted List
17.Use reverse(), rotate(), and shuffle().
18.This program demonstrates the random shuffle and sort algorithmsThis program demonstrates the random shuffle and sort algorithms