I am back here with some doubts of mine and hope that you all would surely give a thought on it and help me out.
I am hereby looking for what are the differences between arraylist and linklist and which one is better suited for what applications ??
I hope i get a good response to this query .This is relatively simply query but stll lots to explore on it.
Thanks in adavance,
ArrayList is just a mechanism to treat a container as a resizable array. If you've had a data structures class, you can decide what to use by your performance and complexity needs. It really depends on what what your application needs to do. Depending on that, you can decide which type of container is suitable for your program.
java.util.ArrayList also implements the List inteface but as resizable Array, because an Array must always have a known capacity there is a time factor involved in the resizing of the Array. ArrayList can be thought of as a non-synchronised Vector
Well, first of all, we don't really have a linked list in Java, strictly.
Actually, we do: the java.util.LinkedList class.
Is [ArrayList] implemented using a linked list? Probably. I think so. The point is who knows, and who cares.
Well, actually, it's not, and everyone knows, and everyone should care.
ArrayList is well-documented to use an array as a backing store. This has a very specific impact on its performance characteristics. Accessing the 37th element of an ArrayList is very fast. Deleting an element in the middle is slow. This is quite the opposite of how a linked list behaves. That's why there are both: so you can choose which to use based on what's important for your appplication.
So what it means is that there is just the difference of dynamisn between linklist and arraylist i.e arraylist size can be dynamically increased.I
Both an ArrayList and a LinkedList can have elements added to them and/or removed from them, so no, that's not the difference. The difference is the performance, as mentioned above and as described in more detail in the Javadocs. If you need to delete elements in the middle, use a LinkedList. If you need random access, then an ArrayList may be better. Note that LinkedLists have more memory overhead, too.
There are several good tutorials on collections, and a good starting place is SunsSun's collections tutorial. It should answer a lot of your questions.
Second, Sun does a great service by providing a (nearly) complete source code with the JDK. So you can look at the source and see exactly what is happening. If you look at the source for java.util.ArrayList, you'll see:
whereas for java.util.LinkedList, you'll see:
Obviously an ArrayList manages its data using an array, which means as it grows dynamically the array will have to be re-allocated from time to time. The LinkedList is a set of linked "Entry" instances.
Choosing the correct collection to use becomes easier as you become more familiar with Java, and seeing the source code can help you make that decision. You can also write a simple application that adds, searches for, iterates through and deletes a bunch of things using different collections, and then seeing how long each takes to run.
Good luck with Java, Saurabh ...