recursively split an array about the median value in matlab

Here's the code to recursively split an array about the median value in Matlab:

main.m
function result = recursiveMedianSplit(array)
    n = length(array);                  % get length of array
    if n == 1                           % base case
        result = array;
    else
        [~, index] = sort(array);       % sort array ascending
        medianIndex = ceil(n/2);        % get index of median value
        medianValue = array(index(medianIndex));
        leftArray = array(index(1:medianIndex-1));  % split array into two parts
        rightArray = array(index(medianIndex+1:end));
        result = [recursiveMedianSplit(leftArray) medianValue recursiveMedianSplit(rightArray)];
    end
end
617 chars
14 lines

Here, we create a function recursiveMedianSplit that takes an input array and returns the split result. The function first checks if the length of the array is 1, in which case the array is the result. Otherwise, it sorts the array in ascending order and finds the index of the median value. It then splits the array into two parts, one to the left and one to the right of the median value, and recursively calls itself on each part. Finally, the result is the concatenation of the left array, the median value, and the right array.

Note that this implementation uses a divide-and-conquer strategy to recursively split the array about the median value, which makes it efficient for large arrays.