ALGORITMI DI ORDINAMENTO (MATLAB E JAVA)
MATLAB
1. % Selection Sort For
for i = 1:(length(v)-1)
k = i;
for j = (i+1): length(v)
if v(k) > v(j)
k = j;
end
end
if i ~= k
temp = v(i);
v(i) = v(k);
v(k) = temp;
end
end
2. % Bubble Sort For
for i=2:length(v)
for j=length(v):-1:i
if v(j)<v(j-1)
temp = v(j);
v(j) = v(j-1);
v(j-1) = temp;
end
end
end
3. % Insertion Sort For
for i=1:length(v)
temp=v(i);
j=i-1;
while j>0 && v(j)>temp
v(j+1)=v(j);
j = j - 1;
end
v(j+1) = temp;
end
JAVA
1. BUBBLE SORT – O(n^2)
public void bubbleSort(int[] v) {
for (int i = 0; i < v.length - 1; i++) {
for (int j = 0; j < v.length - i - 1; j++) {
if (v[j] > v[j + 1]) {
int temp = v[j];
v[j] = v[j + 1];
v[j + 1] = temp;
}
}
}
}
