public class Exercise7a
{
  // merges two sorted arrays a and b into a sorted result array
  public static int[] merge(int[] a, int [] b)
  {
    int m = a.length;
    int n = b.length;
    int[] c = new int[m+n];
    int i = 0;
    int j = 0;
    int k = 0;
    while (k < m+n)
    {
      if (i == m)
      {
        c[k] = b[j];
        j = j+1;
      }
      else if (j == n)
      {
        c[k] = a[i];
        i = i+1;
      }
      else if (a[i] <= b[j])
      {
        c[k] = a[i];
        i = i+1;
      }
      else
      {
        c[k] = b[j];
        j = j+1;
      }
      k = k+1;
    }
    return c;
  }
}