Friday, 13 February 2026

HEAP

 #include<bits/stdc++.h>

using namespace std;

void Heapify(vector<int>&arr,int value) {

arr.push_back(value);

int i=arr.size()-1;

while(i>0) {

int parent=(i-1)/2;

if(arr[parent]<arr[i]) {

swap(arr[parent],arr[i]);

i=parent;

} else {

break;

}

}

}

int main() {

vector<int>heap;

Heapify(heap,3);

Heapify(heap,4);

Heapify(heap,5);

Heapify(heap,67);

Heapify(heap,1);

for(int x:heap)

cout<<x<<" ";

}

No comments:

Post a Comment

SDE floyd-warshall algorithm

 // User function template for C++ class Solution {   public:     void floydWarshall(vector<vector<int>> &dist) {         //...