which one is performance wise advantageious from List,Set,Map?
- 6 Answers
- 10630 Views
- I also Faced
- E-Mail Answers
Answers were Sorted based on User's Feedback
Answer / debapriya
See HasMap is used when u want to use key value pair
If u r storing Any Objects the better u write ur code for
hascode implementation ,the better the the retrieval process is
Set maintains order,each time u add a object ,it checks
whether it exists or not calling equals which in turn calls
the hashcode method(x.equals(y) means x.hashcode==y.hashcode)
List --->in case if u use Vector or ArrayList since both of
them implenets RandomAccessInterface so retrieval is faster
but addition or deletion is slower
LinkedList --->deletion or insertion is faster but does not
implemet RandomAccess interface
| Is This Answer Correct ? | 4 Yes | 0 No |
Answer / r.jainrocks@gmail.com
hi Debapriya,
can u send me some more info on collection...
i.e.
In which kind of application Set is better
In which kind of application Map is better
In which kind of application List is better
just named those kind of applications
thanks in advance...
| Is This Answer Correct ? | 0 Yes | 0 No |
Answer / pkj
List : storing of data is fast but retrieval is slow.
Map : Stroing of data is slow. But retrieval is slow.
Set : Stroing of data is slow. But retrieval is slow.
Depending on the req the collection can be used
| Is This Answer Correct ? | 1 Yes | 2 No |
What is the default size of arraylist in java?
What is lambda programming?
What is Unicast and Multicast object? Where we will use?
1 Answers Scope International,
What do you mean by collectors in java 8?
How many boolean functions are there?
What is parsing and its types?
What is core java called?
Differentiate between class and structure.
Explain hashset and its features?
What is the purpose of default constructor?
What are the differences between stringbuffer and stringbuilder?
What is the use of bufferedreader?
Core Java 
