bool check_ordered(array a)
{
  for (i = 0; i < (int) a - 1; i++) {
    if (a[i] > a[i+1]) return false;
  }
  return true;
}

for (i = 0; i < 100; i++) {
  a[i] = 10000 - i * 4;
}

# bubble-sort algorithm
for (i = (int) a - 1; i >= 0; i--)
  for (j = 0; j < i; j++)
    if (a[j] > a[j+1]) {
      b = a[j+1];
      a[j+1] = a[j];
      a[j] = b;
    }

if (!check_ordered(a)) exit(1);