Which is faster hashmap or arraylist

Anonymous, that's the difference and aticle says diference between ArrayList and HashMap. To add on that there are couple of others, which are worth noting : 1 HashMap has load factor to decide when to resized but ArrayList doesn't have load factor.

Hello Prachi, if you just want to store an object than use ArrayList, if you have a mapping e. Feel free to comment, ask questions if you have any doubt. Pages Home core java spring online courses thread java 8 coding sql books oop interview certification free resources best.

Difference between ArrayList and HashMap in Java One of the most critical differences between the HashMap and ArrayList class is that the former is the implementation of the hash table while the latter is a dynamic array that can resize itself.

Though both are used to store objects they are completely different in their implementation, working, and usage. If your application spends only a fraction of its time accessing your data in this way then, frankly, the implementation of HashMap or ArrayList may not even matter one iota. The only way anybody can say that this detail is important for performance is by profiling your application.

Trying to first find and then fix a reason for a big application being slow is often a big task. Show 1 more comment. Active Oldest Votes. So finally, to answer your question, my advice is to use the HashMap.

BalusC 1. I think Set has the same performance with ArrayList?? Set is an interface. HashSet is an implementation that will overall perform better here. TreeSet will perform between the two, but guarantee order on top of uniqueness. JohnGaughan nitpick clarification: TreeSet guarantees natural order. LinkedHashSet guarantees insertion order. I believe the ArrayList considerations are quite inaccurate, from the documentation: "The size, isEmpty, get, set, iterator, and listIterator operations run in constant time.

The add operation runs in amortized constant time, that is, adding n elements requires O n time. All of the other operations run in linear time roughly speaking. The constant factor is low compared to that for the LinkedList implementation. Why are immutable objects in HashMap so effective? Why null is not allowed in ConcurrentHashmap? Does ConcurrentHashMap allow null keys and null values? Difference between remove and clear methods in HashMap.

Is hashcode method invoked internally when calling get and put method in Java? How hash collision is handled in HashMap? What are the interfaces that TreeMap implements? What interfaces that HashMap implements? Big O notation for TreeMap in Java. Is TreeMap synchronized in Java? Does TreeMap allow null key? Key object constraints on a TreeMap. Does IdentityHashMap use hashcode method?

Does EnumMap allow null key? What design pattern that Collections. What is a ConcurrentSkipListMap? Data Structures. Operating System. Computer Network. Compiler Design. Computer Organization. Discrete Mathematics. Ethical Hacking. Computer Graphics. Software Engineering. Web Technology. Cyber Security. C Programming.