键盘输入三个数比较大小(由小到大) 冒泡排序&暴力求解&不采用中间变量的冒泡排序

不二嘉ya

已于 2022-09-05 12:21:33 修改

阅读量282

点赞数

于 2022-09-05 12:01:11 首次发布

本文链接：https://blog.csdn.net/weixin_65687276/article/details/126702263

版权

java 算法开发语言

package study.test08;

import java.util.Scanner;

public class paixu {
    public static void main(String[] args) {
        demo01();
    }
    public static void demo01(){
        Scanner scanner = new Scanner(System.in);
        System.out.print("x：");
        int x = scanner.nextInt();
        System.out.print("y：");
        int y=scanner.nextInt();
        System.out.print("z：");
        int z=scanner.nextInt();
        if(x>y) {
            if(x>z){
                if(y>z){
                    System.out.println(z+"<"+y+"<"+x);
                    return;
                }else{
                    System.out.println(y+"<"+z+"<"+x);
                    return;
                }
            }else{
                System.out.println(y+"<"+x+"<"+z);
                return;
            }
        }
        if(x>z){
            if(z>y){
                System.out.println(y+"<"+z+"<"+x);
                return;
            }else{
                if(x>y){
                    System.out.println(z+"<"+y+"<"+x);
                    return;
                }else{
                    System.out.println(z+"<"+x+"<"+y);
                    return;
                }
            }
        }
        if(y>z){
            if(z>x){
                System.out.println(x+"<"+z+"<"+y);
                return;
            }else{
                if(x>y){
                    System.out.println(z+"<"+y+"<"+x);
                    return;
                }else {
                    System.out.println(z+"<"+x+"<"+y);
                    return;
                }
            }
        }
    }
}

暴力求解，分别进行逐一比较

package study.test08;

import java.util.Scanner;

public class paixu1 {
    public static void main(String[] args) {
        Scanner scanner = new Scanner(System.in);
        System.out.print("x：");
        int x = scanner.nextInt();
        System.out.print("y：");
        int y = scanner.nextInt();
        System.out.print("z：");
        int z = scanner.nextInt();
        int[] paiXu = {x, y, z};
        for (int i = 0; i < paiXu.length; i++) {
            for (int j = 0; j < paiXu.length - i-1 ; j++) {
                int temp = 0;
                if (paiXu[j] > paiXu[j + 1]) {
                    temp = paiXu[j];
                    paiXu[j] = paiXu[j + 1];
                    paiXu[j + 1] = temp;
                }
            }
        }
        for (int k = 0; k <3 ; k++) {
            System.out.println(paiXu[k]);
        }
    }
}

以上是冒泡排序求解

package study.test08;
import java.util.Scanner;
public class paixu2 {
    public static void main(String[] args) {
        Scanner scanner = new Scanner(System.in);
        System.out.print("x：");
        int x = scanner.nextInt();
        System.out.print("y：");
        int y = scanner.nextInt();
        System.out.print("z：");
        int z = scanner.nextInt();
        int[] paiXu = {x, y, z};
        for (int i = 0; i < paiXu.length; i++) {
            for (int j = 0; j < paiXu.length - i-1 ; j++) {
             if (paiXu[j]>paiXu[j+1]){
                 paiXu[j]=paiXu[j]+paiXu[j+1];
                 paiXu[j+1]=paiXu[j]-paiXu[j+1];
                 paiXu[j]=paiXu[j]-paiXu[j+1];
                }
            }
        }
        for (int k = 0; k <3 ; k++) {
            System.out.println(paiXu[k]);
        }
    }
}