diff --git a/BucketSort_13513042_13513076.pdf b/BucketSort_13513042_13513076.pdf
new file mode 100644
index 0000000000000000000000000000000000000000..36b166b29d4e3853ec2a82e37e459db98b6b13b3
Binary files /dev/null and b/BucketSort_13513042_13513076.pdf differ
diff --git a/bucketsort b/bucketsort
deleted file mode 100755
index 0658450b509c0971b80878d62b958bad4af401ba..0000000000000000000000000000000000000000
Binary files a/bucketsort and /dev/null differ
diff --git a/bucketsort_tri b/bucketsort_tri
deleted file mode 100755
index cae8708b66ec7a35522f2cae2f4ed342104e7fec..0000000000000000000000000000000000000000
Binary files a/bucketsort_tri and /dev/null differ
diff --git a/bucketsort_tri.c b/bucketsort_tri.c
deleted file mode 100644
index a7d20c1f47c98adbbe14e93d7eb808432655d9f2..0000000000000000000000000000000000000000
--- a/bucketsort_tri.c
+++ /dev/null
@@ -1,40 +0,0 @@
-//#include "mpi.h"
-#include <stdlib.h>
-#include <time.h>
-#include <stdio.h>
-
-
-int* insertionSort(int *array,int n){
-  int d,c,t;
-
-  for (c = 1 ; c <= n - 1; c++) {
-    d = c;
- 
-    while ( d > 0 && array[d] < array[d-1]) {
-      t          = array[d];
-      array[d]   = array[d-1];
-      array[d-1] = t;
- 
-      d--;
-    }
-  }
- 
-  printf("Sorted list in ascending order:\n");
- 
-  for (c = 0; c <= n - 1; c++) {
-    printf("%d\n", array[c]);
-  }
- return array;
-
-}
-
-int main(int argc, char *argv[]) {
-	int a[5] = {5,4,8,9,3};
-	int *b;	
- b = insertionSort(a,5);
- printf("%d", b[0]);
-
-
-
-}
-
diff --git a/test b/test
deleted file mode 100755
index a40c3569c95f9c111952e6588e1593e87c1b7cad..0000000000000000000000000000000000000000
Binary files a/test and /dev/null differ