mergesort in matlab

main.m
function A = mergesort(A)
    n = length(A);
    if n > 1
        m = floor(n/2);
        left = mergesort(A(1:m));
        right = mergesort(A(m+1:n));
        A = merge(left,right);
    end
end

function C = merge(A,B)
    nA = length(A);
    nB = length(B);
    C = zeros(1,nA+nB);
    i = 1; j = 1; k = 1;
    while i <= nA && j <= nB
        if A(i) <= B(j)
            C(k) = A(i);
            i = i+1;
        else
            C(k) = B(j);
            j = j+1;
        end
        k = k+1;
    end
    while i <= nA
        C(k) = A(i);
        i = i+1; k = k+1;
    end
    while j <= nB
        C(k) = B(j);
        j = j+1; k = k+1;
    end
end
655 chars
35 lines