【C语言和Java】冒泡排序：输入十个整数，然后按由小到大的顺序排列，并输出

C语言实现冒泡排序：输入十个整数，然后按由小到大的顺序排列，并输出

#define _CRT_SECURE_NO_WARNINGS
#include<stdio.h>

//冒泡排序：输入十个整数，然后按由小到大的顺序排列，并输出

int main() {
	int arr[10] = { 0 };
	int i = 0, j = 0, b = 0;
	printf("请输入10个整数：");
	//赋值
	for (i = 0; i < 10; i++) {
		scanf("%d", &arr[i]);
	}
	//排序
	for (i = 0; i < 9; i++) {
		for (j = 0; j < 9 - i; j++) {
			if (arr[j] > arr[j + 1]) {
				b = arr[j];
				arr[j] = arr[j + 1];
				arr[j + 1] = b;
			}
		}
	}
	//输出
	for (i = 0; i < 10; i++) {
		printf("%d ",arr[i]);
	}
	return 0;
}

运行结果;

Java实现：

package com.daily.exer;

public class BubbleSort {
    public static void main(String[] args) {
        int[] arr1 = new int[]{1, 3, 5, 7, 9, 2, 4, 6, 8, 10};
        System.out.println("未排序前：");
        for (int i = 0; i < arr1.length; i++) {
            System.out.print(arr1[i] + " ");
        }
        for (int i = 0; i < arr1.length - 1; i++) {
            for (int j = 0; j < arr1.length - 1 - i; j++) {
                if (arr1[j] > arr1[j + 1]) {
                    int temp = arr1[j];
                    arr1[j] = arr1[j + 1];
                    arr1[j + 1] = temp;
                }
            }
        }
        System.out.println();
        System.out.println("排序后：");
        for (int i = 0; i < arr1.length; i++) {
            System.out.print(arr1[i] + " ");
        }
    }
}

运行结果：