Looking for simple algor. for merging two arrays

Question

Do anyone have a simple algorithm for merging two arrays where both arrays can be null or length=0

Answer 1

class Merger
     private int[] arr;
     public Merger(int[] pa, int[] pb) {
          arr = new int[pa.length + pb.length];
          for (int x=0; x < pa.length; x++) {
               arr[x] = pa[x];
          for (int x=0; x < pb.length; x++) {
               arr[x+pa.length] = pb[x];
     public int[] getArray() {
          return arr;
public class MergeMaker
     public static void main(String[] args) {
          int[] a = { 1, 2, 3 };
          int[] b = { 7, 8, 9 };
          Merger m = new Merger(a, b);
          int[] c = m.getArray();
          for (int x=0; x < c.length; x++) {
               System.out.println(c[x]);
}Mark