add heap sort

Author: luisgsilva950

src_ordenacao_alianca_rebelde_algoritmo2/main.cc

@@ -14,48 +14,73 @@ bool mustSwap(const Civilization &c1, const Civilization &c2) {
     }
 }
 
+void heapify(vector<Civilization> &vec, int n, int i) {
+    int largest = i;
+    int l = 2 * i + 1;
+    int r = 2 * i + 2;
+    if (l < n && mustSwap(vec[l], vec[largest]))
+        largest = l;
 
-void merge(vector<Civilization> &vec, int low, int high, int mid) {
-    int i, j, k;
-    Civilization c[vec.size()];
-    i = low;
-    k = low;
-    j = mid + 1;
-    while (i <= mid && j <= high) {
-        if (mustSwap(vec[i], vec[j])) {
-            c[k] = vec[i];
-            k++;
-            i++;
-        } else {
-            c[k] = vec[j];
-            k++;
-            j++;
-        }
-    }
-    while (i <= mid) {
-        c[k] = vec[i];
-        k++;
-        i++;
-    }
-    while (j <= high) {
-        c[k] = vec[j];
-        k++;
-        j++;
-    }
-    for (i = low; i < k; i++) {
-        vec[i] = c[i];
+    if (r < n && mustSwap(vec[r], vec[largest]))
+        largest = r;
+    if (largest != i) {
+        swap(vec[i], vec[largest]);
+        heapify(vec, n, largest);
     }
 }
 
-void mergeSort(vector<Civilization> &vec, int L, int R) {
-    if (L < R) {
-        int m = (L + R) / 2;
-        mergeSort(vec, L, m);
-        mergeSort(vec, m + 1, R);
-        merge(vec, L, R, m);
+
+void heapSort(vector<Civilization> &vec, int n) {
+    for (int i = n / 2 - 1; i >= 0; i--)
+        heapify(vec, n, i);
+    for (int i = n - 1; i >= 0; i--) {
+        swap(vec[0], vec[i]);
+        heapify(vec, i, 0);
     }
 }
 
+
+//void merge(vector<Civilization> &vec, int low, int high, int mid) {
+//    int i, j, k;
+//    Civilization c[vec.size()];
+//    i = low;
+//    k = low;
+//    j = mid + 1;
+//    while (i <= mid && j <= high) {
+//        if (mustSwap(vec[i], vec[j])) {
+//            c[k] = vec[i];
+//            k++;
+//            i++;
+//        } else {
+//            c[k] = vec[j];
+//            k++;
+//            j++;
+//        }
+//    }
+//    while (i <= mid) {
+//        c[k] = vec[i];
+//        k++;
+//        i++;
+//    }
+//    while (j <= high) {
+//        c[k] = vec[j];
+//        k++;
+//        j++;
+//    }
+//    for (i = low; i < k; i++) {
+//        vec[i] = c[i];
+//    }
+//}
+//
+//void mergeSort(vector<Civilization> &vec, int L, int R) {
+//    if (L < R) {
+//        int m = (L + R) / 2;
+//        mergeSort(vec, L, m);
+//        mergeSort(vec, m + 1, R);
+//        merge(vec, L, R, m);
+//    }
+//}
+
 int main() {
     int N = 0;
     cin >> N;
@@ -67,7 +92,7 @@ int main() {
         civilizations.push_back(new Civilization(input, distance, size));
     }
     int MAX_LENGTH = civilizations.size() - 1;
-    mergeSort(civilizations, 0, MAX_LENGTH);
+    heapSort(civilizations, MAX_LENGTH);
     for (auto &&civilization : civilizations) {
         cout << civilization.getName().c_str() << " " << civilization.getDistance() << " " << civilization.getSize()
              << "\n";