Merge sort: differenze tra le versioni

Contenuto cancellato Contenuto aggiunto
Riga 234:
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};
public static void main(String[] args){
int vector[]= {System.out.println("Array 10,Non 3, 15, 2, 1, 4, 9, 0}Ordinato:");
print(vector);
System.out.println("Array Non Ordinato:");
System.out.println();
print(vector);
mergeSort(vector);
System.out.println();
System.out.println("Array Non Ordinato Con MergeSort:");
 
mergeSort print(vector);
}
System.out.println("Array Ordinato Con MergeSort:");
}
print(vector);
}
}
 
[[Categoria:Algoritmi di ordinamento]]