Recursion and MergeSort : How is it working ?

I am making a program to do MergeSort. It is not ready yet. Here is the test code which can split an array into half - works properly.
But I dont understand how it works - can someone explain this in terms of Stacks etc ?
Please let me know if my way is good or not.

What i am trying :
MyArray class has an int array called FULL. It stores the Left and Right halves of FULL in its Lt and Rt variables respectively.
It takes the array to be sorted and splits it into halves till array of size 1 is obtained. We (should) store the bottom-most array reference so
that we can go upwards (by using the MyArray "above" variable) and do the sorting.

public class MergeSort
{
	static int[]given = {7,4,2,8,1,9,3,10,6,5,11};
	
	public static void main(String[]args)
	{
		MyArray ma = new MyArray(given);	
				
	}

}

class MyArray
{	
	int[]full;
	MyArray Lt; 
	MyArray Rt; 
	MyArray above; 
	
	MyArray(){}
	
	MyArray(int[]a)
	{
		full = a; 
	}
	
	public MyArray split(MyArray ma)
	{
		int s = ma.full.length; 
		int l = (s+1)/2; 
		int r = s-l; 
		MyArray lowest = new MyArray();

if(s>1)
		{
			ma.Lt = new MyArray(); 
			ma.Lt.full = new int[l];
			for(int i = 0 ; i<l ; i++ ){ma.Lt.full[i] = ma.full[i];}
			show(ma.Lt,"LEFT");
		
			ma.Rt = new MyArray(); 
			ma.Rt.full = new int[r];
			for(int j = 0, k = l ; j<r ; j++,k++){ma.Rt.full[j] = ma.full[k];}
			show(ma.Rt,"RIGHT");
			
			System.out.println("\n");
			
			ma.Lt.above = ma;
			ma.Rt.above = ma;
			
			
			//the recursions
			ma.split(ma.Lt);
			ma.split(ma.Rt); 
			
		}
		
		return lowest; // feature not ready yet.
		
	}
		
		
	public void show(MyArray x,String msg)
	{
		System.out.print(msg + " ");
		for(int p : x.full){System.out.print(" : " + p);}	
		System.out.print(" \t ");
	}
		
}

You can go here: to check how merge sort works and how it is implemented:
Programing AI

Ashish Schottky wrote:You can go here: to check how merge sort works and how it is implemented:
Programing AI

Thanks for the link.

I prefer to do it myself. If there are any serious flaws in my approach, please let me know.

Pencil, paper and a large eraser. That is what you need. You need to write down exactly how you intend to implement the splitting part of the algorithm, and how you stop when your divided arrays are 1 element long. Then you need to write down how to implement the merging part. When you have got it down to words of one syllable, you can convert your instructions into code quite easily.

I would suggest some more links about sorting: 1 2 3.

Campbell Ritchie wrote:Pencil, paper and a large eraser. That is what you need. You need to write down exactly how you intend to implement the splitting part of the algorithm, and how you stop when your divided arrays are 1 element long. Then you need to write down how to implement the merging part. When you have got it down to words of one syllable, you can convert your instructions into code quite easily.

I would suggest some more links about sorting: 1 2 3.

Thanks for the links.

I am trying this again. Lots of paper in the bin already

You're supposed to rub out your errors, saving you throwing lots of paper away.

Or maybe the paper is where you wrote down your comments and opinions