Implementazioni di algoritmi/Merge sort: differenze tra le versioni

Contenuto cancellato Contenuto aggiunto
Riga 248:
<source lang="java">
import java.util.*;
import java.util.Arrays;
public class Sort {
Line 285 ⟶ 286:
for (int i=0;i<numElemen;i++,posEnd--)
a[posEnd]=vectorAux[posEnd];
}
 
public static void print(int[] vector) {
System.out.print("{");
for(int i=0;i<vector.length;i++) {
System.out.print(" "+vector[i]);
if(i==vector.length-1)
System.out.println(" }");
else System.out.print(",");
}
}
public static void main(String[] args) {
int vector[]= { 10, 3, 15, 2, 1, 4, 9, 0};
System.out.println("Array Non Ordinato: "+Arrays.toString(vector)+"\n");
print mergeSort(vector);
System.out.println("Array Ordinato Con MergeSort: "+Arrays.toString(vector));
}
mergeSort(vector);
System.out.println("Array Ordinato Con MergeSort:");
print(vector);
}
}
</source>