Category Archives: Data Structure Tutorial

Data Structure Tutorial

Binary Search Algorithm

What Is Binary Search Algorithm?

Binary search is one of the commonly used search algorithm in data structure. The Binary search is an efficient search algorithm for finding an item in a sorted list of items. Binary search algorithm works only on a sorted list of elements. In order to search an element using binary search algorithm, we must ensure that the list is sorted. When binary search is performed with a sorted list, the number of iterations can be reduced significantly.

How Binary Search Algorithm Works

Binary search algorithm is based on divide and conquer approach. In Binary search, an item is searched by comparing middle most element of the sorted list. If the search item is matched with the middle element of the list, then it returns the index of matched element. Otherwise, we check whether the given search item is smaller or larger than the middle element of the list. If the search item is smaller, then we will repeat this search process in the left sub-list to find the item. If the search item is greater, then we will repeat this search process in the right sub-list to find the item.

At each step, we have reduced search space to find the target value because the list is sorted, We repeat this process until we find the search item in the list or we left with a sub-list consisting of a single element. And if the search item is not found in list then the “Search Item not found.” result is displayed.

Binary Search Program In C

#include <stdio.h>

int main()
{
  int a[100], search, ctr, n, first, last, middle;

  printf("Enter number of elements in array:\n");
  scanf("%d", &n);
 
  printf("Enter %d integer numbers:\n", n);
 
  for (ctr = 0; ctr < n; ctr++)
    scanf("%d", &a[ctr]);
 
  printf("Enter a number to search:\n");
  scanf("%d", &search);

  first = 0;
  last = n - 1;
  middle = (first+last)/2;

  while (first <= last) {
    if (a[middle] < search)
      first = middle + 1;
    else if (a[middle] == search) {
      printf("%d is found at location %d.\n", search, middle+1);
      break;
    }
    else
      last = middle - 1;

    middle = (first + last)/2;
  }
  if (first > last)
    printf("%d is not present in the list.\n", search);

  return 0;
}

#include <stdio.h>

int main()

{

int a[100], search, ctr, n, first, last, middle;

printf("Enter number of elements in array:\n");

scanf("%d", &n);

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

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

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

printf("Enter a number to search:\n");

scanf("%d", &search);

first = 0;

last = n - 1;

middle = (first+last)/2;

while (first <= last) {

if (a[middle] < search)

first = middle + 1;

else if (a[middle] == search) {

printf("%d is found at location %d.\n", search, middle+1);

break;

}

else

last = middle - 1;

middle = (first + last)/2;

}

if (first > last)

printf("%d is not present in the list.\n", search);

return 0;

}

Output:-

Linear Search Algorithm

What Is Linear Search Algorithm?

Linear search algorithm is a simple search algorithm. Linear search algorithm is also known as sequential search algorithm. In this type of search algorithms, we simply search for an element or value in a given array by traversing the all array elements sequentially from the beginning of the array till the desired element or value is found. In Linear search, each array element is matched to find the desired search element. If a match found then location of the matched item is returned else it returns NULL.

Linear Search Program In C

#include <stdio.h>

int main()
{
  int a[100], search, ctr, n;

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

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

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

  printf("Enter a number to search:\n");
  scanf("%d", &search);

  for (ctr = 0; ctr < n; ctr++)
  {
    if (a[ctr] == search)    
    {
      printf("%d is found at location %d.\n", search, ctr+1);
      break;
    }
  }
  if (ctr == n)
    printf("%d is not found in the array.\n", search);

  return 0;
}

#include <stdio.h>

int main()

