function mergeSort(data[], size)
{
    if (size > 1)
    {
        sizeLeft = size / 2; 
        sizeRight = size - sizeLeft; 
 
        mergeSort(data, sizeLeft); 
        mergeSort(data, size / 2, sizeRight); 
        temp = new Array(size); 
    
 
        indexLeft = 0;  
        indexRight = size / 2; 
        indexTemp = 0; 
 
        while (indexLeft < sizeLeft && indexRight < size)
        {
            if (data[indexLeft] < data[indexRight]) 
            {
                temp[indexTemp] = data[indexLeft]; 
                ++indexLeft; 
                ++indexTemp; 
            }
            else
            {
                temp[indexTemp] = data[indexRight]; 
                ++indexRight;      
                ++indexTemp; 
            }
        }
        while (indexLeft < sizeLeft) 
        {
            temp[indexTemp] = data[indexLeft]; 
            ++indexLeft; 
            ++indexTemp; 
        }
        while (indexRight < size) 
        {
            temp[indexTemp] = data[indexRight]; 
            ++indexRight; 
            ++indexTemp; 
        }        
        data = temp; 
    }
    return; 
}