冒泡排序
降序
package array;
import java.util.Arrays;
public class Demo7 {
public static void main(String[] args) {
int[] a ={1,323,63,3,5,3434};
int[] sort = sort(a);
System.out.println(Arrays.toString(sort));
}
public static int[] sort(int[] array){
int temp = 0;
for (int i = 0; i <array.length-1 ; i++) {
for (int j = 0; j <array.length-1-i ; j++) {
if (array[j+1]>array[j]){
temp = array[j];
array[j]=array[j+1];
array[j+1]=temp;
}
}
}
return array;
}
}
升序
package array;
import java.util.Arrays;
public class Demo7 {
public static void main(String[] args) {
int[] a ={1,323,63,3,5,3434};
int[] sort = sort(a);
System.out.println(Arrays.toString(sort));
}
public static int[] sort(int[] array){
int temp = 0;
for (int i = 0; i <array.length-1 ; i++) {
for (int j = 0; j <array.length-1-i ; j++) {
if (array[j]>array[j+1]){
temp = array[j+1];
array[j+1]=array[j];
array[j]=temp;
}
}
}
return array;
}
}
*优化
package array;
import java.util.Arrays;
public class Demo7 {
public static void main(String[] args) {
int[] a ={1,323,63,3,5,3434};
int[] sort = sort(a);
System.out.println(Arrays.toString(sort));
}
public static int[] sort(int[] array){
int temp = 0;
for (int i = 0; i <array.length-1 ; i++) {
boolean flag =false;
for (int j = 0; j <array.length-1-i ; j++) {
if (array[j]>array[j+1]){
temp = array[j+1];
array[j+1]=array[j];
array[j]=temp;
flag=true;
}
}
if (flag==false){
break;
}
}
return array;
}
}