// merge a b to c

enum 
  10 n

ax = array 
  1 2 3 5 7 9 11 13 15 17

bx = array
  6 8 10 12 14 16 18 20 21 22

to merge a b c | i j k =
  while (i < n) & (j < n)
    if a[i] < b[j]
      c[k] = a[i]
      i = i + 1
      k = k + 1
    else if b[j] < a[i]
      c[k] = b[j]
      j = j + 1
      k = k + 1
    else
      c[k] = a[i]
      i = i + 1
      k = k + 1
      c[k] = b[j]
      j = j + 1
      k = k + 1
  while i < n
    c[k] = a[i]
    i = i + 1
    k = k + 1
  while j < n
    c[k] = b[j]
    j = j + 1
    k = k + 1

to show c | i =
  for i 0 (2*n)-1
    print c[i] space

to main =
  cx = array (2*n)
  merge ax bx cx
  show cx