一、冒泡排序
算法思路:将两个相邻的数字依次比较大小,不断交换位置,最后完成大小排序。
public static void main(String[] args) {
//冒泡排序
int[] array = {1, 3, 4, 2, 16};
bubbleSort(array);
System.out.println(Arrays.toString(array));
}
public static void bubbleSort(int[] array){
for (int i = 0;i < array.length;i++){
for (int j = 0;j < array.length-i-1;j++){
if(array[j] > array[j+1]){
int tmp = array[j+1];
array[j+1] = array[j];
array[j] = tmp;
}
}
}
}
java内置排序算法
public static void main(String[] args) {
int[] arr = {2,1,5,3};
Arrays.sort(arr);
System.out.println(Arrays.toString(arr));
}
输出:
二、数组逆序
算法思路:将首位数字分别相互交换,左边下标递增,右边下标递减
public static void main(String[] args) {
//数组逆序
int[] arr = {1,2,3,4,5,6,7};
reverse(arr);
System.out.println(Arrays.toString(arr));
}
public static void reverse(int[] arr){
int left = 0;
int right = arr.length-1;
while(left < right){
int tmp = arr[right];
arr[right] = arr[left];
arr[left] = tmp;
right--;
left++;
}
输出:
三、二维数组
二维数组格式:如int[行][列] = {初识数据类型}
public static void main(String[] args) {
//二维数组
int[][] arr = {{1,2,3},{4,5,6}};
for (int row = 0;row < arr.length;row++){
for (int col = 0;col < arr[row].length;col++){
System.out.printf("%d\t",arr[row][col]);
}
System.out.println();
}
}
输出: