Category Archives: Data Structure Tutorial

Data Structure Tutorial

Counting Sort Algorithm

Counting Sort Program In C

#include <stdio.h>  

void counting_sort(int A[], int k, int n)

{

    int i, j;
    int B[15], C[100];

    for (i = 0; i <= k; i++)
        C[i] = 0;

    for (j = 1; j <= n; j++)
        C[A[j]] = C[A[j]] + 1;

    for (i = 1; i <= k; i++)
        C[i] = C[i] + C[i-1];

    for (j = n; j >= 1; j--)
    {
        B[C[A[j]]] = A[j];
        C[A[j]] = C[A[j]] - 1;
    }
    printf("Elements after sorting: ");
    for (i = 1; i <= n; i++)
        printf("%d ", B[i]);
}

int main()
{

    int n, k = 0, A[15], i;

    printf("Enter number of elements: ");
    scanf("%d",&n);

    printf("Enter %d integer numbers\n", n);

    for (i = 1; i <= n; i++)
    {
        scanf("%d", &A[i]);
        if (A[i] > k) {
            k = A[i];
        }
    }
    
    counting_sort(A, k, n);
    printf("\n");

    return 0;

}

#include <stdio.h>

void counting_sort(int A[], int k, int n)

{

int i, j;

int B[15], C[100];

for (i = 0; i <= k; i++)

C[i] = 0;

for (j = 1; j <= n; j++)

C[A[j]] = C[A[j]] + 1;

for (i = 1; i <= k; i++)

C[i] = C[i] + C[i-1];

for (j = n; j >= 1; j--)

{

B[C[A[j]]] = A[j];

C[A[j]] = C[A[j]] - 1;

}

printf("Elements after sorting: ");

for (i = 1; i <= n; i++)

printf("%d ", B[i]);

}

int main()

