diff --git a/tests/Regression/eu-elfcompress-breaks-hard-links/bubble.c b/tests/Regression/eu-elfcompress-breaks-hard-links/bubble.c
index 9ec3260..f8b643a 100644
--- a/tests/Regression/eu-elfcompress-breaks-hard-links/bubble.c
+++ b/tests/Regression/eu-elfcompress-breaks-hard-links/bubble.c
@@ -1,36 +1,4 @@
-/* Bubble sort code */
-
-#include <stdio.h>
-
 int main()
 {
-  int array[100], n, c, d, swap;
-
-  printf("Enter number of elements\n");
-  scanf("%d", &n);
-
-  printf("Enter %d integers\n", n);
-
-  for (c = 0; c < n; c++)
-    scanf("%d", &array[c]);
-
-  for (c = 0 ; c < n - 1; c++)
-  {
-    for (d = 0 ; d < n - c - 1; d++)
-    {
-      if (array[d] > array[d+1]) /* For decreasing order use '<' instead of '>' */
-      {
-        swap       = array[d];
-        array[d]   = array[d+1];
-        array[d+1] = swap;
-      }
-    }
-  }
-
-  printf("Sorted list in ascending order:\n");
-
-  for (c = 0; c < n; c++)
-     printf("%d\n", array[c]);
-
   return 0;
 }