MergeSortRunnable

public class MergeSort implements Runnable{
	private int[] arr;
	private int Size;
	private int left;
	private int right;
	private int[] resultArr ;
	
	public MergeSort(int[] arr, int i, int j) {
		this.arr = arr;
		this.Size = arr.length;
		//this.resultArr = new int[j-i+1];
		this.left  = i;
		this.right = j;
	}
	public void run() {
		System.out.println("Starting new thread left :"+this.left+" right "+this.right);
		sort();

	}
	public static void main(String[] args) {
		int arr[] ={3,6,4,2,1,10} ;
		MergeSort mr = new MergeSort(arr,0,arr.length-1);
		Thread t = new Thread(mr);
    
		t.start();
		//mr.run();

		try {
			t.join();
		} catch (InterruptedException e) {
			// TODO Auto-generated catch block
			e.printStackTrace();
		}

		for (int i :mr.resultArr)
			System.out.print(i+" ");
		//int res[]= mr.sort(0,arr.length-1);

	}
	
	private void sort() {
		if(left==right && left >=0 )
		{
			this.resultArr = new int[]{arr[left]};
			System.out.println(arr[left]);
			System.out.println(this.resultArr);
			
			return;
		}
		
		if(left>right)
			return;

		int rightLimit = this.left+(right-left)/2;
		//int leftArr[] = sort( left,rightLimit );

		MergeSort mleft = new MergeSort(arr,left,rightLimit);
		Thread t1 = new Thread(mleft);
		t1.start();

		int leftlimit = 1 + rightLimit;            
		//int rightArr[] = sort(leftlimit , right);

		MergeSort mright= new MergeSort(arr,leftlimit,right);
		Thread t2 = new Thread(mright);
		t2.start();


		try {
			t1.join();
			t2.join();
		} catch (InterruptedException e) {
			// TODO Auto-generated catch block
			e.printStackTrace();
		}

		merge(mleft.resultArr,mright.resultArr);
		
	}
	
	
	private  int[] merge(int[] left, int[] right) {
		resultArr = new int[left.length+right.length];

		int r = 0, i = 0, j = 0;
		while(i<left.length && j <right.length )
		{   
			if( i<left.length && j<right.length && left[i] < right[j] )
				resultArr[r++] = left[i++];

			else if( j<right.length && i<left.length && right[j] < left[i])
				resultArr[r++] = right[j++];
		}   


		while(i<left.length)
		{
			resultArr[r++] = left[i++];
		}        

		while(j<right.length)
		{
			resultArr[r++] = right[j++];
		}        


		//System.out.println("resultArr "+resultArr);
		return resultArr;
		}
	}