What are the advantages and disadvantages of using ArrayList in Java?

Advantages of using ArrayList in Java:

• Dynamic size: ArrayList automatically expands when elements are added, unlike regular fixed-size arrays.
• Fast index access: provides access to elements in constant time O(1).
• Convenient methods: offers many methods for adding, removing, searching, and sorting elements.
• Compatibility with collections: easily integrates with other classes from the Java Collections Framework.

Disadvantages of ArrayList:

• Slow removal and insertion in the middle: insertions or deletions of elements not at the end of the list require shifting elements, which takes O(n) time.
• Not thread-safe: requires additional synchronization when working in a multithreaded environment.
• Stores objects, not primitives: for primitive types (int, double, etc.), boxing into objects (e.g., Integer) occurs, which can affect performance and memory consumption.

Example of using ArrayList:

import java.util.ArrayList;

public class Example {
    public static void main(String[] args) {
        ArrayList<String> list = new ArrayList<>();
        list.add("apple");
        list.add("banana");
        list.add("cherry");

        System.out.println(list.get(1)); // banana

        list.remove(0); // remove "apple"

        for (String fruit : list) {
            System.out.println(fruit);
        }
    }
}

Thus, ArrayList is convenient for dynamic lists with frequent read and append operations, but less efficient for frequent insertions or deletions in the middle of the collection.