if numel(v) > 1 middle = ceil(numel(v) / 2); left = v(1:middle); right = v(middle+1:end); left = mergeSort(left); right = mergeSort(right); if left(end) 0) && (numel(right) > 0) if(left(1) 0 v(counter:end) = left; elseif numel(right) > 0 v(counter:end) = right; end %end merge end end; %if toc