How do different Java collections compare in performance?

How do different Java collections compare in performance?

The performance of Java collections varies based on their implementation. For example, ArrayList offers fast random access but slow insertions, while LinkedList provides fast insertions but slower access.

What about HashMap and TreeMap?

HashMap provides average constant time complexity for get and put operations, while TreeMap offers log(n) time complexity due to its sorted nature.

When should I use a LinkedList over an ArrayList?

Use LinkedList when you need frequent insertions and deletions, especially in the middle of the list. For random access, prefer ArrayList.

Can you give me a code example for using these collections?

Sure! Here's a simple example:

ArrayList<String> arrayList = new ArrayList<>();
LinkedList<String> linkedList = new LinkedList<>();

arrayList.add("A");
linkedList.add("B");

This demonstrates how to create and add elements to both collections.