冒泡排序算法

【1】冒泡排序：

public class BubbleSort {
    public static void main(String[] args){
        int arr[] = {24,69,80,57,13};
        int temp = 0;
        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]) {
                    temp = arr[j];
                    arr[j] = arr[j + 1];
                    arr[j + 1] = temp;
                }
            }
        }
            for(int j =0;j<arr.length;j++){
                System.out.print(arr[j]+" ");
            }

    }
}

【2】查找：

import java.util.Scanner;
public class paixu {
    public static void main(String[] args) {
    String arr[] ={"叶瑄","艾因","罗夏","路辰","风砚"};
    Scanner myScanner = new Scanner(System.in);
    System.out.println("请输入姓名：");
    String findname =myScanner.next();
    int index = -1;
    for(int i=0;i<arr.length;i++){
        if(findname.equals(arr[i])){
            System.out.println("恭喜你找到了"+"【"+findname+"】");
            System.out.println("他的编号（数组下标）为："+i);
            index=i;
        }
    }
    if(index==-1){
        System.out.println("【查无此人】没有找到"+findname);
    }
    }
}