{

int a[100], search, ctr, n;

printf("Enter number of elements in array:\n");

scanf("%d", &n);

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

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

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

printf("Enter a number to search:\n");

scanf("%d", &search);

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

{

if (a[ctr] == search)

{

printf("%d is found at location %d.\n", search, ctr+1);

break;

}

if (ctr == n)

printf("%d is not found in the array.\n", search);

return 0;

}

Output:-

Types of Queue

Types of Linked List

Tim Sort Algorithm

Tim Sort Program In C

#include<stdio.h>  
const int run = 32;  
int minimum(int a, int b)  
{  
    if(a<b)  
    return a;   
    else   
    return b;   
}  
void insertion_sort(int a[], int beg, int end)  
{  
    int temp, i, j;   
    for (i = beg + 1; i <= end; i++)  
    {  
        temp = a[i];  
        j = i - 1;  
        while (a[j] > temp && j >= beg)  
        {  
            a[j+1] = a[j];  
            j--;  
        }  
        a[j+1] = temp;  
    }  
}  
   
void merge(int a[], int left, int mid, int right)  
{  
    int len1 = mid - left + 1, len2 = right - mid;  
    int beg[len1], end[len2];  
    int i,j,k;  
    for (i = 0; i < len1; i++)  
        beg[i] = a[left + i];  
    for (i = 0; i < len2; i++)  
        end[i] = a[mid + 1 + i];  
   
    i = 0;  
    j = 0;  
    k = left;  
   
    while (i < len1 && j < len2)  
    {  
        if (beg[i] <= end[j])  
        {  
            a[k] = beg[i];  
            i++;  
        }  
        else  
        {  
            a[k] = end[j];  
            j++;  
        }  
        k++;  
    }  
    while (i < len1)  
    {  
        a[k] = beg[i];  
        k++;  
        i++;  
    }  
   
    while (j < len2)  
    {  
        a[k] = end[j];  
        k++;  
        j++;  
    }  
}  
void tim_sort(int a[], int n)  
{  
    int i,size,beg,mid,end;  
    for (i = 0; i < n; i+=run)  
        insertion_sort(a, i, minimum((i+31), (n-1)));  
    for (size = run; size < n; size = 2*size)  
    {  
        for (beg = 0; beg < n; beg += 2*size)  
        {  
            mid = beg + size - 1;  
            end = minimum((beg + 2*size - 1), (n-1));  
   
            merge(a, beg, mid, end);  
        }  
    }  
}  
  
int main()  
{  
    int i, n, a[10]; 
    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]); 
    }   
    tim_sort(a, n);  
   
    printf("Elements after sorting: ");   
    for (i = 0; i < n; i++)  
        printf("%d ", a[i]);  
    printf("\n");  
    return 0;  
}

100

101

102

#include<stdio.h>

const int run = 32;

int minimum(int a, int b)

{

if(a<b)

return a;

else

return b;

}

void insertion_sort(int a[], int beg, int end)

{

int temp, i, j;

for (i = beg + 1; i <= end; i++)

{

temp = a[i];

j = i - 1;

while (a[j] > temp && j >= beg)

{

a[j+1] = a[j];

j--;

}

a[j+1] = temp;

}

void merge(int a[], int left, int mid, int right)

{

int len1 = mid - left + 1, len2 = right - mid;

int beg[len1], end[len2];

int i,j,k;

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

beg[i] = a[left + i];

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

end[i] = a[mid + 1 + i];

i = 0;

j = 0;

k = left;

while (i < len1 && j < len2)

{

if (beg[i] <= end[j])

{

a[k] = beg[i];

i++;

}

else

{

a[k] = end[j];

j++;

}

k++;

}

while (i < len1)

{

a[k] = beg[i];

k++;

i++;

}

while (j < len2)

{

a[k] = end[j];

k++;

j++;

}

void tim_sort(int a[], int n)

{

int i,size,beg,mid,end;

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

insertion_sort(a, i, minimum((i+31), (n-1)));

for (size = run; size < n; size = 2*size)

{

for (beg = 0; beg < n; beg += 2*size)

{

mid = beg + size - 1;

end = minimum((beg + 2*size - 1), (n-1));

merge(a, beg, mid, end);

}

int main()

{

int i, n, a[10];

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]);

}

tim_sort(a, n);

printf("Elements after sorting: ");

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

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

printf("\n");

return 0;

}

Output:-

tim_sort_program_in_c

Comb Sort Algorithm

Comb Sort Program In C

#include <stdio.h>  
#include <stdlib.h>  
int newgap(int gap)  
{  
    gap = (gap * 10) / 13;  
    if (gap == 9 || gap == 10)  
        gap = 11;  
    if (gap < 1)  
        gap = 1;  
    return gap;  
}  
   
void comb_sort(int a[], int aSize)  
{  
    int gap = aSize;  
    int temp, i;  
    for (;;)  
    {  
        gap = newgap(gap);  
        int swapped = 0;  
        for (i = 0; i < aSize - gap; i++)   
        {  
            int j = i + gap;  
            if (a[i] > a[j])  
            {  
                temp = a[i];  
                a[i] = a[j];  
                a[j] = temp;  
                swapped  =  1;  
            }  
        }  
        if (gap  ==  1 && !swapped)  
            break;  
    }  
}  
int main ()  
{  
    int n, i;  
    int *a;  
    printf("Enter number of elements: "); 
    scanf("%d", &n); 
    a  =  (int *)calloc(n, sizeof(int));  
    printf("Enter %d integer numbers\n", n); 
    for(i = 0; i < n; i++) 
    { 
        scanf("%d",&a[i]); 
    }    
    
    comb_sort(a, n);  
    printf("Elements after sorting: ");
    for(i = 0;i < n;i++)  
    {  
        printf("%d ", (a[i]));  
    }  
    return 0;  
}

#include <stdio.h>

#include <stdlib.h>

int newgap(int gap)

{

gap = (gap * 10) / 13;

if (gap == 9 || gap == 10)

gap = 11;

if (gap < 1)

gap = 1;

return gap;

}

void comb_sort(int a[], int aSize)

{

int gap = aSize;

int temp, i;

for (;;)

{

gap = newgap(gap);

int swapped = 0;

for (i = 0; i < aSize - gap; i++)

{

int j = i + gap;

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

{

temp = a[i];

a[i] = a[j];

a[j] = temp;

swapped = 1;

}

if (gap == 1 && !swapped)

break;

}

int main ()

{

int n, i;

int *a;

printf("Enter number of elements: ");

scanf("%d", &n);

a = (int *)calloc(n, sizeof(int));

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

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

{

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

}

comb_sort(a, n);

printf("Elements after sorting: ");

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

{

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

}

return 0;

}

Output:-

comb_sort_program_in_c

Bucket Sort Algorithm

Bucket Sort Program In C

#include <stdio.h>  
void bucket_sort(int array[], int n)  
{    
    int i, j;    
    int count[n];   
    for (i = 0; i < n; i++)  
        count[i] = 0;  
   
    for (i = 0; i < n; i++)  
        (count[array[i]])++;  
   
    for (i = 0, j = 0; i < n; i++)    
        for(; count[i] > 0; (count[i])--)  
            array[j++] = i;  
}     

int main()  
{  
    int i, n, a[10]; 
    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]); 
    }   

    bucket_sort(a, n);   
    printf("Elements after sorting: ");  
    for (i = 0; i < n; i++)  
        printf("%d ", a[i]);     
    printf("\n");       
    return 0;  
}

