What is the worst-case time complexity of the contains() method for an element present in an ArrayList?

The worst-case time complexity for contains() in ArrayList for a present element is O(n). This is because the method sequentially iterates through the elements until it finds a match.