Home/ Questions/Q 7997101
In Process

The Archive Base Latest Questions

Editorial Team
  • 0
Asked: 2026-06-04T14:53:20+00:00

I want to know the comparison between List and Set in terms of performance,memory

  • 0

I want to know the comparison between List and Set in terms of performance,memory allocation and usability.

If i don’t have any requirement of keeping the uniqueness in the list of objects, neither required the insertion order to be maintained, Can I use ArrayList and SortedSet/HashSet interchangeably?
Will it be good to directly use Collections class instead of even list/set?

P.S. I also don’t have any need for list or set specific functions provided by java.
I am using List/Set instead of Array only because they can dynamically grow without extra programming efforts.

Share

Leave an answer

You must login to add an answer.

Need An Account,

1 Answer

  1. Editorial Team

    If you don’t care about the ordering, and don’t delete elements, then it really boils down to whether you need to find elements in this data structure, and how fast you need those lookups to be.

    Finding an element by value in a HashSet is O(1). In an ArrayList, it’s O(n).

    If you are only using the container to store a bunch of unique objects, and iterate over them at the end (in any order), then arguably ArrayList is a better choice since it’s simpler and more economical.

    • 0