public class MergeSort {

     public static void sort(int [] A,int p, int r)
     {
         if(p<r)
         {
             int q = (int) Math.floor( (p+r)/2 );
             sort(A,p,q);
             sort(A,q+1,r);
             merge(A,p,q,r);
         }
         return ;

     }
     public static void merge(int [] A, int p, int q, int r)
     {
         int n1 = q-p+1;
         int n2 = r-q;
         int [] L = new int[n1];
         int [] R = new int[n2];
         for(int i=0; i<n1; i++)
           L[i] = A[p+i];
         for(int i=0; i<n2;i++)
             R[i]=A[q+i+1];

         int i=0;
         int j=0;
         int counter = p;
         while(i<L.length && j<R.length)
         {
             if(L[i]<=R[j])
             {
                 A[counter]=L[i];
                 i++;
             }
             else
             {
                 A[counter]=R[j];
                 j++;
             }
             counter++;
         }
         if(i==L.length)
         {
             for(int k=j;k<R.length;k++)
                 A[counter++] = R[k];
         }
         else
         {
             for(int k=i;k<L.length;k++)
                 A[counter++] = L[k];
         }
     }
 }

 public class SumTwoEqual {

     /**
      * @param args
      */
     public static boolean TestExists(int A[],int X)
     {
         MergeSort.sort(A, 0, A.length - 1 );
         int i = 0;
         int j = A.length-1;
         while(i<j)
         {
             if(A[i]+A[j]==X)
                 return true;
             else if(A[i]+A[j] > X)
                 j--;
             else
                 i++;
         }
         return false;
     }

     public static void main(String[] args) {
         int A[] = {1,2,5,7,9,14,25,35,13,15};
         boolean a = TestExists(A,22);
         System.out.println(a);
     }
 }