Difference Between ArrayList and Vector in Java
ArrayList
ArrayList in Java is a dynamic array implementation that belongs to the Java Collections Framework. This is a big array that grows on its own as more elements are added to it.
ArrayList class is defined in java.util package is quite commonly used for its ease of use and flexibility. They offer flexibility in that you do not need to determine the size of the ArrayList at the time of its creation, which is similar to standard arrays in Java. So, it is much more flexible than the traditional array.
The ArrayList in Java can also have duplicate elements. It implements the List interface so that we can use all the methods of the List interface here. The ArrayList maintains the insertion order internally.
To read more Java ArrayList
Vector
A Vector is like a dynamic array that can grow or shrink its size. Unlike an array, we can store n-number of elements in it as there is no size limit. It is a part of the Java Collection framework since Java 1.2. It belongs to java.util package and implements the List interface so that we can use all the methods of the List interface here.
It is recommended to use the Vector class in the thread-safe implementation only. If you do not need to use the thread-safe implementation, you should use the ArrayList; the ArrayList will perform better in such a case.
It is similar to the ArrayList, but with two differences-
- Vector is synchronized.
- Java Vector contains many legacy methods that are not part of the Collections framework.
To read more Java Vector
ArrayList Vs. Vector
| Feature | ArrayList | Vector |
|---|---|---|
| Thread Safety | ArrayList is not synchronized, which means multiple threads can access it at the same time. In a multithreaded setup, one thread can add elements while another might remove them. | The vector is synchronized, so only one thread can access it at a time. If one thread is working on it, others must wait their turn. It's safer but also slower in multithreaded environments. |
| Growth | ArrayList grows dynamically. When it runs out of space, it increases its size by 50% of its current capacity. | Vector also resizes automatically, but it grows by doubling its size, which can lead to more memory being used than necessary. |
| Performance | ArrayList performs faster for most operations, like adding, searching, or deleting elements. Since it does not have built-in synchronization, there's no delay from locking, which means better speed. | Vector is slower in comparison. Because it locks the whole structure during operations, other threads have to wait. The thread-safety comes at the cost of performance. |
| Legacy Status | ArrayList is modern, introduced in Java 1.2, and is part of the Collections Framework. It's commonly used in new Java programs. | Vector is an older class, around since Java 1.0. It's considered a legacy class and is rarely used in modern applications. |
| Element Traversal | ArrayList uses an iterator to loop through elements, which is how most modern Java collections work. | Vector supports both iterator and Enumeration, which is an older way of looping through elements in Java. |
ArrayList Example
Let's see a simple example where we are using ArrayList to store and traverse the elements.
Example
Compile and RunOutput:
Sonoo Michael James Andy
Vector Example
Let's see a simple example of a Java Vector class that uses the Enumeration interface.
Example
Compile and RunOutput:
Andrew Peter Jack
Subscribe to Tpoint Tech
We request you to subscribe our newsletter for upcoming updates.
We deliver comprehensive tutorials, interview question-answers, MCQs, study materials on leading programming languages and web technologies like Data Science, MEAN/MERN full stack development, Python, Java, C++, C, HTML, React, Angular, PHP and much more to support your learning and career growth.
Contact info
G-13, 2nd Floor, Sec-3, Noida, UP, 201301, India
Follow us
