Sr No.
|
Array
|
Link List
|
1
|
An array is a
collection of similar data type
|
A link list a
collection of similar objects which may have array
|
2
|
Space allocation continuous
|
Space allocation random
|
3
|
Element of an array
is access through its index
|
|
4
|
Array is an example of static memory
allocation
|
Link list is an example of dynamic
memory allocation
|
5
|
Size of array cannot
change once it has declared
|
Size of link is
dynamic and increase or decrease run as requirement
|
6
|
When number of element store in array
less than its capacity then it lead memory wasted.
|
Because link list is dynamic So space allocated
as number of element.
|
7
|
Traversing (access
items) is random.
|
Traversing is sequential
|
8
|
Backward Traversing possible
|
Only one direction of traversing is possible
|
9
|
Address can be
mathematically calculated due to continuous space allocation
|
Address prediction
not possible due to random space allocation
|
10
|
Types of array are one dimension, two dimension and multi dimension
|
Types of Link list are Single, Double and circular
|
11
|
Element of array is
access through its name
|
Element of link list
access through pointer
|
Wednesday, 18 October 2017
Array vs Link List
I am a programmer and the founder of Girfa IT Services, working in the field of technology since 2009. I started my career as a computer teacher, which was my full-time profession for nearly 10 years. After a decade of teaching, I decided to turn my passion for programming into my full-time career, while continuing teaching as a part-time activity. In real life, I consider myself a bit lazy—and I have actually turned that laziness into my programming philosophy! I always try to build reusable components, tools, and solutions instead of writing the same code repeatedly. This has become one of my key strengths as a programmer and helps me save time, reduce repetitive work, and build applications more efficiently. For me, programming is not just about writing code; it is about finding smarter, simpler, and reusable ways to solve problems. I believe that a good programmer should not only make things work, but should also make them easier to maintain, reuse, and improve.
Subscribe to:
Post Comments (Atom)

No comments:
Post a Comment