Heap Sort
Showing posts with label Heap Sort. Show all posts
Showing posts with label Heap Sort. Show all posts

Heap Sort Using C Programming Language

How to write a C Program Heap Sort Using C Programming Language ?

A sorting algorithm that works by first organizing the data to be sorted into a special type of binary tree called a heap. The heap itself has, by definition, the largest value at the top of the tree, so the heap sort algorithm must also reverse the order.

A complete binary tree is a binary tree in which each non-leaf has two children and all the leaves are at the same depth from the root.

A nearly complete binary tree is a binary tree constructed from a complete binary tree by eliminating a number of nodes (possibly none) from right at the leaf level.

 A heap is a node-labeled, nearly complete binary tree with a special property.

 The (Binary) heap data structure is an array object that can be

viewed as a nearly complete binary tree.

 See More : Heapsort

Solution For C Program :


C Program To Implement Heap Sort

How to write a C Program To Implement Heap Sort in C Programming Language ?



Solution For C Program :

/*C Program To Implement Heap Sort.*/

#include<stdio.h>
#include<conio.h>

void restoreHup(int*,int);
void restoreHdown(int*,int,int);

void main()
{
    int a[20],n,i,j,k;
    clrscr();
    printf("Enter the number of elements to sort : ");
    scanf("%d",&n);

    printf("Enter the elements :");
    for(i=1;i<=n;i++){
        scanf("%d",&a[i]);
        restoreHup(a,i);
    }
    j=n;
    for(i=1;i<=j;i++)
    {
        int temp;
        temp=a[1];
        a[1]=a[n];
        a[n]=temp;
        n--;
        restoreHdown(a,1,n);
    }

    n=j;
    printf("Here is it...");
    for(i=1;i<=n;i++)
        printf("%4d",a[i]);
    getch();
}

void restoreHup(int *a,int i)
{
    int v=a[i];
    while((i>1)&&(a[i/2]<v))
    {
        a[i]=a[i/2];
        i=i/2;
    }
    a[i]=v;
}

void restoreHdown(int *a,int i,int n)
{
    int v=a[i];
    int j=i*2;
    while(j<=n)
    {
        if((j<n)&&(a[j]<a[j+1]))
            j++;
        if(a[j]<a[j/2]) break;
        a[j/2]=a[j];
        j=j*2;
    }
    a[j/2]=v;
}

You may also learn these C Program/Code :

C Program To Swap Two Numbers Without Using Third Variable

Subscribe to: Posts (Atom)