DAA/heap.cpp at main · warrior141004/DAA · GitHub

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
#include <iostream>
#include <vector>
using namespace std;

class heap {
public:
    int arr[100];
    int size;
heap(){
    arr[0]=-1;
    size=0;

}
void insert(int val){

    size=size+1;
    int index=size;
    arr[index]=val;

    while(index>1){
        int parent=index/2;
        if(arr[parent]<arr[index])
        {
            swap(arr[parent],arr[index]);
            index=parent;
        }else {return;}
    }
}
void deleteheap(){
    if (size==0){
        cout<<"nothing to delete" << endl;
        return;

    }
    arr[1]=arr[size];
    size--;

    int i=1;
    while(true){
        int lefti=2*i;
        int righti=2*i+1;

        if(lefti<=size && arr[i]<arr[lefti]){
            swap(arr[i],arr[lefti]);
            i=lefti;

        }else if(righti<=size && arr[i]<arr[righti]){
            swap(arr[i],arr[righti]);
            i=righti;
        }else{
            return;
        }

    }

}
void heapify(int arr[], int size,int index){
    int largest=index;
    int lefti=2*index;
    int righti=2*index+1;

    if(lefti<=size && arr[largest]<arr[lefti] ){
        largest=lefti;
    }
    if(righti<=size && arr[largest]<arr[righti]){
        largest=righti;
    }
    if(largest!=index){
        swap(arr[index],arr[largest]);
        heapify(arr,size,largest);
    }

}
void heapsort(int arr[],int size, int index){

    while(size>1){
        swap(arr[1],arr[size]);
        size--;
        heapify(arr,size,1);

    }

}

void print(){
    for (int i=1;i<=size;i++){
        cout<<arr[i]<<" ";   }}
};

int main(){
    heap h;
    h.insert(10);
    h.insert(55);
    h.insert(5);
    h.insert(35);
    h.insert(14);

   h.print();

    h.deleteheap();
    cout<<" "<<endl;
    h.print();

    int arr[6]={-1,54,53,55,52,50};
    int n=5;

    for(int i=n/2; i>0;i--){
        h.heapify(arr,n,i);
    }
    cout<<" print array now"<<endl;
    for(int i=1;i<=n;i++){
        cout<<arr[i]<<" ";
    }cout<<endl;

    h.heapsort(arr,n,1);
    cout<<" print array now"<<endl;
    for(int i=1;i<=n;i++){
        cout<<arr[i]<<" ";
    }cout<<endl;

    return 0;
}