1 files changed, 138 insertions, 0 deletions
diff --git a/Year_2/Algorithms/build-min-heap.cc b/Year_2/Algorithms/build-min-heap.cc
new file mode 100644
index 0000000..6c27193
--- /dev/null
+++ b/Year_2/Algorithms/build-min-heap.cc
@@ -0,0 +1,138 @@
+#include <cstdlib>
+#include <fstream>
+#include <iostream>
+
+using namespace std;
+
+template <class H>
+class MinHeap {
+public:
+    void
+    min_heapify(int i)
+    {
+        if (i > _size)
+            return;
+
+        size_t l = left(i);
+        size_t r = right(i);
+        size_t min = i;
+
+        if (l < _size && _A[l] < _A[i])
+            min = l;
+        if (r < _size && _A[r] < _A[min])
+            min = r;
+
+        if (min != i) {
+            swap(i, min);
+            min_heapify(min);
+        }
+    }
+
+    size_t
+    left(int i)
+    {
+        return i << 1;
+    }
+    size_t
+    right(int i)
+    {
+        return (i << 1) | 1;
+    }
+
+    ~MinHeap()
+    {
+        delete _A;
+    }
+
+    MinHeap(H* A, int size, ostream& out)
+        : _size(size + 1)
+    {
+        _A = new H[_size + 2];
+        for (int i = 1; i <= size; ++i) {
+            _A[i] = A[i - 1];
+        }
+
+        for (int i = _size / 2; i > 0; --i)
+            min_heapify(i);
+
+        for (int i = 1; i <= size; ++i) {
+            out << _A[i] << ' ';
+        }
+        out << endl;
+    }
+
+    void
+    swap(int x, int y)
+    {
+        auto t = _A[x];
+        _A[x] = _A[y];
+        _A[y] = t;
+    }
+
+    H
+    extract_min()
+    {
+        swap(1, _size);
+        --_size;
+        min_heapify(1);
+
+        return _A[_size + 1];
+    }
+
+private:
+    H* _A;
+    size_t _size;
+    size_t _n;
+};
+
+int
+main(int argc, char** argv)
+{
+    ifstream fin("input.txt");
+    ofstream fout("output.txt");
+    string t;
+    int n, j;
+
+    for (int i = 0; i < atoi(argv[1]); ++i) {
+        fin >> t;
+        fin >> n;
+
+        if (t == "bool") {
+            bool* arr = new bool[n];
+            for (j = 0; j < n; ++j)
+                fin >> arr[j];
+
+            MinHeap<bool>* mh = new MinHeap<bool>(arr, n, fout);
+
+            delete mh;
+        } else if (t == "double") {
+            double* arr = new double[n];
+            for (j = 0; j < n; ++j)
+                fin >> arr[j];
+
+            MinHeap<double>* mh = new MinHeap<double>(arr, n, fout);
+
+            delete mh;
+        } else if (t == "char") {
+            char* arr = new char[n];
+            for (j = 0; j < n; ++j)
+                fin >> arr[j];
+
+            MinHeap<char>* mh = new MinHeap<char>(arr, n, fout);
+
+            delete mh;
+        } else if (t == "int") {
+            int* arr = new int[n];
+            for (j = 0; j < n; ++j)
+                fin >> arr[j];
+
+            MinHeap<int>* mh = new MinHeap<int>(arr, n, fout);
+
+            delete mh;
+        }
+    }
+
+    fin.close();
+    fout.close();
+    return 0;
+}