Counting the number of steps taken by the sorting algorithm

2 次查看（过去 30 天）
arfnhtylz
arfnhtylz 2017-3-26
编辑： Stephen23 2017-3-27
Hi, I have a code that sorts the elements by their values as an Assignment, but I also need to specify the number of steps that were taken by the code.I searched everywhere and couldn't find any answers Could somebody help me? Here is the code:
X = [9 2 5 7 3 8 1 4 6 0 -2 -7];
n = length(X);
for i=1:n-1
A=X(i);
for j=i+1:n;
if X(j)>A;
A=X(j);
X(j)=X(i);
X(i)=A;
end
end
end
X
Thank you in advance:)

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

采纳的回答

Joshua
Joshua 2017-3-27
X = [9 2 5 7 3 8 1 4 6 0 -2 -7];
n = length(X);
numSteps=0;
for i=1:n-1
A=X(i);
for j=i+1:n;
if X(j)>A;
A=X(j);
X(j)=X(i);
X(i)=A;
numSteps=numSteps+1;
end
end
end
X
numSteps

更多回答（0 个）

类别

在 Help Center 和 File Exchange 中查找有关 Multidimensional Arrays 的更多信息

标签

Community Treasure Hunt

Find the treasures in MATLAB Central and discover how the community can help you!

Start Hunting!

Translated by