This program demonstrates the random shuffle and sort algorithms

 
/*
   This program is a part of the companion code for Core Java 8th ed.
   (http://horstmann.com/corejava)

   This program is free software: you can redistribute it and/or modify
   it under the terms of the GNU General Public License as published by
   the Free Software Foundation, either version 3 of the License, or
   (at your option) any later version.

   This program is distributed in the hope that it will be useful,
   but WITHOUT ANY WARRANTY; without even the implied warranty of
   MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
   GNU General Public License for more details.

   You should have received a copy of the GNU General Public License
   along with this program.  If not, see <http://www.gnu.org/licenses/>.
*/

import java.util.ArrayList;
import java.util.Collections;
import java.util.List;

/**
 * This program demonstrates the random shuffle and sort algorithms.
 * @version 1.10 2004-08-02
 * @author Cay Horstmann
 */
public class ShuffleTest
{
   public static void main(String[] args)
   {
      List<Integer> numbers = new ArrayList<Integer>();
      for (int i = 1; i <= 49; i++)
         numbers.add(i);
      Collections.shuffle(numbers);
      List<Integer> winningCombination = numbers.subList(0, 6);
      Collections.sort(winningCombination);
      System.out.println(winningCombination);
   }
}

Related examples in the same category

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

This program demonstrates the random shuffle and sort algorithms : Collections « Collections Data Structure « Java

Related examples in the same category