[数据结构][Sort]Merge Sort

public class Solution
{
    public void adapter(int[] data)
    {
        mergeSort(data, 0, data.length - 1);
    }
    
    public void mergeSort(int[] data, int left, int right)
    {
        if(left >= right)
        {
            return;
        }
        
        int middle = (left + right) / 2;
        
        mergeSort(data, left, middle);
        mergeSort(data, middle + 1, right);
        
        mergeArray(data, left, middle, right);
    }
    
    public void mergeArray(int[] data, int left, int middle, int right)
    {
        int[] temp = new int[right - left + 1];
        
        int pointerOne = left;
        int pointerTwo = middle + 1;
        
        int count = 0;
        
        for(count = 0; count < temp.length; count ++)
        {
            if((pointerOne > middle) || (pointerTwo > right))
            {
                break;
            }
            
            if(data[pointerOne] < data[pointerTwo])
            {
                temp[count] = data[pointerOne ++];
            }
            else
            {
                temp[count] = data[pointerTwo ++];
            }
        }
        
        while(pointerOne <= middle)
        {
            temp[count ++] = data[pointerOne ++];
        }
        
        while(pointerTwo <= right)
        {
            temp[count ++] = data[pointerTwo ++];
        }
        
        for(int i = 0; i < temp.length; i ++)
        {
            data[left + i] = temp[i];
        }
    }
    
}