Why arraylist is not efficient for manipulation?
- 1 Answers
- 939 Views
- I also Faced
- E-Mail Answers
Answer / Avinash Kumar Shahi
ArrayLists can become inefficient when manipulating the collection often (e.g., adding, removing, or reordering elements), especially if the current size of the arraylist is much larger than its capacity and requires frequent resizing.
| Is This Answer Correct ? | 0 Yes | 0 No |
What is a stable sort?
an array of size N in which every number is between 1 and N, determine if there are any duplicates in it. You are allowed to destroy the array if you like. [ I ended up giving about 4 or 5 different solutions for this, each supposedly better than the others ].
Define level of the tree?
Is arraylist synchronized?
What type of memory allocation is referred for Linked lists?
What is the function of stack?
What is data algorithm?
Who invented data structure?
Define disjoint set adt?
Define threaded binary tree.
What is the limit of arraylist?
In which data structure, elements can be added or removed at either end, but not in the middle?
42 Answers Infosys, NIC, TTA, Wipro,
Windows 
