Category Archives: Sorting Algorithms

Sorting Algorithms

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

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

Differences

Linked List

Queue

Search Algorithms

Sorting Algorithms

More Data Structure Tutorial

Learn

ABOUT PAGES

Category Archives: Sorting Algorithms

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

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