arrays are linear data structure
while linked lists are linear and non-linear
in case of linked list :-from point of access strategy it 
is linear and from point of storage strategy it is non 
linear

Array is a simple sequence of numbers which are not 
concerned about each-others positions. they are independent 
of each-others positions. adding,removing or modifying any 
array element is very easy.Compared to arrays ,linked list 
is a comlicated sequence of numbers.each number in the 
linked list is connected to its previous & next no. via a 
link which is nothieng but a pointer.Addition,removal of 
no.s in linked list is related to this pointer direction & 
linking that no. to the no. which is already present in the 
list.

In arrays v cant delete elements in middle but in Linked 
list v can do this.

>Array is a simple sequence of numbers which are not 
>concerned about each-others positions. 
This is not true, what about arrays of objects ? They may be
concerned about each other in some way.

>adding,removing or modifying any array element is very >easy.
This is untrue also, adding, removing elements in array is
significantly more complex than removing or adding elements
in linked list. This is because removing elements from array
causes all elements after it to be shifted back, whereas
with linked list, its merely traversing the list to find the
node, previous node, and the next node and setting pointers,
and inserting element into array will probably call for 
1) resizing the whole array size (ie. assingning a new,
bigger memory chunk for it)
2) copying elements from the former smaller array to the new
- bigger one.
This is a huge trade off, provided that in list, its simply
matter of setting the NEXT pointer of one of the nodes.

Main differences between the two are:
1) arrays are RANDOM ACCESS structures, where you can access
elements in random/indexed manner, whereas list is a
sequential access structure. This makes such algorithms like
heap sort or binary search to work much faster on arrays
2) arrays are static/fixed size whereas lists are dynamic
size structures. It means that when creating an array (both
on stack or heap), you HAVE to specify its size. With lists,
you just create an empty list and freely expand it
3) array consist of continuous chunks of memory, ie. nth
element is at the memory location of :
address_of_array + sizeof(array_element_type) * n
this always holds true, that is why following will always work :
for(int i=0;i < ARRAY_SIZE; i++)
  cout << *(array++);
List is a sequence of nodes, connected by NEXT pointers, so
consequent nodes may lie WHEREVER in memory

the main differance between arrays and linked list is:

In array we follow static memory allocation.
i.e we assign memory to the particular element in advance.


in linked list -> dynamic memory allocation.
i.e we assign memory to the particular element at run-time..


hence we reserve only the amount of memory which is 
required.

there is no problem of memory shortage or wastage, in 
linked list. which we very frequently come accross in the 
arrays..

Both are nothing but the data structures where in arrays 
data can be accessed using subscript but in linked list 
data can be accessed by the pointer present in its previous 
node...

in a linked list data are accessed by a means of pointer 
WHILE linear array accessed by a means of subcript
  insertion, deletion is very easy with linear array while 
in a linked list is a little bits complex

an array is changable length.a list does not.

1.array is fixed length and Array is a simple sequence of 
numbers which are not concerned about each-others positions
but linked list is variable length
2.in array values are accessing easy but linked list is 
some time taken process bcoz search aither forword or 
backword
3.in array updating operations are time taken comparing 
with linkedlist
4.array is not growble and linkedlist is growble

the main difference is that in array data is not linked to 
each other but in linked lists data is connected to each 
other as every node is connected to previous node.

All elements of array stored in contiguous memory location.
While in case of linked list each node does not stored in 
contiguous memory location

1)Array has a static storage where as in linked list it is 
dynamic.
2)To add some elements in an array is impossible since the
size is predefined.For the same case we can add elements at
the beginning,in the middle and also in the end.
3)To access the data from array is very easy while to access
data from linked list is some complex.

In array,memory is managed randomly...
but, in linked list memory is managed in a heap concept..

array is easy to understand bt linked list -very difficult .

Arrays
Strengths

1.Easy to use
2.No memory management needed
3.Can access any element by index
4.Fairly quick to loop
Weaknesses

1.Static size (can’t increase the size)
2.Most likely not enough or too much memory (you never know
how many elements are needed)
Linked Lists
Strengths

1.Dynamic size (can increase or decrease the list)
2.No memory is wasted
Weaknesses

1.Lots of overhead code (lots of malloc calls and assigning
pointers)
2.Must traverse entire list to go to the nth node.
Now I know that other languages such as C# and Java have
better data structures than arrays and linked lists (like
ArrayLists and Vectors), but this is for the C language and
it doesn’t have those. So based on what you’ve read above
you can decide which is better for the job needed. Neither
arrays nor linked lists are better but they do have their
specific purposes.