formatting source-code for 153fb7b8a5

data_structure/binaryheap.cpp

@@ -7,8 +7,7 @@ using namespace std;
 void swap(int *x, int *y);
 
 // A class for Min Heap
-class MinHeap
-{
+class MinHeap {
     int *harr;      // pointer to array of elements in heap
     int capacity;   // maximum possible size of min heap
     int heap_size;  // Current number of elements in min heap
@@ -44,18 +43,15 @@ class MinHeap
 };
 
 // Constructor: Builds a heap from a given array a[] of given size
-MinHeap::MinHeap(int cap)
-{
+MinHeap::MinHeap(int cap) {
     heap_size = 0;
     capacity = cap;
     harr = new int[cap];
 }
 
 // Inserts a new key 'k'
-void MinHeap::insertKey(int k)
-{
-    if (heap_size == capacity)
-    {
+void MinHeap::insertKey(int k) {
+    if (heap_size == capacity) {
         cout << "\nOverflow: Could not insertKey\n";
         return;
     }
@@ -66,8 +62,7 @@ void MinHeap::insertKey(int k)
     harr[i] = k;
 
     // Fix the min heap property if it is violated
-    while (i != 0 && harr[parent(i)] > harr[i])
-    {
+    while (i != 0 && harr[parent(i)] > harr[i]) {
         swap(&harr[i], &harr[parent(i)]);
         i = parent(i);
     }
@@ -75,23 +70,19 @@ void MinHeap::insertKey(int k)
 
 // Decreases value of key at index 'i' to new_val.  It is assumed that
 // new_val is smaller than harr[i].
-void MinHeap::decreaseKey(int i, int new_val)
-{
+void MinHeap::decreaseKey(int i, int new_val) {
     harr[i] = new_val;
-    while (i != 0 && harr[parent(i)] > harr[i])
-    {
+    while (i != 0 && harr[parent(i)] > harr[i]) {
         swap(&harr[i], &harr[parent(i)]);
         i = parent(i);
     }
 }
 
 // Method to remove minimum element (or root) from min heap
-int MinHeap::extractMin()
-{
+int MinHeap::extractMin() {
     if (heap_size <= 0)
         return INT_MAX;
-    if (heap_size == 1)
-    {
+    if (heap_size == 1) {
         heap_size--;
         return harr[0];
     }
@@ -107,16 +98,14 @@ int MinHeap::extractMin()
 
 // This function deletes key at index i. It first reduced value to minus
 // infinite, then calls extractMin()
-void MinHeap::deleteKey(int i)
-{
+void MinHeap::deleteKey(int i) {
     decreaseKey(i, INT_MIN);
     extractMin();
 }
 
 // A recursive method to heapify a subtree with the root at given index
 // This method assumes that the subtrees are already heapified
-void MinHeap::MinHeapify(int i)
-{
+void MinHeap::MinHeapify(int i) {
     int l = left(i);
     int r = right(i);
     int smallest = i;
@@ -124,24 +113,21 @@ void MinHeap::MinHeapify(int i)
         smallest = l;
     if (r < heap_size && harr[r] < harr[smallest])
         smallest = r;
-    if (smallest != i)
-    {
+    if (smallest != i) {
         swap(&harr[i], &harr[smallest]);
         MinHeapify(smallest);
     }
 }
 
 // A utility function to swap two elements
-void swap(int *x, int *y)
-{
+void swap(int *x, int *y) {
     int temp = *x;
     *x = *y;
     *y = temp;
 }
 
 // Driver program to test above functions
-int main()
-{
+int main() {
     MinHeap h(11);
     h.insertKey(3);
     h.insertKey(2);