heap_sort_next

#include<bits/stdc++.h>
using namespace std;
int arr[20],x,i,j,n;
int input(void)
{
    printf("Enter number of data:");
    scanf("%d",&n);
    printf("Enter Data:\n");
    for(i=1; i<=n; i++)
        scanf("%d",&arr[i]);
    x=n;
    return 0;
}
int swap(int& a, int& b)
{
    int temp;
    temp=a;
    a=b;
    b=temp;
}
int heapify(void)
{
    printf("Righttttttttttttttttttttttttttt!!!!!!!!    heapify!!!!!!!!!!!!!!!!!!!!\n");
    for(i=x/2; i>=1; i--)
    {
        if(arr[i]<arr[i*2])
            if((arr[i*2]<arr[(i*2)+1]) && (i*2+1)<=x)
                swap(arr[(i*2)+1],arr[i]);
            else
                swap(arr[i],arr[i*2]);
        else if((arr[i]<arr[(i*2)+1]) && (i*2+1)<=x)
            swap(arr[(i*2)+1], arr[i]);

    }
}

int heap_sort(void)
{
     printf("Righttttttttttttttttttttttttttt!!!!!!!!    heap sort!!!!!!!!!!!!!!!!!!!!\n");
    x=n;
    for(x; x>1; x--)
    {
        heapify();
        swap(arr[1],arr[x]);

    }
}
int print_arr(void)
{
    for(i=1; i<=n; i++)
        printf("%d ",arr[i]);
    printf("\n");
}

int main()
{
    for(;;)
    {
        input();
        heap_sort();
        print_arr();
    }
    return 0;
}