use "sorting.g";

fun main() -> int@
{
  let n = 20;
  let a = new int[n];
  let j = n/2;
  let k = n - j;

  /* 0, 2, 4, ... */
  for (let i = 0; i != j; ++i)
    a[i] = i * 2;

  /* 1, 3, 5, ... */
  for (let i = 0; i != k; ++i)
    a[i+j] = i * 2 + 1;

  inplace_merge(a, a + j, a + n);

  for (let i = 0; i != n; ++i)
    if (a[i] != i) return -1;
  
  return 0;
}