Ordenamiento Insercion

Ordenamiento Insercion

public static void Insercion(int [] arr){

for (int i=1;i < arr.length;i++){

int j=i;
int aux = arr[j];

while( (j > 0) && (aux < arr[j-1]) ){

arr[j] = arr[j-1];
j--;
}

arr[j] = aux;
}
}

0 comentarios: