From b0bc65de9a9af59c68684b16ac8205839daec12f Mon Sep 17 00:00:00 2001 From: anolis-copy Date: Fri, 9 Sep 2022 10:02:45 +0000 Subject: [PATCH 1/3] =?UTF-8?q?=E6=96=B0=E5=BB=BA=20shankailun10?= MIME-Version: 1.0 Content-Type: text/plain; charset=UTF-8 Content-Transfer-Encoding: 8bit --- codes/shankailun10/.keep | 0 1 file changed, 0 insertions(+), 0 deletions(-) create mode 100644 codes/shankailun10/.keep diff --git a/codes/shankailun10/.keep b/codes/shankailun10/.keep new file mode 100644 index 000000000..e69de29bb -- Gitee From 1a324827ec47c72413ae8773b6be6f4ae24480e6 Mon Sep 17 00:00:00 2001 From: anolis-copy Date: Fri, 9 Sep 2022 10:04:32 +0000 Subject: [PATCH 2/3] add codes/shankailun10/9637756.java. Signed-off-by: anolis-copy --- codes/shankailun10/9637756.java | 22 ++++++++++++++++++++++ 1 file changed, 22 insertions(+) create mode 100644 codes/shankailun10/9637756.java diff --git a/codes/shankailun10/9637756.java b/codes/shankailun10/9637756.java new file mode 100644 index 000000000..7d31f2960 --- /dev/null +++ b/codes/shankailun10/9637756.java @@ -0,0 +1,22 @@ +/** +* 冒泡排序函数 +* aa bb cc +* +* @param a 待排序的数组 +* @param n 待排序的数组长度 +*/ +public static void bubbleSort(int[] a, int n) { + // 你的代码，使无序数组 a 变得有序 + int i, j; + for (i = 0; i < n; i++) {//表示n次排序过程。 + for (j = 1; j < n - i; j++) { + if (a[j - 1] > a[j]) {//前面的数字大于后面的数字就交换 + //交换a[j-1]和a[j] + int temp; + temp = a[j - 1]; + a[j - 1] = a[j]; + a[j] = temp; + } + } + } +} //end \ No newline at end of file -- Gitee From 4fbd8a3e1bb920e18d88061c44999ea7f92bbc15 Mon Sep 17 00:00:00 2001 From: anolis-copy Date: Fri, 9 Sep 2022 10:08:25 +0000 Subject: [PATCH 3/3] update codes/shankailun10/9637756.java. Signed-off-by: anolis-copy --- codes/shankailun10/9637756.java | 12 ++++++------ 1 file changed, 6 insertions(+), 6 deletions(-) diff --git a/codes/shankailun10/9637756.java b/codes/shankailun10/9637756.java index 7d31f2960..4dbc26599 100644 --- a/codes/shankailun10/9637756.java +++ b/codes/shankailun10/9637756.java @@ -1,10 +1,10 @@ /** -* 冒泡排序函数 -* aa bb cc -* -* @param a 待排序的数组 -* @param n 待排序的数组长度 -*/ + * 冒泡排序函数 + * aa bb cc + * + * @param a 待排序的数组 + * @param n 待排序的数组长度 + */ public static void bubbleSort(int[] a, int n) { // 你的代码，使无序数组 a 变得有序 int i, j; -- Gitee