1.we know that LinkedList is faster than ARRAYLIST on insertion and deletion,For iterating to get data inside object arraylist is faster. Is it possible to use Linked list for insertion after how to convert that object to arraylist for iterating and then to Linked list for deletion? please send me some sample code....
2. How to convert a array details to arraylist and then reverse...
An ArrayList is *not* faster for iteration, only for *random access*.
You cannot really "convert" one type of list to another. What you can do is creating a new list with the elements of the old. Whether that's worth it depends on your usage scenario, of course.
Do you actually have a performance problem?
Take a look at Arrays.asList and Collection.toArray
The soul is dyed the color of its thoughts. Think only on those things that are in line with your principles and can bear the light of day. The content of your character is your choice. Day by day, what you do is who you become. Your integrity is your destiny - it is the light that guides your way. - Heraclitus