Having vector sorted by using While Loops + Diff()

Hi. My function has to sort a numerical vector by using only while loops, diff(),any(), or all()

• Must Use a While Loop
• No For Loop

n=length(v);

while ~any(diff(v) >= 0) % detects if vector is sorted.
    i1=ceil(n*rand(1));
    i2=ceil(n*rand(1));
    temp=v(i1);
    v(i1)=v(i2);
    v(i2)=temp;
end
order = v;

        
    

[Walter Roberson]

[] is a built-in function.

numel() is a built-in function.

/ is a built-in function.

diff() is a built-in function.

: (colon) is a built-in function.

Indexing is a built-in function.

< is a built-in function.

subtraction is a built-in function.

It turns out that it is not possible to sort a vector without using built-in functions.

[Brandon Tsang]

Revised the question. Sorry for the misleading title.

[Walter Roberson]

That's better, but what question is being asked?

[Walter Roberson]

I see you edited what you posted, but you still have not asked a question. You made some statements, but you did not ask anything from us.

http://www.mathworks.com/matlabcentral/answers/6200-tutorial-how-to-ask-a-question-on-answers-and-get-a-fast-answer

Answer 1

[Ayush Goyal]

From my understanding of the question you want to write a function to sort vector using only while loops, diff(), any(), or all() but you are getting wrong outputs. There is error in your code in the condition part of while loop and to sort the vector in increasing order you should use the following code:

n=length(v); 
while any(diff(v) <= 0) % Change this line
    i1=ceil(n*rand(1)); 
    i2=ceil(n*rand(1)); 
    temp=v(i1); 
    v(i1)=v(i2); 
    v(i2)=temp; 
end 
order = v;