一:传统的冒泡排序
图解:
代码实现:
import org.junit.Test;
import java.util.Arrays;
public class BubbleSort {
int[] nums={55,23,97,64,56,56,12,87,54,10};
public void bubbleSort(int[] nums){
int length=nums.length;
for(int i=0;i<length;i++){
for(int j=0;j<length-1-i;j++){
if(nums[j]>nums[j+1]){
swap(nums,j,j+1);
}
}
}
}
private void swap(int[] nums,int i,int j){
int temp=nums[i];
nums[i]=nums[j];
nums[j]=temp;
}
@Test
public void test01(){
bubbleSort(nums);
System.out.println(Arrays.toString(nums));
}
}