Differences between arrays and linked list

List out differences between arrays and linked list

The difference between arrays and linked lists are:

- Arrays are linear data structures. Linked lists are linear and non-linear data structures.
- Linked lists are linear for accessing, and non-linear for storing in memory
- Array has homogenous values. And each element is independent of each other positions. Each node in the linked list is connected with its previous node which is a pointer to the node.
- Array elements can be modified easily by identifying the index value. It is a complex process for modifying the node in a linked list.
- Array elements can not be added, deleted once it is declared. The nodes in the linked list can be added and deleted from the list.

Explain the term enumerations in C
A set of named integer constants is known as an enumeration. The enumeration type declaration includes the name of the enumeration tag.....
Storage allocation and scope of global, extern, static, local and register variables
The storage allocation / class determine the memory part where the storage space is allocated for variables, functions and how long the allocation of storage continues to exist......
Register variables. Advantages of using register variables
The variables of ‘register’ type modifier will inform the compiler for storing the variables in a register of CPU....
Post your comment
Discussion Board
datastructure
Very useful. I like this so much...
Shraddha Latne 08-16-2014
Array Vs. Linked List
Nice article. I think this might be helpful to you all. I have found a quality article http://freefeast.info/general-it-articles/difference-between-array-and-linked-list-array-vs-linked-list/.
Hope this is of use to you. Keep commenting every author needs motivation.
Nikhil 07-9-2013