#include <stdio.h>

void bucket_sort(int array[], int n)

{

int i, j;

int count[n];

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

count[i] = 0;

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

(count[array[i]])++;

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

for(; count[i] > 0; (count[i])--)

array[j++] = i;

}

int main()

{

int i, n, a[10];

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]);

}

bucket_sort(a, n);

printf("Elements after sorting: ");

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

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

printf("\n");

return 0;

}

Output:-

bucket_sort_program_in_c

Cycle Sort Algorithm

Cycle Sort Program In C

#include<stdio.h>  
void cycle_sort(int a[], int n)  
{  
    int writes = 0,start,element,pos,temp,i;  
   
    for (start = 0; start <= n - 2; start++) {  
        element = a[start];  
        pos = start;  
        for (i = start + 1; i < n; i++)  
            if (a[i] < element)  
                pos++;  
        if (pos == start)  
            continue;  
        while (element == a[pos])  
            pos += 1;  
        if (pos != start) {  
        temp = element;  
        element = a[pos];  
            a[pos] = temp;    
            writes++;  
        }  
        while (pos != start) {  
            pos = start;  
            for (i = start + 1; i < n; i++)  
                if (a[i] < element)  
                    pos += 1;  
            while (element == a[pos])  
                pos += 1;  
            if (element != a[pos]) {  
              temp = element;  
          element = a[pos];  
              a[pos] = temp;    
                writes++;  
            }  
        }  
    }  
   
 }  
   
int main()  
{  
    int i, n, a[10]; 
    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]); 
    }  
   
    cycle_sort(a, n);  
    printf("Elements after sorting: "); 
    for (i = 0; i < n; i++)  
        printf("%d  ",a[i]);  
    return 0;  
}

#include<stdio.h>

void cycle_sort(int a[], int n)

{

int writes = 0,start,element,pos,temp,i;

for (start = 0; start <= n - 2; start++) {

element = a[start];

pos = start;

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

if (a[i] < element)

pos++;

if (pos == start)

continue;

while (element == a[pos])

pos += 1;

if (pos != start) {

temp = element;

element = a[pos];

a[pos] = temp;

writes++;

}

while (pos != start) {

pos = start;

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

if (a[i] < element)

pos += 1;

while (element == a[pos])

pos += 1;

if (element != a[pos]) {

temp = element;

element = a[pos];

a[pos] = temp;

writes++;

}

int main()

{

int i, n, a[10];

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]);

}

cycle_sort(a, n);

printf("Elements after sorting: ");

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

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

return 0;

}

Output:-

cycle_sort_program_in_c

Cocktail Sort Algorithm

Cocktail Sort Program In C

