Merge pull request ephremdeme#122 from nut556/master

Added Heapsort in C++

Author: ephremdeme

Algorithms/BFS.cpp

@@ -0,0 +1,44 @@
+#include <bits/stdc++.h>
+
+using namespace std ; 
+vector <bool> vis ; 
+vector < vector <int> > adj ; 
+
+void BFS(int s)
+{
+ queue <int> q ; 
+ q.push(s) ;
+ vis[s] = true ; 
+ while (!q.empty())
+ {
+ int f = q.front() ; 
+ q.pop() ; 
+ cout<<f<<" " ; 
+ for(auto u : adj[f])
+ {
+ if(vis[u]==false)
+ {
+ q.push(u) ; 
+ vis[u] = true ; 
+ }
+ }
+ }
+ 
+}
+
+int main()
+{ cout<<"Enter number of Nodes and Edges\n" ; 
+ int n , e ; 
+ cin>>n>>e ; 
+ vis.assign(n ,false) ; 
+ adj.assign(n , vector <int> ()) ; 
+ int x , y ; 
+ cout<<"Enter Edges\n" ; 
+ for (int i = 0; i < e; i++) { 
+ cin>>x>>y ; 
+ adj[x].push_back(y) ; 
+ adj[y].push_back(x) ; 
+ } 
+ cout<<"BFS path from source node 0 : " ;
+ BFS(0) ; 
+}

sorting-algorithms/heapsort.cpp

@@ -0,0 +1,67 @@
+#include<bits/stdc++.h>
+
+using namespace std ; 
+
+
+
+
+void heapify(int arr[], int n, int i) 
+{ 
+ int largest = i; 
+ int l = 2*i + 1; 
+ int r = 2*i + 2; 
+ 
+ if (l < n && arr[l] > arr[largest]) 
+ largest = l; 
+ 
+ if (r < n && arr[r] > arr[largest]) 
+ largest = r; 
+ 
+ if (largest != i) 
+ { 
+ swap(arr[i], arr[largest]); 
+ heapify(arr, n, largest); 
+ } 
+}
+
+void heapSort(int arr[], int n) 
+{ 
+ 
+ for (int i = n / 2 - 1; i >= 0; i--) 
+ heapify(arr, n, i); 
+ 
+ 
+ for (int i=n-1; i>0; i--) 
+ { 
+ 
+ swap(arr[0], arr[i]); 
+ 
+ 
+ heapify(arr, i, 0); 
+ } 
+} 
+int main()
+{
+ int n ; 
+ cout<<"Enter Size of Array\n" ; 
+ cin>>n ; 
+ cout<<"Enter Numbers\n" ; 
+ int arr[n] ; 
+ for(int i = 0 ; i<n ; i++)
+ {
+ cin>>arr[i] ; 
+ }
+ cout<<"Unsorted Array: " ; 
+ for(int i = 0 ; i<n ; i++)
+ {
+ cout<<arr[i]<<" " ; 
+ }
+ cout<<endl ; 
+ cout<<"Sorted Array: " ; 
+ heapSort(arr ,n ) ;
+ for(int i = 0 ; i<n ; i++)
+ {
+ cout<<arr[i]<<" " ; 
+ }
+
+}