LG2-算法OrdenacaoRecursao AlunaJulia·桑塔纳·多斯·安霍SP3025918 递减法 // CODIGO AULA 1-冒泡排序// public static void main(String [] args){ int vetor [] = {3,6,2,1,8,4}; 辅助布尔控制 for(int i=0; i< vetor xss=removed xss=removed> vetor[j + 1]){ aux = vetor[j]; vetor[j] = vetor[j + 1]; vetor[j + 1]; =