#include <stdio.h>  
int temp;   
void cocktail_sort(int a[], int n)  
{  
    int is_swapped = 1;  
    int begin = 0,i;  
    int end = n - 1;  
   
    while (is_swapped) {  
    is_swapped = 0;  
    for (i = begin; i < end; ++i) {  
      if (a[i] > a[i + 1]) {  
        temp = a[i];  
        a[i]=a[i+1];  
        a[i+1]=temp;                  
        is_swapped = 1;  
      }  
    }  
    if (!is_swapped)  
    break;  
    is_swapped = 0;  
    for (i = end - 1; i >= begin; --i) {  
      if (a[i] > a[i + 1])   
      {  
        temp = a[i];  
        a[i]=a[i+1];  
        a[i+1]=temp;  
        is_swapped = 1;  
      }  
    }  
    ++begin;  
  }  
}  
   
int main()  
{  
    int i, n, a[10]; 
    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]); 
    }
    cocktail_sort(a, n);  
    printf("Elements after sorting: ");  
     for (i = 0; i < n; i++)  
        printf("%d ", a[i]);  
    printf("\n");  
    return 0;  
}

#include <stdio.h>

int temp;

void cocktail_sort(int a[], int n)

{

int is_swapped = 1;

int begin = 0,i;

int end = n - 1;

while (is_swapped) {

is_swapped = 0;

for (i = begin; i < end; ++i) {

if (a[i] > a[i + 1]) {

temp = a[i];

a[i]=a[i+1];

a[i+1]=temp;

is_swapped = 1;

}

if (!is_swapped)

break;

is_swapped = 0;

for (i = end - 1; i >= begin; --i) {

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

{

temp = a[i];

a[i]=a[i+1];

a[i+1]=temp;

is_swapped = 1;

}

++begin;

}

int main()

{

int i, n, a[10];

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]);

}

cocktail_sort(a, n);

printf("Elements after sorting: ");

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

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

printf("\n");

return 0;

}

Output:-

cocktail_sort_program_in_c

Bitonic Sort Algorithm

Bitonic Sort Program In C

#include<stdio.h>  
void swap(int arr[], int i, int j, int d)  
{  
    int temp;  
    if (d==(arr[i]>arr[j]))  
    {  
        temp = arr[i];  
        arr[i] = arr[j];  
        arr[j] = temp;  
    }  
}  
void merge(int arr[], int l, int c, int d)  
{  
    int k,i;  
    if (c>1)  
    {  
        k = c/2;  
        for (i=l; i<l+k; i++)  
        swap(arr, i, i+k, d);  
        merge(arr, l, k, d);  
        merge(arr, l+k, k, d);  
    }  
}  
void bitonic_sort(int arr[],int l, int c, int d)  
{  
    int k;  
    if (c>1)  
    {  
        k = c/2;  
        bitonic_sort(arr, l, k, 1);  
        bitonic_sort(arr, l+k, k, 0);  
        merge(arr,l, c, d);  
    }  
}  
   
void sort(int arr[], int n, int order)  
{  
    bitonic_sort(arr,0, n, order);  
}  
int main()  
{  
    int i, n, a[10]; 
    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]); 
    }
    int order = 1;     
    sort(a, n, order);  
   
    printf("Elements after sorting: "); 
    for (i=0; i<n; i++)  
        printf("%d ", a[i]);  
}

#include<stdio.h>

void swap(int arr[], int i, int j, int d)

{

int temp;

if (d==(arr[i]>arr[j]))

{

temp = arr[i];

arr[i] = arr[j];

arr[j] = temp;

}

void merge(int arr[], int l, int c, int d)

{

int k,i;

if (c>1)

{

k = c/2;

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

swap(arr, i, i+k, d);

merge(arr, l, k, d);

merge(arr, l+k, k, d);

}

void bitonic_sort(int arr[],int l, int c, int d)

{

int k;

if (c>1)

{

k = c/2;

bitonic_sort(arr, l, k, 1);

bitonic_sort(arr, l+k, k, 0);

merge(arr,l, c, d);

}

void sort(int arr[], int n, int order)

{

bitonic_sort(arr,0, n, order);

}

int main()

{

int i, n, a[10];

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]);

}

int order = 1;

sort(a, n, order);

printf("Elements after sorting: ");

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

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

}

Output:-

bitonic _sort_program_in_c

Radix Sort Algorithm

Radix Sort Program In C

#include<stdio.h>
 
// Function to find largest element
int largest(int a[], int n)
{
    int large = a[0], i;
    for(i = 1; i < n; i++)
    {
        if(large < a[i])
            large = a[i];
    }
    return large;
}
 
