运行 ❯
获取您
自己的
网站
×
更改方向
更改主题,暗/亮
前往空间
Python
C
Java
my_array = [64, 34, 25, 12, 22, 11, 90, 5] n = len(my_array) for i in range(n-1): for j in range(n-i-1): if my_array[j] > my_array[j+1]: my_array[j], my_array[j+1] = my_array[j+1], my_array[j] print("Sorted array:", my_array) #Python
#include <stdio.h> int main() { int my_array[] = {64, 34, 25, 12, 22, 11, 90, 5}; int n = sizeof(my_array) / sizeof(my_array[0]); for (int i = 0; i < n-1; i++) { for (int j = 0; j < n-i-1; j++) { if (my_array[j] > my_array[j+1]) { int temp = my_array[j]; my_array[j] = my_array[j+1]; my_array[j+1] = temp; } } } printf("Sorted array: "); for (int i = 0; i < n; i++) { printf("%d ", my_array[i]); } printf("\n"); return 0; } //C
public class Main { public static void main(String[] args) { int[] my_array = {64, 34, 25, 12, 22, 11, 90, 5}; int n = my_array.length; for (int i = 0; i < n-1; i++) { for (int j = 0; j < n-i-1; j++) { if (my_array[j] > my_array[j+1]) { int temp = my_array[j]; my_array[j] = my_array[j+1]; my_array[j+1] = temp; } } } System.out.print("Sorted array: "); for (int i = 0; i < n; i++) { System.out.print(my_array[i] + " "); } System.out.println(); } } //Java
Python 结果
C 结果
Java 结果
排序后的数组: [5, 11, 12, 22, 25, 34, 64, 90]
排序后的数组: 5 11 12 22 25 34 64 90
排序后的数组: 5 11 12 22 25 34 64 90