使用冒泡排序,实现数组从小到大排序,并且进行数组的复制、反转、查找工作
package com.lyj.exercise; //冒泡排序 public class bubbleSortExer { public static void main (String[] args){ int[]arr = new int[]{34,5,22,-98,6,-76,0,-3}; for(int i = 0;i < arr.length - 1;i++){ for(int j = 0;j < arr.length - 1 - i;j++){ if(arr[j] > arr[j + 1]){ int temp = arr[j]; arr[j] = arr[j + 1]; arr[j + 1] = temp; } } } System.out.println("从小到大排序为:"); for( int i=0;i < arr.length ;i++){ System.out.println(arr[i] ); } //数组的反转 for(int i = 0;i < arr.length/2;i++){ int temp = arr[i]; arr[i] = arr[arr.length-i-1]; arr[arr.length-i-1] = temp; } System.out.println("数组反转后为:"); for( int i=0;i < arr.length ;i++){ System.out.println(arr[i] + "t"); } //数组的复制 int[] arr1 = new int [arr.length]; for( int i=0;i < arr.length ;i++){ arr1[i] = arr[i]; } System.out.println("数组复制后新数组为:"); for( int i=0;i < arr.length ;i++){ System.out.println(arr1[i]); } //数组的查找 //线性查找: int dest = 22; boolean isFalg = true; for( int i=0;i < arr.length ;i++){ if(dest == arr[i]){ System.out.println("找到啦,位置为:" + i); isFalg = false; break; } } if(isFalg){ System.out.println("很遗憾没找到"); } } }
欢迎分享,转载请注明来源:内存溢出
评论列表(0条)