From d2edbc38cac8da52f58c5cd3da6c0c625fa05736 Mon Sep 17 00:00:00 2001
From: Santo Cariotti <santo@dcariotti.me>
Date: Sat, 6 Feb 2021 19:56:36 +0100
Subject: conf: rename

---
 1_anno/Programmazione_2/algorithms/mergesort.cc | 52 -------------------------
 1 file changed, 52 deletions(-)
 delete mode 100644 1_anno/Programmazione_2/algorithms/mergesort.cc

(limited to '1_anno/Programmazione_2/algorithms/mergesort.cc')

diff --git a/1_anno/Programmazione_2/algorithms/mergesort.cc b/1_anno/Programmazione_2/algorithms/mergesort.cc
deleted file mode 100644
index 68d28cb..0000000
--- a/1_anno/Programmazione_2/algorithms/mergesort.cc
+++ /dev/null
@@ -1,52 +0,0 @@
-#include<iostream>
-
-using namespace std;
-
-void merge(int A[], int l, int q, int r) {
-    int i = l;
-    int j = q+1;
-    int k = l;
-    int B[r];
-
-    while((i <= q) && (j <= r)) {
-        if(A[i] <= A[j])
-            B[k] = A[i++];
-        else
-            B[k] = A[j++];
-
-        k++;
-    }
-
-    while(i <= q)
-        B[k++] = A[i++];
-
-    while(j <= r)
-        B[k++] = A[j++];
-
-    for(k = l; k <= r; ++k) 
-        A[k] = B[k];
-}
-
-void mergesort(int A[], int l, int r) {
-    if(l < r) {
-        int q = (l+r)/2;
-        mergesort(A, l, q);
-        mergesort(A, q+1, r);
-        merge(A, l, q, r);
-    }
-}
-
-
-int main() {
-    int a[] = {7,1,22,3,2,12,27,31,6};
-    for(int i = 0; i < 9; ++i) {
-        cout << a[i] << ' ';
-    }
-    cout << endl;
-    mergesort(a, 0, 8);
-    for(int i = 0; i < 9; ++i) {
-        cout << a[i] << ' ';
-    }
-
-    return 0;
-}
-- 
cgit v1.2.3-18-g5258