Collections Class in Java

Updated:

–

By

Coder Sathi

Serving as a centralized point, the Collections class provides utility methods for collection operations. Sorting, shuffling, searching, and synchronization can be achieved using methods like sort(), shuffle(), binarySearch(), and more. Let’s delve into some of these methods with practical examples.

Sorting Elements with sort() Method

Sorting collections is fundamental to maintaining order. The sort() method makes it effortless. Suppose we have an ArrayList of integers:

import java.util.*;

public class SortingExample {
    public static void main(String[] args) {
        List<Integer> numbers = new ArrayList<>(Arrays.asList(9, 2, 7, 5, 3));
        Collections.sort(numbers);
        System.out.println("Sorted numbers: " + numbers);
    }
}

Output:

Sorted numbers: [2, 3, 5, 7, 9]

Reversing Elements with reverse() Method

Reversing the order of elements can be useful in certain scenarios. With the reverse() method, it’s a breeze:

import java.util.*;

public class ReversingExample {
    public static void main(String[] args) {
        List<String> names = new ArrayList<>(Arrays.asList("Sachin", "MS Dhoni", "Virat"));
        Collections.reverse(names);
        System.out.println("Reversed names: " + names);
    }
}

Output:

Reversed names: [Virat, MS Dhoni, Sachin]

Shuffling Elements with shuffle() Method

Randomly shuffling elements is beneficial for tasks like creating randomized quizzes. The shuffle() method does the job:

import java.util.*;

public class ShufflingExample {
    public static void main(String[] args) {
        List<Integer> deck = new ArrayList<>(Arrays.asList(1, 2, 3, 4, 5));
        Collections.shuffle(deck);
        System.out.println("Shuffled deck: " + deck);
    }
}

Output:

Shuffled deck: [3, 5, 2, 1, 4]

Note: You may see a different output when you run this code. Because the shuffle method works randomly. Every time you execute the code the output will be different.

Efficient Searching using binarySearch() Method

The binarySearch() method performs a binary search on sorted collections. For instance, let’s search for the index of the value 7 in a sorted list:

import java.util.*;

public class SearchingExample {
    public static void main(String[] args) {
        List<Integer> sortedNumbers = new ArrayList<>(Arrays.asList(3, 5, 7, 9, 11));
        int index = Collections.binarySearch(sortedNumbers, 7);
        System.out.println("Index of 7: " + index);
    }
}

Output:

Index of 7: 2

FAQs about Collections Class in Java

Q. What is the purpose of the Collections class in Java?

The Collections class offers methods for various collection operations, enhancing code efficiency.

Q. Are Collections class methods thread-safe?

No, they are not thread-safe by default. However, synchronized versions can be used for thread safety.

Q. Can custom collection classes be created?

Absolutely, custom collection classes can be created by implementing interfaces like List, Set, or Map.

Q. Are there alternatives to the Collections class?

Yes, Java 8 introduced the Stream API, enabling functional-style operations on collections.

Q. Can collections of custom objects be sorted?

Yes, by implementing the Comparable interface or providing a custom Comparator.

Q. What is the diamond operator (<>) in collection initialization?

The diamond operator infers the type, simplifying type declaration during initialization.

Related Posts: