Data Structures and Algorithms in C | Set 1

Data Structures-Arrays, Dynamic Arrays, and Linked lists

DSA is a very important concept in any programming language. Suppose we have a lot of books, and we need to choose a bookshelf to organize all the books. We'll first check how many books we have, and then we'll assume how many more books we might buy in the future. Then, we'll think of a reasonable budget we can spend for the shelf. We'll check which one is strong and has a good life out of the filtered shelves. Finally, we'll buy the best one.

In programming, books refer to huge amounts of data we must deal with while writing code, the program we are writing is the room, and inside our program, we need to find a good storage spot to arrange all the data efficiently. A messy room is never any good.

In this series of tutorials, we'll cover all the data structures in C language and then about another topic-Algorithms.

Data Types and Data Structures:

These two words might have Data in common but are not the same. Simply, we can say that a data type is a characteristic of variables. It represents what kind of data/ value can be stored in a particular variable. C is a static language. Hence, we need to declare every variable we want to use in the program with its data type before using it.

On the other hand, a data structure is the collection and organization of data from different data types from which we can process and retrieve data. It deals with the arrangement of data in the computer's memory.

int, float, etc. are data types, and stacks, queues, etc. are examples of data structures.

There are different types of data structures available in C. We need to learn them to know which one to use when in need.

Here is a flowchart showing the classification in C based on the organization of the variables:

Data Structures and Algorithms in C | Set 1

Terminology:

Linear DS: Linear: line. If the elements in a data structure are stored sequentially, it is a linear data structure.
Static DS: If the memory or space in a data structure is fixed and can't be altered according to need at runtime, it is a static data structure.
Dynamic DS: The space or the memory in the data structure can be altered according to the need at runtime.

Facts:

A linear data structure is easy to traverse.
Accessing elements of a static data structure is easy
The space complexity of dynamic data structures is less, making them efficient.

Arrays:

An array is a collection of homogeneous elements at contiguous memory locations. The elements of an array can be accessed using indexes (0 to size-1). It can be multi-dimensional. It can store primitive and derived data typed elements, but all the elements should belong to the same data type. The aim of creating an array is to represent multiple same data-typed elements under one name.

Basic syntax:

Notable points:

There is no IndexOutOfBoundException in C; if we try to access an element from out of indexes available in the array, the compiler won't raise any error but gives garbage values.
Data type * name: An array of data-typed pointers. If we declare int * a, a is the name of an array that can consist of integer pointers.
Pointers: The name of the array indicates the address of the first element, and when passed to functions, arrays are always passed as pointers, even if we use square braces.
array[index] = *(array + index) = index[array] (commutative property)
Matrices: We can use multi-dimensional arrays to represent matrices-array[rows][columns].

Here is a program with all the basic operations on arrays:

#include<stdio.h>
int sum(int arr[]);
int *sort(int arr[]);
void main()
{
	//declaration
	int i, result;
	int a[5];
	int b[5] = {1, 2, 3, 4, 5};
	int c[5] = {};
	int *d;//array pointer(8 bytes)-stores integer pointers
	//Assigning elements to a[5]
	int j = 10;
	printf("a[5] = ");
	for(i = 0; i < 5; i++)
	{
		a[i] = j;
		j += 10;
		printf("%d ", a[i]);//Accessing elements
	}
	printf("\nOut of index a[5]: %d", a[5]);//garbage value
	//contiguous memory locations
	printf("\nArray elements are stored in contiguous locations:");
	for(i = 0; i < 5; i++)
	{
		printf("\n%p ", &a[i]);
	}
	//pointer indication
	printf("\nPointer indication:");
	printf("\n a[0] = %d", a[0]);
	printf("\n *a = %d", *a);
	printf("\nTraversing using pointer:");
	for(i = 0; i < 5; i++)
	{
		printf("\n%d ", *(a + i));
	}
	printf("\nBy commutative property a[i] = i[a] =");
	printf("\n a[2] = %d", a[2]);
	printf("\n 2[a] = %d", 2[a]);
	//Multi-dimensional arrays
	printf("\nMulti-dimensional array(4 X 4): \n");
	int multarr[4][4], k = 0;
	for(i = 0; i < 4; i++)
	{
		for(j = 0; j < 4; j++)
		{
			multarr[i][j] = k;
			k++;
			printf("%d ", multarr[i][j]);
		}
		printf("\n");
	}
	//passing array to a function
	result = sum(b);
	printf("Sum of elements of b[5] =  %d", result);
	int x[5] = {4, 1, 7, 2, 9};
	printf("\nSorting the array x: ");
	int n = sort(x);
	for(i = 0; i < 5; i++)
	{
		printf("%d ", x[i]);
	}	
} 
int sum(int arr[])
{
	int i, add = 0;
	for(i = 0; i < 5; i++)
	{
		add += arr[i];
	}
	return add;
}
int* sort(int *arr)
{
	int temp, i, j;
	for(i = 0; i < 4; i++)
	{
		for(j = 0; j < 4 - i - 1; j++)
		{
			if(arr[j] > arr[j + 1])
			{
				temp = arr[j];
				arr[j] = arr[j + 1];
				arr[j + 1] = temp;
			}
		}
	}
	return arr;
}

Output:

a[5] = 10 20 30 40 50
Out of index a[5]: 0
Array elements are stored in contiguous locations:
000000000062FDF0
000000000062FDF4
000000000062FDF8
000000000062FDFC
000000000062FE00
Pointer indication:
 a[0] = 10
 *a = 10
Traversing using pointer:
10
20
30
40
50
By commutative property a[i] = i[a] =
 a[2] = 30
 2[a] = 30
Multi-dimensional array(4 X 4):
0 1 2 3
4 5 6 7
8 9 10 11
12 13 14 15
Sum of elements of b[5] =  15
Sorting the array x: 1 2 4 7 9
--------------------------------
Process exited after 0.8778 seconds with return value 2
Press any key to continue . . .

Linked Lists:

A linked list is a linear data structure like an array, but the elements are not stored in contiguous memory locations. Every node/ element in the linked list has two sections-one with the data and the other with a pointer pointing to the next node's location. These pointers connect the nodes making a linked list linear. The address of the first node is stored in the head.

Notable Points:

A linked list is also used to implement other user-defined data structures like stack and queue.
The first node in a linked list is the head, and we must start all the operations on the linked list from it.
The last node of the linked list refers to Null, showing that the linked list is complete.

In C, a linked list is created using structures, and it also is homogeneous like an array, meaning it can only store data of the same data type in its nodes.

A simple linked list looks like this:

As shown in the above figure, the head is the first node, and the next (reference) part of the last node holds None.

A double-linked list looks like this:

In a double-linked list, every node will have three sections. Head holds the reference of the first node, the "previous" section of the first node holds None, and the next field of the last node refers to None. Each node will hold two references along with the data, one to its previous node and the next to the succeeding node.

Circular Linked List:

A circular linked list can be single or double:

Circular single linked list:

It is a single linked list, but the last node in the list holds the reference of the first node like a circle.

Circular Double-linked List:

It is a double-linked list, but the last node in the list holds the reference of the first node, and the 'previous' section of the first node holds the reference of the last node like a circle.

Here is a program showing some of the basic operations we can perform on a single linked list:

#include<stdio.h>
#include<stdlib.h>
//declaration of a linked list
struct Node{
	int data;
	struct Node* next;
};
//Definition of all functions
void displayLL(struct Node *ptr);
void InsertNodeAtBeg(struct Node* head, int value);
void InsertAfterNode(struct Node* head, int node_val, int value);
void InsertAtlast(struct Node* head, int value);
void DeleteBeg(struct Node* head);
void DeleteEnd(struct Node* head);
void DeleteMid(struct Node* head, int pos);
int main()
{
	//Nodes
	struct Node *head;
	struct Node *first;
	struct Node *second;
	struct Node *third;
	//Allocating dynamic memory
	first = (struct Node*)malloc(sizeof(struct Node));
	second = (struct Node*)malloc(sizeof(struct Node));
	third = (struct Node*)malloc(sizeof(struct Node));
	//Given data to the nodes and linking the nodes
	first->data = 1;
	first->next = second;
	second->data = 2;
	second->next = third;
	third->data = 3;
	third->next = NULL;
	head = first;
	//Calling the functions
	printf("The created Linked List: ");
	displayLL(head);
	printf("\n\nInsertions: ");
	InsertNodeAtBeg(head, 5);
	InsertAfterNode(head, 2, 10);
	InsertAtlast(head, 17);
	printf("\n\nDeletions:");
	DeleteBeg(head);
	DeleteEnd(head);
	DeleteMid(head, 3);
}
//displaying the linked list
void displayLL(struct Node *ptr)
{
	printf("HEAD -> ");
	while(ptr != NULL)
	{
		printf("%d -> ", ptr->data);
		ptr = ptr->next;
	}
	printf("NULL");
}
//Inserting a node at the beginning
void InsertNodeAtBeg(struct Node* head, int value)
{
	printf("\n\nAfter inserting %d at the beginning: ", value);
	struct Node* newnode;
	newnode = (struct Node*)malloc(sizeof(struct Node));
	displayLL(head);
	newnode->data = value;
	newnode->next = head;
	head = newnode;
	printf(" -----> ");
	displayLL(head);
}
//Inserting a node after the node with the given value
void InsertAfterNode(struct Node* head, int node_val, int value)
{
	printf("\n\nAfter inserting %d after %d node: ", value, node_val);
	displayLL(head);
	printf(" ----> ");
	struct Node* newnode;
	newnode = (struct Node*)malloc(sizeof(struct Node));
	newnode->data = value;
	struct Node* ptr = head;
	while(ptr != NULL)
	{
		if(ptr->data == node_val)
		{
			newnode->next = ptr->next;
			ptr->next = newnode;
			break;
		}
		ptr = ptr->next;
	}
	displayLL(head);
}
//Inserting a node at the end of the linked list
void InsertAtlast(struct Node* head, int value)
{
	printf("\n\nAfter inserting %d at the end: ", value);
	displayLL(head);
	printf(" ----> ");
	struct Node* newnode;
	struct Node* ptr = head;
	newnode = (struct Node*)malloc(sizeof(struct Node));
	newnode->data = value;
	newnode->next = NULL;
	while(ptr->next != NULL)
	{
		ptr = ptr->next;
	}
	ptr->next = newnode;
	displayLL(head);
}
//deleting the first node
void DeleteBeg(struct Node* head)
{
	printf("\n\nAfter deleting the 1st node: ");
	displayLL(head);
	printf(" ----> ");
	struct Node* temp = head->next;
	head = head->next;
	displayLL(head);
}
//Deleting the last node
void DeleteEnd(struct Node* head)
{
	printf("\n\nAfter deleting the last node: ");
	displayLL(head);
	printf(" ----> ");
	struct Node* ptr = head;
	while(ptr->next->next != NULL)
	{
		ptr = ptr->next;
	}
	ptr->next = NULL;
	displayLL(head);
}
//deleting from the middle
void DeleteMid(struct Node* head, int pos)
{
	printf("\n\nAfter deleting node from %d position: ", pos);
	displayLL(head);
	printf(" ----> ");
	int i;
	struct Node* temp = head;
	for(i=2; i< pos; i++)
	{
  		if(temp->next!=NULL)
		{
   			 temp = temp->next;
  		}
	}
temp->next = temp->next->next;
displayLL(head);
}

Output:

The created Linked List: HEAD -> 1 -> 2 -> 3 -> NULL

Insertions:

After inserting 5 at the beginning: HEAD -> 1 -> 2 -> 3 -> NULL -----> HEAD -> 5 -> 1 -> 2 -> 3 -> NULL

After inserting 10 after 2 node: HEAD -> 1 -> 2 -> 3 -> NULL ----> HEAD -> 1 -> 2 -> 10 -> 3 -> NULL

After inserting 17 at the end: HEAD -> 1 -> 2 -> 10 -> 3 -> NULL ----> HEAD -> 1 -> 2 -> 10 -> 3 -> 17 -> NULL

Deletions:

After deleting the 1st node: HEAD -> 1 -> 2 -> 10 -> 3 -> 17 -> NULL ----> HEAD -> 2 -> 10 -> 3 -> 17 -> NULL

After deleting the last node: HEAD -> 1 -> 2 -> 10 -> 3 -> 17 -> NULL ----> HEAD -> 1 -> 2 -> 10 -> 3 -> NULL

After deleting node from 3 position: HEAD -> 1 -> 2 -> 10 -> 3 -> NULL ----> HEAD -> 1 -> 2 -> 3 -> NULL

Dynamic Arrays:

Once we declare an array, its size will be fixed. It is a drawback because we might run into the need for more memory at runtime. Hence, dynamic arrays are introduced.

Unlike a normal array, dynamic arrays are expandable and shrinkable, providing random access to the elements.
Dynamic arrays are not the same as Variable length arrays. A variable length array is an array whose size is determined at runtime mostly by taking the size as input from the user.
Even in the case of variable length arrays, once the user gives the size, we can't modify it.
Regular arrays and variable-length arrays are allocated on the stack, whereas dynamic arrays are allocated on the heap.
C language doesn't support built-in dynamic arrays, but we can use dynamic memory allocations (DMA).

There are 4 built-in dynamic memory allocation functions available:

1. malloc():

malloc stands for memory allocation.
Syntax: (type*) malloc(size)
If we call the malloc function with n bytes reserves one large block of memory with n bytes. It returns a void pointer pointing to the first byte, which we can cast into any data type we want - (type*).
If the available space is insufficient, the allocation fails and returns a NULL pointer.
Each block is initialized with garbage values.

2. calloc():

calloc stands for contiguous allocation.
It is similar to malloc().
Syntax: (type*)calloc(count, size)
count is the number of elements, and size refers to the size of each element.
If we call the calloc function with m count and n bytes, it allocates m number of n-sized blocks.
Each block is initialized with 0.

In both malloc() and calloc(), the memory is allocated in one place contiguously. Hence, it is possible to create dynamic arrays.

Here is an example program to show the difference between malloc() and calloc() allocations:

#include<stdio.h>
#include<stdlib.h>
void main()
{
	int *ptr1, *ptr2, n1, n2, i;
	printf("Enter the number of elements in the first D-array: ");
	scanf("%d", &n1);
	printf("Enter the number of elements in the second D-array: ");
	scanf("%d", &n2);
	//initialization
	ptr1 = (int*)malloc(sizeof(int)*n1);
	ptr2 = (int*)calloc(n2, sizeof(int));
	//Initial values
	printf("\nInitial values: ");
	printf("\nBy malloc(): ");
	for(i=0;i<n1;i++)
	{
		printf("%d ", *(ptr1 + i));
	}
	printf("\nBy calloc(): ");
	for(i=0;i<n1;i++)
	{
		printf("%d ", *(ptr2 + i));
	}
	//Allocated addresses
	printf("\n\nMemory allocations: ");
	printf("\nBy malloc(): ");
	for(i=0;i<n1;i++)
	{
		printf("%d ", ptr1 + i);
	}
	printf("\nBy calloc(): ");
	for(i=0;i<n1;i++)
	{
		printf("%d ", ptr2 + i);
	}
}

Output:

Enter the number of elements in the first D-array: 5
Enter the number of elements in the second D-array: 5

Initial values:
By malloc(): 11901584 0 11862352 0 1936028257
By calloc(): 0 0 0 0 0

Memory allocations:
By malloc(): 11867904 11867908 11867912 11867916 11867920
By calloc(): 11867936 11867940 11867944 11867948 11867952

3. free():

It is used to explicitly de-allocate the memory of dynamic memory allocations. For regular variables, memory is released automatically at runtime. We need to use free() in the case of DMA for all the reserved memory to be released.
Syntax: free(ptr)
ptr refers to the pointer previously allocated using malloc or calloc.

4. realloc():

realloc stands for reallocation.
It is used to dynamically re-allocate the allocated dynamic memory.
Suppose we use malloc or calloc and reserve some memory, which is insufficient; we can reserve more memory using realloc.
Syntax: realloc(ptr, newsize)
ptr refers to the pointer previously allocated using malloc or calloc.

Suppose we created a regular array with size n, and we decided we didn't need the first element at runtime. We shift all the elements to the left by removing the first element. It will not change the array size, and the empty spot is never gone.

In the case of dynamic arrays, we can use realloc() to shrink the array. Here is an example to demonstrate the phenomenon:

#include<stdio.h>
#include<stdlib.h>
void main()
{
	int *ptr, n, arr[n], i;
	printf("Enter the size: ");
	scanf("%d", &n);
	//Creating a dynamic array
	ptr = (int*)malloc(sizeof(int)*n);
	printf("\nThe memory allocations in a regular array: ");
	for(i = 0; i < n; i++)
	{
		printf("%d ", &arr[i]);
	}
	printf("\nThe memory allocations in the dynamic array: ");
	for(i = 0; i < n; i++)
	{
		printf("%d ", &ptr[i]);
	}
	//Removing the first element
	for(i = 1; i < n; i++)
	{
		arr[i - 1] = arr[i];
		ptr[i - 1] = ptr[i];
	}
	printf("\n\nAfter removing the first element:");
	printf("\nRegular array: ");
	for(i = 0; i < n; i++)
	{
		printf("%d ", &arr[i]);
	}

	printf("\nDynamic array: ");
	//Shrinking the memory of the dynamic array
	int t = n - 1;
	ptr = realloc(ptr, (t)*sizeof(int));
	for(i = 0; i < t; i++)
	{
		printf("%d ", &ptr[i]);
	}
	free(ptr);
}

Output:

Enter the size: 6

The memory allocations in a regular array: 6487264 6487268 6487272 6487276 6487280 6487284
The memory allocations in the dynamic array: 12130048 12130052 12130056 12130060 12130064 12130068

After removing the first element:
Regular array: 6487264 6487268 6487272 6487276 6487280 6487284
Dynamic array: 12130048 12130052 12130056 12130060 12130064
--------------------------------
Process exited after 2.795 seconds with return value 1
Press any key to continue . . .

We can't use sizeof() on a dynamic array. It only returns the size of the beginning pointer.
We need to use the free() function to explicitly de-allocate the memory.

Conclusion:

This is the first tutorial on Data structures and algorithms in C.

In this tutorial, we covered:

Difference between Data type and Data structures
Arrays
Linked lists
Dynamic arrays-DMA in C

Programs with all the basic operations and explanations are implemented for better understanding. In the next tutorial, we'll carry on with stacks and queues.

Next TopicData Structures and Algorithms in C|Set-2

← prev next →