Counting the number of steps taken by the sorting algorithm
조회 수: 1 (최근 30일)
이전 댓글 표시
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:)
댓글 수: 0
채택된 답변
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에서 Price and Analyze Financial Instruments에 대해 자세히 알아보기
Community Treasure Hunt
Find the treasures in MATLAB Central and discover how the community can help you!
Start Hunting!