Counting the number of steps taken by the sorting algorithm

2 visualizaciones (últimos 30 días)
arfnhtylz
arfnhtylz el 26 de Mzo. de 2017
Editada: Stephen23 el 27 de Mzo. de 2017
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:)

Respuesta aceptada

Joshua
Joshua el 27 de Mzo. de 2017
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

Más respuestas (0)

Categorías

Más información sobre Multidimensional Arrays en Help Center y File Exchange.

Etiquetas

Community Treasure Hunt

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

Start Hunting!

Translated by