// Function to perform sorting
void radix_sort(int a[], int n)
{
    int bucket[10][10], bucket_count[10];
    int i, j, k, remainder, NOP=0, divisor=1, large, pass;
 
    large = largest(a, n);

    while(large > 0)
    {
        NOP++;
        large/=10;
    }
 
    for(pass = 0; pass < NOP; pass++)
    {
        for(i = 0; i < 10; i++)
        {
            bucket_count[i] = 0;
        }
        for(i = 0; i < n; i++)
        {
            remainder = (a[i] / divisor) % 10;
            bucket[remainder][bucket_count[remainder]] = a[i];
            bucket_count[remainder] += 1;
        }
 
        i = 0;
        for(k = 0; k < 10; k++)
        {
            for(j = 0; j < bucket_count[k]; j++)
            {
                a[i] = bucket[k][j];
                i++;
            }
        }
        divisor *= 10;
    }
}
 
int main()
{
    int i, n, a[10];
    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]);
    }
    radix_sort(a,n);
    printf("Elements after sorting: ");
    for(i = 0; i < n; i++)
        printf("%d  ",a[i]);
    printf("\n");
    return 0;
}

#include<stdio.h>

// Function to find largest element

int largest(int a[], int n)

{

int large = a[0], i;

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

{

if(large < a[i])

large = a[i];

}

return large;

}

// Function to perform sorting

void radix_sort(int a[], int n)

{

int bucket[10][10], bucket_count[10];

int i, j, k, remainder, NOP=0, divisor=1, large, pass;

large = largest(a, n);

while(large > 0)

{

NOP++;

large/=10;

}

for(pass = 0; pass < NOP; pass++)

{

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

{

bucket_count[i] = 0;

}

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

{

remainder = (a[i] / divisor) % 10;

bucket[remainder][bucket_count[remainder]] = a[i];

bucket_count[remainder] += 1;

}

i = 0;

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

{

for(j = 0; j < bucket_count[k]; j++)

{

a[i] = bucket[k][j];

i++;

}

divisor *= 10;

}

int main()

{

int i, n, a[10];

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]);

}

radix_sort(a,n);

printf("Elements after sorting: ");

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

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

printf("\n");

return 0;

}

Output:-

radix_sort_program_in_c

Shell Sort Algorithm

Shell Sort Program In C

#include<stdio.h>
void ShellSort(int a[], int n)
{
    int i, j, ctr, tmp;
    for(ctr = n/2; ctr > 0; ctr /= 2)
    {
        for(i = ctr; i < n; i++)
        {
            tmp = a[i];
            for(j = i; j >= ctr; j -= ctr)
            {
                if(tmp < a[j-ctr])
                    a[j] = a[j-ctr];
                else
                    break;
            }
            a[j] = tmp;
        }
    }
}
 
int main()
{
    int i, n, a[10];
    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]);
    }
    ShellSort(a,n);
    printf("Elements after sorting: ");
    for(i = 0; i < n; i++)
        printf("%d  ",a[i]);
    printf("\n");
    return 0;
}

#include<stdio.h>

void ShellSort(int a[], int n)

{

int i, j, ctr, tmp;

for(ctr = n/2; ctr > 0; ctr /= 2)

{

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

{

tmp = a[i];

for(j = i; j >= ctr; j -= ctr)

{

if(tmp < a[j-ctr])

a[j] = a[j-ctr];

else

break;

}

a[j] = tmp;

}

int main()

{

int i, n, a[10];

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]);

}

ShellSort(a,n);

printf("Elements after sorting: ");

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

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

printf("\n");

return 0;

}

Output:-

shell_sort_program_in_c

Differences

Linked List

Queue

Search Algorithms

Sorting Algorithms

More Data Structure Tutorial

Learn

ABOUT PAGES

Category Archives: Data Structure Tutorial

Binary Search Algorithm

What Is Binary Search Algorithm?

How Binary Search Algorithm Works

Binary Search Program In C

Linear Search Algorithm

What Is Linear Search Algorithm?

Linear Search Program In C

Types of Queue

Types of Linked List

Tim Sort Algorithm

Tim Sort Program In C

Comb Sort Algorithm

Bucket Sort Algorithm

Bucket Sort Program In C

Cycle Sort Algorithm

Cycle Sort Program In C

Cocktail Sort Algorithm

Cocktail Sort Program In C

Bitonic Sort Algorithm

Bitonic Sort Program In C

Radix Sort Algorithm

Radix Sort Program In C

Shell Sort Algorithm

Shell Sort Program In C