Difference Between Array and Linked List
What is Array ?
An array is a fundamental data structure in computer science and programming that represents a collection of elements, all of the same data type, stored in contiguous memory locations. Each element in an array is identified by its index or position, which starts from 0 for the first element and increments sequentially.
Arrays provide fast and direct access to individual elements based on their indices, making them suitable for tasks that involve searching, sorting, and retrieving data by position. They are typically used when you have a fixed or known size for your data, and you need efficient random access to elements.
It's important to note that in many programming languages, arrays have a fixed size when declared. If you need a dynamically resizable collection of elements, you might use other data structures like lists (in Python), ArrayLists (in Java), or Vectors (in C++) , which are often implemented as dynamic arrays.
Example of Integer Array in C++
#include <iostream>
int main()
{
int myArray[5];
myArray[0] = 10;
myArray[1] = 20;
myArray[2] = 30;
myArray[3] = 40;
myArray[4] = 50;
// Access and print individual elements of the array
std::cout << "Element at index 0: " << myArray[0] << std::endl;
std::cout << "Element at index 1: " << myArray[1] << std::endl;
std::cout << "Element at index 2: " << myArray[2] << std::endl;
std::cout << "Element at index 3: " << myArray[3] << std::endl;
std::cout << "Element at index 4: " << myArray[4] << std::endl;
return 0;
}
What is Linked List ?
A linked list is a fundamental data structure in computer science and programming that consists of a collection of nodes. Each node in a linked list contains two main components :
1. Data : This component holds the actual value or data that you want to store in the linked list, such as an integer, a string, or any other data type.
2. Reference (or Pointer ) : This component contains a reference or pointer to the next node in the sequence. In some cases, a linked list node may also contain a reference to the previous node in a doubly linked list.
Linked lists do not store their elements in contiguous memory locations, unlike arrays. Instead, they use these references or pointers to connect the nodes together, forming a chain-like structure. This allows for efficient insertions and deletions at any position in the list without the need for shifting elements, which can be a disadvantage of arrays.
There are various types of linked lists, including singly linked lists, doubly linked lists, and circular linked lists, each with its own characteristics and use cases. Linked lists are particularly useful when you need a dynamic data structure that can grow or shrink as needed or when you require efficient insertions and deletions at various positions within the list.
Example of Linked List in C++
#include <iostream>
// Define a Node structure for the linked list
struct Node
{
int data;
Node* next;
Node(int value) : data(value), next(nullptr) {}
};
class LinkedList
{
private:
Node* head; // Points to the first node in the list
public:
LinkedList() : head(nullptr) {}
void insert(int value)
{
Node* newNode = new Node(value);
newNode->next = head;
head = newNode;
}
void display()
{
Node* current = head;
while (current != nullptr)
{
std::cout << current->data << " -> ";
current = current->next;
}
std::cout << "nullptr" << std::endl;
}
};
int main()
{
LinkedList myList;
myList.insert(10);
myList.insert(20);
myList.insert(30);
std::cout << "Linked List: ";
myList.display();
return 0;
}