{

int n, k = 0, A[15], i;

printf("Enter number of elements: ");

scanf("%d",&n);

printf("Enter %d integer numbers\n", n);

for (i = 1; i <= n; i++)

{

scanf("%d", &A[i]);

if (A[i] > k) {

k = A[i];

}

counting_sort(A, k, n);

printf("\n");

return 0;

}

Output:-

counting_sort_program_in_c

Heap Sort Algorithm

Heap Sort Program In C

#include<stdio.h>
void heapsort(int[],int);
void heapify(int[],int);
void adjust(int[],int);
main() {
	int n,i,a[50];
	printf("Enter number of elements: ");
	scanf("%d",&n);
	printf("Enter %d integer numbers\n", n);
	for (i=0;i<n;i++)
	  scanf("%d",&a[i]);
	heapsort(a,n);
	printf("Elements after sorting: ");
	for (i=0;i<n;i++)
	  printf(" %d",a[i]);
	printf("\n");
}
void heapsort(int a[],int n) {
	int i,t;
	heapify(a,n);
	for (i=n-1;i>0;i--) {
		t = a[0];
		a[0] = a[i];
		a[i] = t;
		adjust(a,i);
	}
}
void heapify(int a[],int n) {
	int k,i,j,item;
	for (k=1;k<n;k++) {
		item = a[k];
		i = k;
		j = (i-1)/2;
		while((i>0)&&(item>a[j])) {
			a[i] = a[j];
			i = j;
			j = (i-1)/2;
		}
		a[i] = item;
	}
}
void adjust(int a[],int n) {
	int i,j,item;
	j = 0;
	item = a[j];
	i = 2*j+1;
	while(i<=n-1) {
		if(i+1 <= n-1)
		   if(a[i] <a[i+1])
		    i++;
		if(item<a[i]) {
			a[j] = a[i];
			j = i;
			i = 2*j+1;
		} else
		   break;
	}
	a[j] = item;
}

#include<stdio.h>

void heapsort(int[],int);

void heapify(int[],int);

void adjust(int[],int);

main() {

int n,i,a[50];

printf("Enter number of elements: ");

scanf("%d",&n);

printf("Enter %d integer numbers\n", n);

for (i=0;i<n;i++)

scanf("%d",&a[i]);

heapsort(a,n);

printf("Elements after sorting: ");

for (i=0;i<n;i++)

printf(" %d",a[i]);

printf("\n");

}

void heapsort(int a[],int n) {

int i,t;

heapify(a,n);

for (i=n-1;i>0;i--) {

t = a[0];

a[0] = a[i];

a[i] = t;

adjust(a,i);

}

void heapify(int a[],int n) {

int k,i,j,item;

for (k=1;k<n;k++) {

item = a[k];

i = k;

j = (i-1)/2;

while((i>0)&&(item>a[j])) {

a[i] = a[j];

i = j;

j = (i-1)/2;

}

a[i] = item;

}

void adjust(int a[],int n) {

int i,j,item;

j = 0;

item = a[j];

i = 2*j+1;

while(i<=n-1) {

if(i+1 <= n-1)

if(a[i] <a[i+1])

i++;

if(item<a[i]) {

a[j] = a[i];

j = i;

i = 2*j+1;

} else

break;

}

a[j] = item;

}

Output:-

heap_sort_program_in_c

Merge Sort Algorithm

Merge Sort Program In C

#include<stdio.h>
 
void mergesort(int a[],int i,int j);
void merge(int a[],int i1,int j1,int i2,int j2);
 
int main()
{
    int nums[30],n,i;
    
    printf("Enter no of elements:");
    scanf("%d",&n);
    
    printf("Enter %d integer numbers\n", n);
    
    for(i=0;i<n;i++)
    scanf("%d",&nums[i]);
    
    mergesort(nums,0,n-1);
    
    printf("Elements after sorting: ");
    
    for(i=0;i<n;i++)
    printf("%d ",nums[i]);
    
    return 0;
}
 
void mergesort(int a[],int i,int j)
{
int mid;
if(i<j)
{
mid=(i+j)/2;
mergesort(a,i,mid); //left recursion
mergesort(a,mid+1,j); //right recursion
merge(a,i,mid,mid+1,j); //merging of two sorted sub-arrays
}
}
 
void merge(int a[],int i1,int j1,int i2,int j2)
{
int temp[50]; //array used for merging
int i,j,k;
i=i1; //beginning of the first list
j=i2; //beginning of the second list
k=0;
while(i<=j1 && j<=j2) //while elements in both lists
{
if(a[i]<a[j])
temp[k++]=a[i++];
else
temp[k++]=a[j++];
}
while(i<=j1) //copy remaining elements of the first list
temp[k++]=a[i++];
while(j<=j2) //copy remaining elements of the second list
temp[k++]=a[j++];
//Transfer elements from temp[] back to a[]
for(i=i1,j=0;i<=j2;i++,j++)
a[i]=temp[j];
}

#include<stdio.h>

void mergesort(int a[],int i,int j);

void merge(int a[],int i1,int j1,int i2,int j2);

int main()

{

int nums[30],n,i;

printf("Enter no of elements:");

scanf("%d",&n);

printf("Enter %d integer numbers\n", n);

for(i=0;i<n;i++)

scanf("%d",&nums[i]);

mergesort(nums,0,n-1);

printf("Elements after sorting: ");

for(i=0;i<n;i++)

printf("%d ",nums[i]);

return 0;

}

void mergesort(int a[],int i,int j)

{

int mid;

if(i<j)

{

mid=(i+j)/2;

mergesort(a,i,mid); //left recursion

mergesort(a,mid+1,j); //right recursion

merge(a,i,mid,mid+1,j); //merging of two sorted sub-arrays

}

void merge(int a[],int i1,int j1,int i2,int j2)

{

int temp[50]; //array used for merging

int i,j,k;

i=i1; //beginning of the first list

j=i2; //beginning of the second list

k=0;

while(i<=j1 && j<=j2) //while elements in both lists

{

if(a[i]<a[j])

temp[k++]=a[i++];

else

temp[k++]=a[j++];

}

while(i<=j1) //copy remaining elements of the first list

temp[k++]=a[i++];

while(j<=j2) //copy remaining elements of the second list

temp[k++]=a[j++];

//Transfer elements from temp[] back to a[]

for(i=i1,j=0;i<=j2;i++,j++)

a[i]=temp[j];

}

Output:-

merge sort algorithm

Quick Sort Algorithm

Quick Sort Program In C

#include<stdio.h>
void quicksort(int number[25],int first,int last){
   int i, j, pivot, temp;

   if(first<last){
      pivot=first;
      i=first;
      j=last;

      while(i<j){
         while(number[i]<=number[pivot]&&i<last)
            i++;
         while(number[j]>number[pivot])
            j--;
         if(i<j){
            temp=number[i];
            number[i]=number[j];
            number[j]=temp;
         }
      }

      temp=number[pivot];
      number[pivot]=number[j];
      number[j]=temp;
      quicksort(number,first,j-1);
      quicksort(number,j+1,last);

   }
}

int main(){
   int i, n, nums[30];

   printf("Enter number of elements: ");
   scanf("%d",&n);

   printf("Enter %d integer numbers\n", n);
   for(i=0;i<n;i++)
      scanf("%d",&nums[i]);

   quicksort(nums,0,n-1);

   printf("Elements after sorting: ");
   for(i=0;i<n;i++)
      printf(" %d",nums[i]);

   return 0;
}

#include<stdio.h>

void quicksort(int number[25],int first,int last){

int i, j, pivot, temp;

if(first<last){

pivot=first;

i=first;

j=last;

while(i<j){

while(number[i]<=number[pivot]&&i<last)

i++;

while(number[j]>number[pivot])

j--;

if(i<j){

temp=number[i];

number[i]=number[j];

number[j]=temp;

}

temp=number[pivot];

number[pivot]=number[j];

number[j]=temp;

quicksort(number,first,j-1);

quicksort(number,j+1,last);

}

int main(){

int i, n, nums[30];

printf("Enter number of elements: ");

scanf("%d",&n);

printf("Enter %d integer numbers\n", n);

for(i=0;i<n;i++)

scanf("%d",&nums[i]);

quicksort(nums,0,n-1);

printf("Elements after sorting: ");

for(i=0;i<n;i++)

printf(" %d",nums[i]);

return 0;

}

Output:-

quick_sort_program_in_c

Selection Sort Algorithm

Selection sort algorithm is a simple sorting algorithm which sort a given set of n number of unsorted elements. In selection sort, smallest element from an unsorted list is selected in every pass and placed at the beginning of the unsorted list.

Working of Selection Sort

The selection sort algorithm first find the smallest element in the array and swap it with the element at first position. Then, find the second smallest element in the array and swap it with the element at second position. This process is repeated until we get the sorted array.

Selection Sort Program In C

In the following C program we have implemented the Selection Sort Algorithm.

#include<stdio.h>
int main(){
   
   int i, j, n, temp, nums[30];

   printf("Enter number of elements: ");
   scanf("%d",&n);

   printf("Enter %d integer elements\n", n);
   // Loop to input the elements
   for(i=0;i<n;i++)
      scanf("%d",&nums[i]);
 
   // Implementation of selection sort algorithm
   for(i=0;i<n;i++){
      for(j=i+1;j<n;j++){
         if(nums[i]>nums[j]){
            temp=nums[i];
            nums[i]=nums[j];
            nums[j]=temp;
         }
      }
   }

   printf("Elements after sorting: ");
   for(i=0;i<n;i++)
      printf(" %d",nums[i]);

   return 0;
}

#include<stdio.h>

int main(){

int i, j, n, temp, nums[30];

printf("Enter number of elements: ");

scanf("%d",&n);

printf("Enter %d integer elements\n", n);

// Loop to input the elements

for(i=0;i<n;i++)

scanf("%d",&nums[i]);

// Implementation of selection sort algorithm

for(i=0;i<n;i++){

for(j=i+1;j<n;j++){

if(nums[i]>nums[j]){

temp=nums[i];

nums[i]=nums[j];

nums[j]=temp;

}

printf("Elements after sorting: ");

for(i=0;i<n;i++)

printf(" %d",nums[i]);

return 0;

}

Output:-

Selection Sort Algorithm

Insertion Sort Algorithm

Insertion Sort Program In C

#include<stdio.h>
int main(){

   int i, j, n, temp, nums[30];

   printf("Enter number of elements: ");
   scanf("%d",&n);

   printf("Enter %d integer numbers\n", n);
   // Loop to input the elements
   for(i=0;i<n;i++)
      scanf("%d",&nums[i]);

   // Implementation of insertion sort algorithm
   for(i=1;i<n;i++){
      temp=nums[i];
      j=i-1;
      while((temp<nums[j])&&(j>=0)){
         nums[j+1]=nums[j];
         j=j-1;
      }
      nums[j+1]=temp;
   }

   printf("Elements after sorting: ");
   for(i=0;i<n;i++)
      printf(" %d",nums[i]);

   return 0;
}

#include<stdio.h>

int main(){

int i, j, n, temp, nums[30];

printf("Enter number of elements: ");

scanf("%d",&n);

printf("Enter %d integer numbers\n", n);

// Loop to input the elements

for(i=0;i<n;i++)

scanf("%d",&nums[i]);

// Implementation of insertion sort algorithm

for(i=1;i<n;i++){

temp=nums[i];

j=i-1;

while((temp<nums[j])&&(j>=0)){

nums[j+1]=nums[j];

j=j-1;

}

nums[j+1]=temp;

}

printf("Elements after sorting: ");

for(i=0;i<n;i++)

printf(" %d",nums[i]);

return 0;

}

Output:-

insertion_sort_program_in_c

sdf

Bubble Sort Algorithm

In this tutorial, we will learn about the bubble sort algorithm and its implementation in C, C++, Java and Python.

Bubble Sort Algorithm is a simple sorting algorithm which sort a given set of n number of elements. In Bubble sort, each of the element is compared with its adjacent element and swapped if they are not in the intended order. It compares all elements one by one starting from the first element to sort them in the intended order.

Bubble Sort Program in C

In the following program we are implementing bubble sort algorithm in C language. In this program user will be asked to enter the number of elements and corresponding element values. Later in the program we would sort them in ascending order using this algorithm.

#include<stdio.h>

int main(){

   int n, temp, i, j, nums[30];

   printf("Enter number of elements: ");
   scanf("%d", &n);
    
   printf("Enter %d integer numbers\n", n);

   for(i=0;i<n;i++)
   scanf("%d",&nums[i]);

   for(i=n-2;i>=0;i--){
      for(j=0;j<=i;j++){
        if(nums[j]>nums[j+1]){
           temp=nums[j];
           nums[j]=nums[j+1];
           nums[j+1]=temp;
        }
      }
   }

   printf("Elements after sorting: ");
   for(i=0;i<n;i++)
      printf(" %d",nums[i]);

   return 0;
}

#include<stdio.h>

int main(){

int n, temp, i, j, nums[30];

printf("Enter number of elements: ");

scanf("%d", &n);

printf("Enter %d integer numbers\n", n);

for(i=0;i<n;i++)

scanf("%d",&nums[i]);

for(i=n-2;i>=0;i--){

for(j=0;j<=i;j++){

if(nums[j]>nums[j+1]){

temp=nums[j];

nums[j]=nums[j+1];

nums[j+1]=temp;

}

printf("Elements after sorting: ");

for(i=0;i<n;i++)

printf(" %d",nums[i]);

return 0;

}

Output:-

Bubble Sort Algorithm

Differences

Linked List

Queue

Search Algorithms

Sorting Algorithms

More Data Structure Tutorial

Learn

ABOUT PAGES

Category Archives: Data Structure Tutorial

Counting Sort Algorithm

Heap Sort Algorithm

Heap Sort Program In C

Merge Sort Algorithm

Merge Sort Program In C

Quick Sort Algorithm

Quick Sort Program In C

Selection Sort Algorithm

Working of Selection Sort

Selection Sort Program In C

Insertion Sort Algorithm

Insertion Sort Program In C

Bubble Sort Algorithm

Bubble Sort Program in C