Merge Sort

int arra[10000], temp[10000];

void merged(int lo, int hi)
{
    if(lo == hi)
        return;
    int mid = (lo + hi)/2;

    merged(lo, mid);
    merged(mid + 1, hi);

    int i=0, j=0, k=0;
    for(i=lo, j= mid+1, k = lo; k <= hi; k++ )
    {
        if(i == mid + 1)
            temp[k] = arra[j++];
        else if(j == hi + 1)
            temp[k] = arra[i++];
        else if(arra[i] < arra[j])
            temp[k] = arra[i++];
        else
            temp[k] = arra[j++];
    }
     for(k = lo; k <= hi; k++)
            arra[k] = temp[k];
}