Go Premium for a chance to win a PS4. Enter to Win

x
?
Solved

Regarding LinkedList and ArrayList

Posted on 2011-09-19
5
Medium Priority
?
318 Views
Last Modified: 2012-08-14
Hi Friends,
Recently I saw one article regarding list implementations i.e  For LinkedList get is O(n) and
For ArrayList get is O(1) please explain the difference between them?
0
Comment
Question by:PrakashVarma
  • 4
5 Comments
 
LVL 47

Accepted Solution

by:
for_yan earned 2000 total points
ID: 36558864
In LinkedList in order to get to element number n you need to traverse other elements - therefore the longer the list the more time t takes to get to element with certain number
This means O(m) - the time is proportional to the number of elements

In the ArrayList you just calculate where is your element with the number n and immediately go there - therefore the
time to get to certain element does not dpend on the length of the list - this means O(1) - the time is constant - indpendent of the numebr of elements

 
0
 
LVL 47

Expert Comment

by:for_yan
ID: 36558870

see
http://en.wikipedia.org/wiki/Time_complexity

about time complexity of algrorithms in computation
0
 
LVL 47

Assisted Solution

by:for_yan
for_yan earned 2000 total points
ID: 36558887

Imagine say list of elements where each element tells you where is the next element - the longer will be such lsit the more time on average you would need
to get to sertain element

 On the other hand imagine list of elements which has an index which tells where is the location of each elemet - then by number of element
you can calculate where is the address of particular element and no matter how long is the list this calculation will take the same time

This is analogy which corresponds to LinkedLst and ArrayList
 
0
 
LVL 47

Assisted Solution

by:for_yan
for_yan earned 2000 total points
ID: 36558903
On the other hand if you want to insert element into certain position - in case of ArrayList you'll have to
shift all elements say upwards to make the space for the new element - so the longer list you have it will take longer time

In LinkedList you just need to chenge the pointers of two neighboring elements and the time it takes to insert
element into any pposition will be the same.

Therefore if you have really long lists where most of the time you need to insert new elements
then you want to use linkedlist . If you have long lists and you populate it just once and then you want
mostly to read elements - then ArrayList would be more efficient.

Of course if lists are short - then all of it is not so much relevant, but when you get in many thousads of elements
then it becomes significant
 
0

Featured Post

What does it mean to be "Always On"?

Is your cloud always on? With an Always On cloud you won't have to worry about downtime for maintenance or software application code updates, ensuring that your bottom line isn't affected.

Question has a verified solution.

If you are experiencing a similar issue, please ask a related question

Java had always been an easily readable and understandable language.  Some relatively recent changes in the language seem to be changing this pretty fast, and anyone that had not seen any Java code for the last 5 years will possibly have issues unde…
Introduction This article is the second of three articles that explain why and how the Experts Exchange QA Team does test automation for our web site. This article covers the basic installation and configuration of the test automation tools used by…
The viewer will learn how to implement Singleton Design Pattern in Java.
Viewers will learn how to properly install Eclipse with the necessary JDK, and will take a look at an introductory Java program. Download Eclipse installation zip file: Extract files from zip file: Download and install JDK 8: Open Eclipse and …
Suggested Courses

876 members asked questions and received personalized solutions in the past 7 days.

Join the community of 500,000 technology professionals and ask your questions.

Join & Ask a Question