Scribd Logo
Upload

Welcome to Scribd!

  • 5 views

    Heapsort

    Uploaded by

    Atmaram Korgaonkar
    This C++ code defines a Heap class with methods to insert and delete elements from a max heap. The insheap() method inserts an element into the heap by comparing it to elements as it traverses up the tree. The delheap() method removes the maximum element by replacing it with the last element and then bubbling it down the tree while comparing to children. The heapsort() method uses these methods to sort an array, inserting elements into the heap and deleting into a new array to output the sorted elements.

    Copyright:

    © All Rights Reserved
    Download as PDF, TXT or read online from Scribd
    Flag for inappropriate content

    You might also like

    Heapsort

    Uploaded by

    Atmaram Korgaonkar
    5 views5 pages
    This C++ code defines a Heap class with methods to insert and delete elements from a max heap. The insheap() method inserts an element into the heap by comparing it to elements as it traverses up the tree. The delheap() method removes the maximum element by replacing it with the last element and then bubbling it down the tree while comparing to children. The heapsort() method uses these methods to sort an array, inserting elements into the heap and deleting into a new array to output the sorted elements.

    Original Description:

    Original Title

    heapsort

    Copyright

    © © All Rights Reserved

    Available Formats

    PDF, TXT or read online from Scribd

    Did you find this document useful?

    Is this content inappropriate?

    Report this Document
    This C++ code defines a Heap class with methods to insert and delete elements from a max heap. The insheap() method inserts an element into the heap by comparing it to elements as it traverses up the tree. The delheap() method removes the maximum element by replacing it with the last element and then bubbling it down the tree while comparing to children. The heapsort() method uses these methods to sort an array, inserting elements into the heap and deleting into a new array to output the sorted elements.

    Copyright:

    © All Rights Reserved
    Download as PDF, TXT or read online from Scribd
    Flag for inappropriate content
    Download as pdf or txt
    5 views5 pages

    Heapsort

    Uploaded by

    Atmaram Korgaonkar
    This C++ code defines a Heap class with methods to insert and delete elements from a max heap. The insheap() method inserts an element into the heap by comparing it to elements as it traverses up the tree. The delheap() method removes the maximum element by replacing it with the last element and then bubbling it down the tree while comparing to children. The heapsort() method uses these methods to sort an array, inserting elements into the heap and deleting into a new array to output the sorted elements.

    Copyright:

    © All Rights Reserved
    Download as PDF, TXT or read online from Scribd
    Flag for inappropriate content
    Download as pdf or txt
    of 5

    #include<iostream>

    using namespace std;


    class Heap
    {
    int a[50],b[50],n;
    public:
    Heap()
    {
    n=-1;;
    }
    void insheap(int);
    int delheap();
    void display();
    void heapsort();
    };
    void Heap::insheap(int item)
    {
    int i,j;
    n++;
    i=n;
    while(i>0)
    {
    j=(i-1)/2;
    if(item<=a[j])
    {
    a[i]=item;
    return ;
    }
    a[i]=a[j];
    i=j;
    }
    a[0]=item;
    }
    int Heap::delheap()
    {
    int le ,right,last,i,item;
    item=a[0];
    last=a[n];
    n--;
    i=0;
    le =1;
    right=2;
    while(right<=n)
    {
    if(last>=a[le ] && last >=a[right])
    {
    a[i]=last;
    return item;
    }
    if(a[right]<=a[le ])
    {
    a[i]=a[le ];
    i=le ;
    }
    else
    {
    a[i]=a[right];
    i=right;
    }
    le =(2*i)+1;
    right=le +1;
    }
    if(le ==n)
    {
    if(last<a[le ])
    {
    a[i]=a[le ];
    i=le ;
    }
    }
    a[i]=last;
    return item;
    }
    void Heap::display()
    {
    cout<<"\n Elements in heaps are:\n";
    for(int i=0;i<=n;i++)
    {
    cout<<" "<<a[i];
    }
    }
    void Heap::heapsort()
    {
    int item,ch,temp,j=0;
    do
    {cout<<"\n enter item to insert:";
    cin>>item;
    insheap(item);
    cout<<"\n do you want to insert again ? press 1 for Yes and 0 for NO";
    cin>>ch;
    }while(ch!=0);
    cout<<"\n before sor ng\n";
    for(int i=0;i<=n;i++)
    {
    cout<<" "<<a[i];
    }
    temp=n;
    while(n!=-1)
    {
    b[j]=delheap();
    j++;
    }
    cout<<"\n a er sor ng\n";
    for(int i=temp;i>=0;i--)
    {
    cout<<" "<<b[i];
    }
    }
    int main()
    {
    Heap h=Heap();
    h.heapsort();
    return 0;
    }

    You might also like