Use reverse(), rotate(), and shuffle(). : Collections « Collections Data Structure « Java






Use reverse(), rotate(), and shuffle().

  

import java.util.Collections;
import java.util.LinkedList;
import java.util.List;

public class Main {

  public static void main(String args[]) {

    List<Character> ll = new LinkedList<Character>();

    for (char n = 'A'; n <= 'F'; n++)
      ll.add(n);

    System.out.println("Here is the original list: ");
    for (Character x : ll)
      System.out.print(x + " ");
    Collections.reverse(ll);

    System.out.println("Here is the reversed list: ");
    for (Character x : ll)
      System.out.print(x + " ");
    Collections.rotate(ll, 2);

    for (Character x : ll)
      System.out.print(x + " ");

    Collections.shuffle(ll);

    System.out.println("Here is the randomized list:");
    for (Character x : ll)
      System.out.print(x + " ");
  }
}

   
    
  








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 listUse 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.This program demonstrates the random shuffle and sort algorithmsThis program demonstrates the random shuffle and sort algorithms