which one is performance wise advantageious from List,Set,Map?
Answer Posted / 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 |
Post New Answer View All Answers
Difference between static and dynamic class loading.
Can long be null in java?
What is return type in java?
What are inner classes or non static nested classes in java?
Why unicode is important?
Can you explain the cs option of java interpreter?
What is int lol?
Explain about version control?
What do you understand by copy constructor in java?
What is difference between == equals () and compareto () method?
Can we write any code after throw statement?
What is the purpose of the System class?
What's the access scope of protected access specifier?
What is the final field modifier?
Can we sort list in java?