-
Arrays/Linked List
When and on what conditions will you decide whether to use linked lists or arrays, also Which process is fastest and which is slowest in arrays as well as linked list i.e, sorting, searching, add, delete etc.
Read Best Answer
Editorial / Best Answer
Aqan12- Member Since Apr-2010 | Jun 13th, 2010
Memory:
When you create an array you allocate all the memory while initializing the array, so if you had an array of 1000 Objects, you'd allocate space to hold 1000 object references as soon as you initialize the array.LinkedList on the other hand extends dynamically as the objects are added to the linked list.
Accessing Elements:
Arrays are useful if you are going to access elements using the index. if you need to access the 100th element you can directly access it by a[100].To access 100th element in a LinkedList you'll have to traverse 99 elements to reach the 100th element.
LinkedList can handle addition/deletion of elements better then arrays and that's one of the most powerful feature of LL over arrays.
Adding/Inserting Elements:
Array is fixed size; to add a number of elements greater then the size of the array you'd have to copy the array into a new bigger array.To insert an element in the middle of an array all the elements after the inserted element would have to moved up one index.
LinkedList can grow dynamically.
Deleting Elements:
To delete an element from Array you'd have to move down all the elements after the deleted element.LinkedList elements can be deleted dynamically.
To summarize, LinkedList can handle manipulation of data structure much better and efficiently manage memory but arrays have better accessibility when accessing elements by index.
Search and Sort would be similar performance on both.jamesjohnney
- Aug 12th, 2010
In all way Linked list is best then Arrays, since its a next level of Array 1. Linked list is dynamic allocation where as Arrays are not 2. We can get and set the value with the use of get, set method...
Anubhavs
- Aug 6th, 2010
Linked list is best under the feature of the manipulation e.g. insertion, deletion etc. In the other way the array will go through a good way if we focus on the accessibility.
-
Mutithreading
How synchronization can be done for multithreading environment without using the "synchronized" keyword?
Aqan12
- Apr 13th, 2010
Use java.util.concurrent package Lock mylock;try{ mylock.lock(); //critical section}finally{ mylock.unlock();} Also: try a lock with a timeout trylock() wait for some condition: condition.await() these could come handy to avoid the deadlock situations.
kvrprasadmca
- Apr 7th, 2010
We can achieve by using thread-safe collection objects like vector and all.
-
What is the difference between bubble sort & quick sort?
aahwini m
- Feb 8th, 2016
Quicksort is faster than bubble sort and the main difference is time complexity.
Aqan12
- May 26th, 2010
Bubble sort is a very simple algorithm which compares two neighbouring elements and swaps them if they are not in the right order. In a worst case scenario when the list is alrea...
-
When you have an object passed to a method and when the object is reassigned to a different one, then is the original reference lost
Aqan12
- Jun 4th, 2010
Primitives are always passed by value.Objects: Passed by value of reference. i.e. a copy of reference is passed into the method. Any changes to the reference itself will not be visible outside the met...
Scorpio_
- May 7th, 2010
Mr Ashutosh Gupta,Java is pass-by-value. For primitives, you pass a copy of the actual value. For references to objects, you pass a copy of the reference. You never pass the object. All objects are stored on the heap. Always http://www.javaranch.com/campfire/StoryPassBy.jsp
