add test data

test/testcases/qsort.c

@@ -0,0 +1,44 @@
+#include "io.inc"
+// Target: qsort
+// Possible optimization: Dead code elimination, common expression, strength
+// reduction REMARKS: nothing.
+
+int a[10100];
+int n = 10000;
+
+int qsrt(int l, int r) {
+  int i = l;
+  int j = r;
+  int x = a[(l + r) / 2];
+  while (i <= j) {
+    while (a[i] < x)
+      i++;
+    while (a[j] > x)
+      j--;
+    if (i <= j) {
+      int temp = a[i];
+      a[i] = a[j];
+      a[j] = temp;
+      i++;
+      j--;
+    }
+  }
+  if (l < j)
+    qsrt(l, j);
+  if (i < r)
+    qsrt(i, r);
+  return 0;
+}
+
+int main() {
+  int i;
+  for (i = 1; i <= n; i++)
+    a[i] = n + 1 - i;
+  qsrt(1, n);
+  for (i = 1; i <= n; i++) {
+    printInt(a[i]);
+    printStr(" ");
+  }
+  printStr("\n");
+  return judgeResult % Mod;  // 105
+}