I need help arranging a vector using recursion please.

Question

Kevin Smith 2017-11-5

0
链接

此问题的直接链接

https://ww2.mathworks.cn/matlabcentral/answers/365170-i-need-help-arranging-a-vector-using-recursion-please

评论： Walter Roberson 2020-9-22

I am working on a function called vecSort that is supposed to arrange a vector from the smallest element to the largest using recursion. I cannot use the 'sort' function or any function similar to it. I have to use the min and/or max functions. This is what I have so far:

function vectorSort(vec)
L=length(vec);
if L<1
    vec=[];
elseif L==1
    vec=vec;
else i>1;

I have set the terminating condition but I cannot figure out how to get function to call on itself to arrange the vector from the minimum element to the largest element.

3 个评论
显示 1更早的评论隐藏 1更早的评论

Walter Roberson 2017-11-5

You cannot sort recursively in any useful way unless you also have a phase for combining already-sorted regions.

Kevin Smith 2017-11-6

在 MATLAB Online 中打开

function vecSort(vec)
sortedVec=[];
if length(vec)<=1        %terminating statement 
    sorted_vec=vec;
else 
    [m p]=min(vec); %find the minimum value and its position
    vec=[vec(1:(p-1)),vec((p+1):end)]; %remove from vec
    sortedVec=[sortedVec,m]; %add this value to the sortedVec
    vectorsorted=[ vecSort()]
end

Walter could you please tell me how I could make this function to call on itself with recursion? I believe there is something I can add to the last line to make it repeat until the orginal vector is empty and the new one is organizedthe way I need it (least to greatest).

请先登录，再进行评论。

请先登录，再回答此问题。

Answer 1

Walter Roberson 2017-11-6

0
链接

此回答的直接链接

https://ww2.mathworks.cn/matlabcentral/answers/365170-i-need-help-arranging-a-vector-using-recursion-please#answer_289611

Since you do not have a re-combination phase, your "recursive" function will have to be written from a theoretical point of view, just to prove that it can be done, instead of from a practical point of view. You will need to change your strategy into something closer to a bubble sort, and see https://www.mathworks.com/matlabcentral/answers/361333-help-i-need-to-convert-numbers-into-english-words-using-recursion#answer_285821 on how to transform the "for" loops into recursion.

I would never write a recursive sort this way, and I would never recommend teaching about recursion in this way.

If you had a phase designed to merge the results of two vectors that were already sorted then then that can be done usefully and effectively with recursion. But as you appear to be insisting that you do not have such a phase, you will have to use the ugly theoretical transform between for and recursion, just to satisfy your assignment of having used recursion.