Collection is one of the most important topics for Java programming. Without the proper knowledge of every collection type in Java, it becomes difficult for you to decide which option to pick in a particular scenario.

This course will give you a great understanding of all collection types available in the Collections Framework like lists, linked lists, sets, and hashmaps. 

After completing this course, you will know how data can be modified within a collection, how to sort a collection, and how it can be made thread-safe. You will also cover the internal working of each Java collection so you can work with them more efficiently.

Collections in Java

## Searching an element in a Collection

The `binarySearch(List list, T key)` method searches the specified list for the specified object using the binary search algorithm. The elements added in the List must implement the Comparable interface, and the list must be sorted into ascending order before making this call. If it is not sorted, the results are undefined.  If the list contains multiple elements equal to the specified object, there is no guarantee which one will be found.

If the elements added to our List do not implement the Comparable interface, then we can use another overloaded version of `binarySearch(List list, T key, Comparator comp)`, which takes a Comparator for the input as well. The list must be sorted into ascending order according to the specified comparator.

If the element is not present in the list, then this method returns a position where the element can be inserted.

# Searching an element in a Collection

The `binarySearch(List list, T key)` method searches the specified list for the specified object using the binary search algorithm. The elements added in the List must implement the Comparable interface, and the list must be sorted into ascending order before making this call. If it is not sorted, the results are undefined.  If the list contains multiple elements equal to the specified object, there is no guarantee which one will be found.

If the elements added to our List do not implement the Comparable interface, then we can use another overloaded version of `binarySearch(List list, T key, Comparator comp)`, which takes a Comparator for the input as well. The list must be sorted into ascending order according to the specified comparator.

If the element is not present in the list, then this method returns a position where the element can be inserted.

Let's discuss some operations available in the Collections class.

Let's Begin

Lists in Java

LinkedList in Java

CopyOnWriteArrayList in Java

Sets in Java

TreeSet in Java

HashMap In Java

TreeMap in Java

LinkedHashMap in Java

Additional Map Implementations

Arrays Class

Collections Class

Searching, Filing, and Copying Collection

Searching an element in a Collection