From 0d2341999a9c844954aca9ed4cc739b8fde34584 Mon Sep 17 00:00:00 2001
From: Santo Cariotti <dcariotti24@gmail.com>
Date: Sun, 10 May 2020 18:57:13 +0200
Subject: chore: move algorithms file into self directory

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

(limited to 'I_anno/Programmazione_2/mergesort.cc')

diff --git a/I_anno/Programmazione_2/mergesort.cc b/I_anno/Programmazione_2/mergesort.cc
deleted file mode 100644
index 21dc8af..0000000
--- a/I_anno/Programmazione_2/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[] = {2, 4, 72, 100, 2, 12, 0, 0, 1, 23, 45, 12, 120, 3, 6};
-    for(int i = 0; i < 15; ++i) {
-        cout << a[i] << ' ';
-    }
-    cout << endl;
-    mergesort(a, 0, 14);
-    for(int i = 0; i < 15; ++i) {
-        cout << a[i] << ' ';
-    }
-
-    return 0;
-}
-- 
cgit v1.2.3-18-g5258