diff --git a/.idea/.gitignore b/.idea/.gitignore deleted file mode 100644 index 13566b81b018ad684f3a35fee301741b2734c8f4..0000000000000000000000000000000000000000 --- a/.idea/.gitignore +++ /dev/null @@ -1,8 +0,0 @@ -# Default ignored files -/shelf/ -/workspace.xml -# Editor-based HTTP Client requests -/httpRequests/ -# Datasource local storage ignored files -/dataSources/ -/dataSources.local.xml diff --git a/.idea/checkstyle-idea.xml b/.idea/checkstyle-idea.xml deleted file mode 100644 index 287a44db1c532d1e5d946c2d09f520df3e241219..0000000000000000000000000000000000000000 --- a/.idea/checkstyle-idea.xml +++ /dev/null @@ -1,17 +0,0 @@ - - - - - - \ No newline at end of file diff --git a/.idea/inspectionProfiles/Project_Default.xml b/.idea/inspectionProfiles/Project_Default.xml deleted file mode 100644 index 6560a98983ec708cf9d8b5c5c3776d7bd39c475b..0000000000000000000000000000000000000000 --- a/.idea/inspectionProfiles/Project_Default.xml +++ /dev/null @@ -1,36 +0,0 @@ - - - - \ No newline at end of file diff --git a/.idea/misc.xml b/.idea/misc.xml deleted file mode 100644 index 8ed5f34df8494ed90108ce6a2ebd4fa2a8296e95..0000000000000000000000000000000000000000 --- a/.idea/misc.xml +++ /dev/null @@ -1,6 +0,0 @@ - - - - - - \ No newline at end of file diff --git a/.idea/modules.xml b/.idea/modules.xml deleted file mode 100644 index 0b11f0fda5d28b0e14ca0fc6150ac9fa519be341..0000000000000000000000000000000000000000 --- a/.idea/modules.xml +++ /dev/null @@ -1,8 +0,0 @@ - - - - - - - - \ No newline at end of file diff --git a/.idea/vcs.xml b/.idea/vcs.xml deleted file mode 100644 index 35eb1ddfbbc029bcab630581847471d7f238ec53..0000000000000000000000000000000000000000 --- a/.idea/vcs.xml +++ /dev/null @@ -1,6 +0,0 @@ - - - - - - \ No newline at end of file diff --git a/15372338.java b/15372338.java deleted file mode 100644 index c2afaa2414da1853e4500b02c6de9068b64aeafe..0000000000000000000000000000000000000000 --- a/15372338.java +++ /dev/null @@ -1,18 +0,0 @@ -/** - * 冒泡排序函数 - * aa bb cc - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - for(int i = 0; i < n-1 ; i++){ - for (int j = 0;j < n-1-i;j++){ - if(a[j] > a[j+1]){ - int temp = a[j]; - a[j] = a[j+1]; - a[j+1] = temp; - } - } - } - -} //end diff --git a/15620229.java b/15620229.java deleted file mode 100644 index 462bdb84d30a2b7c0d01f9f6822e460a63dd9b1d..0000000000000000000000000000000000000000 --- a/15620229.java +++ /dev/null @@ -1,18 +0,0 @@ -/** - * 冒泡排序函数 - * aa bb cc - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int[] a, int n){ - for (int i = 0; i < n - 1; i++) { - for (int j = 0; j < n - 1 - i; j++) { - if (a[j] > a[j + 1]) { - // 交换 a[j] 和 a[j+1] - int temp = a[j]; - a[j] = a[j + 1]; - a[j + 1] = temp; - } - } - } -} //end diff --git a/15651046.java b/15651046.java deleted file mode 100644 index fbce6b9fab5d372cc89cb5bb815f4116c001935d..0000000000000000000000000000000000000000 --- a/15651046.java +++ /dev/null @@ -1,19 +0,0 @@ -/** - * 冒泡排序函数 - * aa bb cc - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - // 你的代码，使无序数组 a 变得有序 - for(int i = 0; i < n; i++) { - for(int j = 0; j < n - i - 1; ++j) { - if(a[j] > a[j + 1]) { - int tmp = a[j]; - a[j] = a[j + 1]; - a[j + 1] = tmp; - } - } - } -} //end - diff --git a/15684741.java b/15684741.java deleted file mode 100644 index 421e92a6ba7ece3e8dcb629f5fc7bfb9d801c84e..0000000000000000000000000000000000000000 --- a/15684741.java +++ /dev/null @@ -1,19 +0,0 @@ -/** - * 冒泡排序函数 - * aa bb cc - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - // 你的代码，使无序数组 a 变得有序 - for (int i = 0; i < n - 1; i++) { - for (int j = 0; j < n - 1 - i; j++) { - if (a[j] > a[j + 1]) { - // 交换 arr[j] 和 arr[j + 1] - int temp = a[j]; - a[j] = a[j + 1]; - a[j + 1] = temp; - } - } - } -} //end diff --git a/15778243.java b/15778243.java deleted file mode 100644 index a57d05656de61f697ffadba58f1b92f4d00625a7..0000000000000000000000000000000000000000 --- a/15778243.java +++ /dev/null @@ -1 +0,0 @@ -sr diff --git a/15781013.java b/15781013.java deleted file mode 100644 index 9d6bf11c3c00eac06ec836e2f36f370e08ace065..0000000000000000000000000000000000000000 --- a/15781013.java +++ /dev/null @@ -1,24 +0,0 @@ -public class Color { - public enum color{红,蓝,绿,黄,黑}; - public static void main(String arg[]){ - int i,j,k,num=0; - color colors[]=color.values(); - System.out.println("从红，蓝，绿，黄，黑这五种颜色中取出三种不同颜色的排列有以下可能性："); - for(i=0;i a[j + 1]) { - int temp = a[j]; - a[j] = a[j + 1]; - a[j + 1] = temp; - } - } - } -} //end diff --git a/9619048.java b/9619048.java deleted file mode 100644 index 49439b988c5b5a64a116feb7bb7eb1809459ccc8..0000000000000000000000000000000000000000 --- a/9619048.java +++ /dev/null @@ -1,18 +0,0 @@ -/** - * 冒泡排序函数 - * 通过重复地遍历待排序数组，比较并交换相邻元素，使无序数组变得有序 - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - for(int i = 0; i < n - 1; i++) { - for(int j = 0; j < n - 1 - i; j++) { - // 如果当前元素大于下一个元素，则交换它们 - if(a[j] > a[j + 1]) { - int temp = a[j]; - a[j] = a[j + 1]; - a[j + 1] = temp; - } - } - } -} //end diff --git a/LICENSE b/LICENSE deleted file mode 100644 index c8df5b0c4bf4a5c578f5fbbc3c16d85b8216dcb8..0000000000000000000000000000000000000000 --- a/LICENSE +++ /dev/null @@ -1,29 +0,0 @@ -BSD 3-Clause License - -Copyright (c) 2024, njjkxllj -All rights reserved. - -Redistribution and use in source and binary forms, with or without -modification, are permitted provided that the following conditions are met: - -* Redistributions of source code must retain the above copyright notice, this - list of conditions and the following disclaimer. - -* Redistributions in binary form must reproduce the above copyright notice, - this list of conditions and the following disclaimer in the documentation - and/or other materials provided with the distribution. - -* Neither the name of the copyright holder nor the names of its - contributors may be used to endorse or promote products derived from - this software without specific prior written permission. - -THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS" -AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE -IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE -DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT HOLDER OR CONTRIBUTORS BE LIABLE -FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL -DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR -SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER -CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, -OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE -OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. diff --git a/README.en.md b/README.en.md deleted file mode 100644 index 15602cc07eef98fcd9634be29a6f00c6948646cc..0000000000000000000000000000000000000000 --- a/README.en.md +++ /dev/null @@ -1,36 +0,0 @@ -# activity-school - -#### Description -高校活动-pr仓库 - -#### Software Architecture -Software architecture description - -#### Installation - -1. xxxx -2. xxxx -3. xxxx - -#### Instructions - -1. xxxx -2. xxxx -3. xxxx - -#### Contribution - -1. Fork the repository -2. Create Feat_xxx branch -3. Commit your code -4. Create Pull Request - - -#### Gitee Feature - -1. You can use Readme\_XXX.md to support different languages, such as Readme\_en.md, Readme\_zh.md -2. Gitee blog [blog.gitee.com](https://blog.gitee.com) -3. Explore open source project [https://gitee.com/explore](https://gitee.com/explore) -4. The most valuable open source project [GVP](https://gitee.com/gvp) -5. The manual of Gitee [https://gitee.com/help](https://gitee.com/help) -6. The most popular members [https://gitee.com/gitee-stars/](https://gitee.com/gitee-stars/) diff --git a/README.md b/README.md deleted file mode 100644 index f30f250c52bcdd12fd11df28ed7b1052b8033566..0000000000000000000000000000000000000000 --- a/README.md +++ /dev/null @@ -1,5 +0,0 @@ -## 介绍 - -本仓库用于提交龙蜥一刻-高校活动任务的PR。 - -注意：完成迁移后，必须将成果提交到本仓库，才能获得贡献值。 diff --git a/Zoey12138/15846229.java b/Zoey12138/15846229.java deleted file mode 100644 index 5cc1c636a63a4a96ad5c1161dade3c61f9551d9b..0000000000000000000000000000000000000000 --- a/Zoey12138/15846229.java +++ /dev/null @@ -1,21 +0,0 @@ -/** - * 冒泡排序函数 - * 功能：将无序数组 a 按照从小到大的顺序进行排序 - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - // 外层循环控制所有轮数 - for (int i = 0; i < n - 1; i++) { - // 内层循环控制每一轮的比较次数 - for (int j = 0; j < n - 1 - i; j++) { - // 如果前一个元素大于后一个元素，则交换它们的位置 - if (a[j] > a[j + 1]) { - // 交换元素 - int temp = a[j]; - a[j] = a[j + 1]; - a[j + 1] = temp; - } - } - } -} //end diff --git a/activity-school b/activity-school deleted file mode 160000 index e3039d45f32adcbac55d745197aa67e2d487bb6f..0000000000000000000000000000000000000000 --- a/activity-school +++ /dev/null @@ -1 +0,0 @@ -Subproject commit e3039d45f32adcbac55d745197aa67e2d487bb6f diff --git a/activity-school.iml b/activity-school.iml deleted file mode 100644 index c76917ee364712f1fe8483123dbecd73d05fea0f..0000000000000000000000000000000000000000 --- a/activity-school.iml +++ /dev/null @@ -1,16 +0,0 @@ - - - - - - - - - - - - - - \ No newline at end of file diff --git a/codes/ BHUIJ217892/11003994.java b/codes/ BHUIJ217892/11003994.java deleted file mode 100644 index b9bf7818d9ffdce1bf2bd0863a51890bffa3f951..0000000000000000000000000000000000000000 --- a/codes/ BHUIJ217892/11003994.java +++ /dev/null @@ -1,11 +0,0 @@ -public static void bubbleSort(int [] a, int n) { - for (int i=0 ; ia[j+1]) { - int temp=a[j]; - a[j]=a[j+1]; - a[j+1]=temp; - } - } - } -} \ No newline at end of file diff --git a/codes/ Dreamlover/11202583.java b/codes/ Dreamlover/11202583.java deleted file mode 100644 index 272a12fc81d3dd0e857bba9ae001c15818fb7123..0000000000000000000000000000000000000000 --- a/codes/ Dreamlover/11202583.java +++ /dev/null @@ -1,18 +0,0 @@ - /** - * 冒泡排序函数 - * aa bb cc - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ - public static void bubbleSort(int [] arr, int n){ - // 你的代码，使无序数组 a 变得有序 - for (int i = 0; i < n; i++) { - for (int j = (i + 1); j < n; j++) { - if (arr[i] > arr[j]) { - int temp = arr[i]; - arr[i] = arr[j]; - arr[j] = temp; - } - } - } - } //end \ No newline at end of file diff --git a/codes/ Greeter/11262621.java b/codes/ Greeter/11262621.java deleted file mode 100644 index cdabc2e0876ad629e41ff055727cf3af34be8917..0000000000000000000000000000000000000000 --- a/codes/ Greeter/11262621.java +++ /dev/null @@ -1,20 +0,0 @@ -/** - * 冒泡排序函数 - * aa bb cc - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - // 你的代码，使无序数组 a 变得有序 - for (int i = 0; i < n; i++) { - for (int j = i + 1; j < n; j++) { - if (a[i] > a[j]) { - int temp = a[j]; - a[j] = a[i]; - a[i] = temp; - - } - } - } - -} //end \ No newline at end of file diff --git a/codes/ Iboydoss/11210866.java b/codes/ Iboydoss/11210866.java deleted file mode 100644 index cdabc2e0876ad629e41ff055727cf3af34be8917..0000000000000000000000000000000000000000 --- a/codes/ Iboydoss/11210866.java +++ /dev/null @@ -1,20 +0,0 @@ -/** - * 冒泡排序函数 - * aa bb cc - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - // 你的代码，使无序数组 a 变得有序 - for (int i = 0; i < n; i++) { - for (int j = i + 1; j < n; j++) { - if (a[i] > a[j]) { - int temp = a[j]; - a[j] = a[i]; - a[i] = temp; - - } - } - } - -} //end \ No newline at end of file diff --git a/codes/ Jingyu/11302198.java b/codes/ Jingyu/11302198.java deleted file mode 100644 index cacd12f1e4e4360dd1ffa22f3741e376110bcde4..0000000000000000000000000000000000000000 --- a/codes/ Jingyu/11302198.java +++ /dev/null @@ -1,18 +0,0 @@ -/** - * 冒泡排序函数 - * aa bb cc - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - // 你的代码，使无序数组 a 变得有序 - for(int i=0;ia[j+1]){ - a[j] = a[j]+a[j+1]; - a[j+1] = a[j]-a[j+1]; - a[j] = a[j]-a[j+1]; - } - } - } -} //end \ No newline at end of file diff --git a/codes/ NProgress/11324505.java b/codes/ NProgress/11324505.java deleted file mode 100644 index 9e7534d4b41cf071c848fa4d5c08c6519526b6e3..0000000000000000000000000000000000000000 --- a/codes/ NProgress/11324505.java +++ /dev/null @@ -1,18 +0,0 @@ -/** - * 冒泡 排序 函数 - * aa bb cc - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - // 你的代码，使无序数组 a 变得有序 - for (int i = 0; i < n; i++) { - for (int j = 0; j < i; j++) { - if (a[i] < a[j]) { - int t = a[i]; - a[i] = a[j]; - a[j] = t; - } - } - } -}//end \ No newline at end of file diff --git a/codes/ OPReno/11276365.java b/codes/ OPReno/11276365.java deleted file mode 100644 index cacd12f1e4e4360dd1ffa22f3741e376110bcde4..0000000000000000000000000000000000000000 --- a/codes/ OPReno/11276365.java +++ /dev/null @@ -1,18 +0,0 @@ -/** - * 冒泡排序函数 - * aa bb cc - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - // 你的代码，使无序数组 a 变得有序 - for(int i=0;ia[j+1]){ - a[j] = a[j]+a[j+1]; - a[j+1] = a[j]-a[j+1]; - a[j] = a[j]-a[j+1]; - } - } - } -} //end \ No newline at end of file diff --git a/codes/ PHPhph/.keep b/codes/ PHPhph/.keep deleted file mode 100644 index e69de29bb2d1d6434b8b29ae775ad8c2e48c5391..0000000000000000000000000000000000000000 diff --git a/codes/ PHPhph/11120724.java b/codes/ PHPhph/11120724.java deleted file mode 100644 index 667eee0f585ec38ce639cb36d80df080e935946d..0000000000000000000000000000000000000000 --- a/codes/ PHPhph/11120724.java +++ /dev/null @@ -1,11 +0,0 @@ -public static void bubbleSort(int [] a,int n){ - for(int i = 0; i < n-1 ; i++){ - for (int j = 0;j < n-1-i;j++){ - if(a[j] > a[j+1]){ - int temp = a[j]; - a[j] = a[j+1]; - a[j+1] = temp; - } - } - } -} \ No newline at end of file diff --git a/codes/ Qw2229188799/11089611.java b/codes/ Qw2229188799/11089611.java deleted file mode 100644 index 607a9246394a817e793043af61e051c104c68f46..0000000000000000000000000000000000000000 --- a/codes/ Qw2229188799/11089611.java +++ /dev/null @@ -1,18 +0,0 @@ -/** - * 冒泡 排序 函数 - * aa bb cc - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - // 你的代码，使无序数组 a 变得有序 - for (int i = 0; i < n; i++) { - for (int j = 0; j < i; j++) { - if (a[i] < a[j]) { - int t = a[i]; - a[i] = a[j]; - a[j] = t; - } - } - } -}//end diff --git a/codes/ String/11118586.java b/codes/ String/11118586.java deleted file mode 100644 index cacd12f1e4e4360dd1ffa22f3741e376110bcde4..0000000000000000000000000000000000000000 --- a/codes/ String/11118586.java +++ /dev/null @@ -1,18 +0,0 @@ -/** - * 冒泡排序函数 - * aa bb cc - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - // 你的代码，使无序数组 a 变得有序 - for(int i=0;ia[j+1]){ - a[j] = a[j]+a[j+1]; - a[j+1] = a[j]-a[j+1]; - a[j] = a[j]-a[j+1]; - } - } - } -} //end \ No newline at end of file diff --git a/codes/ YYDS2023/11094401.java b/codes/ YYDS2023/11094401.java deleted file mode 100644 index 1c8889947f924214c71a3c3f202500b4780dc281..0000000000000000000000000000000000000000 --- a/codes/ YYDS2023/11094401.java +++ /dev/null @@ -1,11 +0,0 @@ -public static void bubbleSort(int [] a,int n){ - for(int i = 0; i < n-1 ; i++){ - for (int j = 0;j < n-1-i;j++){ - if(a[j] > a[j+1]){ - int temp = a[j]; - a[j] = a[j+1]; - a[j+1] = temp; - } - } - } -} \ No newline at end of file diff --git a/codes/ Z3608759124/10979186.java b/codes/ Z3608759124/10979186.java deleted file mode 100644 index cdabc2e0876ad629e41ff055727cf3af34be8917..0000000000000000000000000000000000000000 --- a/codes/ Z3608759124/10979186.java +++ /dev/null @@ -1,20 +0,0 @@ -/** - * 冒泡排序函数 - * aa bb cc - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - // 你的代码，使无序数组 a 变得有序 - for (int i = 0; i < n; i++) { - for (int j = i + 1; j < n; j++) { - if (a[i] > a[j]) { - int temp = a[j]; - a[j] = a[i]; - a[i] = temp; - - } - } - } - -} //end \ No newline at end of file diff --git a/codes/ budasan/11121691.java b/codes/ budasan/11121691.java deleted file mode 100644 index 24b49b4b1fd01d1f21be8b362a582158452e41d3..0000000000000000000000000000000000000000 --- a/codes/ budasan/11121691.java +++ /dev/null @@ -1,19 +0,0 @@ -/** - * 冒泡排序函数 - * aa bb cc - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - // 你的代码，使无序数组 a 变得有序 - for(int i = 0 ; i < n - 1 ; i++){ - for(int j = 0 ; j < n - 1 - i ; j++){ - if(a[j] > a[j + 1]){ - int tmp = a[j]; - a[j] = a[j + 1]; - a[j + 1] = tmp; - } - } - } - -} //end \ No newline at end of file diff --git a/codes/ bupiovm0101/11122657.java b/codes/ bupiovm0101/11122657.java deleted file mode 100644 index 4d7083fe05ce3e6d3fadd59d6d55e2cbc50d546d..0000000000000000000000000000000000000000 --- a/codes/ bupiovm0101/11122657.java +++ /dev/null @@ -1,22 +0,0 @@ -/** - * 冒泡排序函数 - * aa bb cc - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - // 你的代码，使无序数组 a 变得有序 - int i, j; - - for(i=0; ia[j]){ - int temp; - temp = a[j-1]; - a[j-1] = a[j]; - a[j] = temp; - } - } - } - -} //end \ No newline at end of file diff --git a/codes/ buzhidao/11118686.java b/codes/ buzhidao/11118686.java deleted file mode 100644 index 8d589d7edfe50246fe5deff283186d81a64dc137..0000000000000000000000000000000000000000 --- a/codes/ buzhidao/11118686.java +++ /dev/null @@ -1,21 +0,0 @@ -/** - * 冒泡排序函数 - * aa bb cc - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a,int n){ - int temp =0; - for(int i = 0;ia[j+1]){ - temp = a[j]; - a[j] = a[j+1]; - a[j+1] = temp; - } - } - } - - - -} \ No newline at end of file diff --git a/codes/ deijia909/.keep b/codes/ deijia909/.keep deleted file mode 100644 index e69de29bb2d1d6434b8b29ae775ad8c2e48c5391..0000000000000000000000000000000000000000 diff --git a/codes/ fasfaf227/.keep b/codes/ fasfaf227/.keep deleted file mode 100644 index e69de29bb2d1d6434b8b29ae775ad8c2e48c5391..0000000000000000000000000000000000000000 diff --git a/codes/ fasfaf227/15820189.java b/codes/ fasfaf227/15820189.java deleted file mode 100644 index 6e9861fa3ec6d5a2553cdccd1bb1e977430c671b..0000000000000000000000000000000000000000 --- a/codes/ fasfaf227/15820189.java +++ /dev/null @@ -1,19 +0,0 @@ -/** - * 冒泡排序函数 - * aa bb cc - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - // 你的代码，使无序数组 a 变得有序 - for (int i = 0; i < n - 1; i++) { - for (int j = 0; j < n - i - 1; j++) { - if (a[j] > a[j + 1]) { - - int temp = a[j]; - a[j] = a[j + 1]; - a[j + 1] = temp; - } - } - } -} //end \ No newline at end of file diff --git a/codes/ gui8989/11228793.java b/codes/ gui8989/11228793.java deleted file mode 100644 index 24b49b4b1fd01d1f21be8b362a582158452e41d3..0000000000000000000000000000000000000000 --- a/codes/ gui8989/11228793.java +++ /dev/null @@ -1,19 +0,0 @@ -/** - * 冒泡排序函数 - * aa bb cc - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - // 你的代码，使无序数组 a 变得有序 - for(int i = 0 ; i < n - 1 ; i++){ - for(int j = 0 ; j < n - 1 - i ; j++){ - if(a[j] > a[j + 1]){ - int tmp = a[j]; - a[j] = a[j + 1]; - a[j + 1] = tmp; - } - } - } - -} //end \ No newline at end of file diff --git a/codes/ liwei2496/11466656.java b/codes/ liwei2496/11466656.java deleted file mode 100644 index 272a12fc81d3dd0e857bba9ae001c15818fb7123..0000000000000000000000000000000000000000 --- a/codes/ liwei2496/11466656.java +++ /dev/null @@ -1,18 +0,0 @@ - /** - * 冒泡排序函数 - * aa bb cc - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ - public static void bubbleSort(int [] arr, int n){ - // 你的代码，使无序数组 a 变得有序 - for (int i = 0; i < n; i++) { - for (int j = (i + 1); j < n; j++) { - if (arr[i] > arr[j]) { - int temp = arr[i]; - arr[i] = arr[j]; - arr[j] = temp; - } - } - } - } //end \ No newline at end of file diff --git a/codes/ lovscene/11290992.java b/codes/ lovscene/11290992.java deleted file mode 100644 index cacd12f1e4e4360dd1ffa22f3741e376110bcde4..0000000000000000000000000000000000000000 --- a/codes/ lovscene/11290992.java +++ /dev/null @@ -1,18 +0,0 @@ -/** - * 冒泡排序函数 - * aa bb cc - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - // 你的代码，使无序数组 a 变得有序 - for(int i=0;ia[j+1]){ - a[j] = a[j]+a[j+1]; - a[j+1] = a[j]-a[j+1]; - a[j] = a[j]-a[j+1]; - } - } - } -} //end \ No newline at end of file diff --git a/codes/ memuqee/11238999.java b/codes/ memuqee/11238999.java deleted file mode 100644 index 24b49b4b1fd01d1f21be8b362a582158452e41d3..0000000000000000000000000000000000000000 --- a/codes/ memuqee/11238999.java +++ /dev/null @@ -1,19 +0,0 @@ -/** - * 冒泡排序函数 - * aa bb cc - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - // 你的代码，使无序数组 a 变得有序 - for(int i = 0 ; i < n - 1 ; i++){ - for(int j = 0 ; j < n - 1 - i ; j++){ - if(a[j] > a[j + 1]){ - int tmp = a[j]; - a[j] = a[j + 1]; - a[j + 1] = tmp; - } - } - } - -} //end \ No newline at end of file diff --git a/codes/ mupimage/11254168.java b/codes/ mupimage/11254168.java deleted file mode 100644 index 8d589d7edfe50246fe5deff283186d81a64dc137..0000000000000000000000000000000000000000 --- a/codes/ mupimage/11254168.java +++ /dev/null @@ -1,21 +0,0 @@ -/** - * 冒泡排序函数 - * aa bb cc - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a,int n){ - int temp =0; - for(int i = 0;ia[j+1]){ - temp = a[j]; - a[j] = a[j+1]; - a[j+1] = temp; - } - } - } - - - -} \ No newline at end of file diff --git a/codes/ neineiya/11260235.java b/codes/ neineiya/11260235.java deleted file mode 100644 index cacd12f1e4e4360dd1ffa22f3741e376110bcde4..0000000000000000000000000000000000000000 --- a/codes/ neineiya/11260235.java +++ /dev/null @@ -1,18 +0,0 @@ -/** - * 冒泡排序函数 - * aa bb cc - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - // 你的代码，使无序数组 a 变得有序 - for(int i=0;ia[j+1]){ - a[j] = a[j]+a[j+1]; - a[j+1] = a[j]-a[j+1]; - a[j] = a[j]-a[j+1]; - } - } - } -} //end \ No newline at end of file diff --git a/codes/ openAI12/11234314.java b/codes/ openAI12/11234314.java deleted file mode 100644 index 272a12fc81d3dd0e857bba9ae001c15818fb7123..0000000000000000000000000000000000000000 --- a/codes/ openAI12/11234314.java +++ /dev/null @@ -1,18 +0,0 @@ - /** - * 冒泡排序函数 - * aa bb cc - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ - public static void bubbleSort(int [] arr, int n){ - // 你的代码，使无序数组 a 变得有序 - for (int i = 0; i < n; i++) { - for (int j = (i + 1); j < n; j++) { - if (arr[i] > arr[j]) { - int temp = arr[i]; - arr[i] = arr[j]; - arr[j] = temp; - } - } - } - } //end \ No newline at end of file diff --git a/codes/ opsation/11293380.java b/codes/ opsation/11293380.java deleted file mode 100644 index cacd12f1e4e4360dd1ffa22f3741e376110bcde4..0000000000000000000000000000000000000000 --- a/codes/ opsation/11293380.java +++ /dev/null @@ -1,18 +0,0 @@ -/** - * 冒泡排序函数 - * aa bb cc - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - // 你的代码，使无序数组 a 变得有序 - for(int i=0;ia[j+1]){ - a[j] = a[j]+a[j+1]; - a[j+1] = a[j]-a[j+1]; - a[j] = a[j]-a[j+1]; - } - } - } -} //end \ No newline at end of file diff --git a/codes/ passass/11299378.java b/codes/ passass/11299378.java deleted file mode 100644 index 9e7534d4b41cf071c848fa4d5c08c6519526b6e3..0000000000000000000000000000000000000000 --- a/codes/ passass/11299378.java +++ /dev/null @@ -1,18 +0,0 @@ -/** - * 冒泡 排序 函数 - * aa bb cc - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - // 你的代码，使无序数组 a 变得有序 - for (int i = 0; i < n; i++) { - for (int j = 0; j < i; j++) { - if (a[i] < a[j]) { - int t = a[i]; - a[i] = a[j]; - a[j] = t; - } - } - } -}//end \ No newline at end of file diff --git a/codes/ sdsacc23/.keep b/codes/ sdsacc23/.keep deleted file mode 100644 index e69de29bb2d1d6434b8b29ae775ad8c2e48c5391..0000000000000000000000000000000000000000 diff --git a/codes/ sdsacc23/15743254.java b/codes/ sdsacc23/15743254.java deleted file mode 100644 index 6e9861fa3ec6d5a2553cdccd1bb1e977430c671b..0000000000000000000000000000000000000000 --- a/codes/ sdsacc23/15743254.java +++ /dev/null @@ -1,19 +0,0 @@ -/** - * 冒泡排序函数 - * aa bb cc - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - // 你的代码，使无序数组 a 变得有序 - for (int i = 0; i < n - 1; i++) { - for (int j = 0; j < n - i - 1; j++) { - if (a[j] > a[j + 1]) { - - int temp = a[j]; - a[j] = a[j + 1]; - a[j + 1] = temp; - } - } - } -} //end \ No newline at end of file diff --git a/codes/ slamer/11242607.java b/codes/ slamer/11242607.java deleted file mode 100644 index 8c505501c812f686a9abe78a0d1191db6085134c..0000000000000000000000000000000000000000 --- a/codes/ slamer/11242607.java +++ /dev/null @@ -1,19 +0,0 @@ -/** - * 冒泡排序函数 - * aa bb cc - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - // 你的代码，使无序数组 a 变得有序 - for(int i=0;i a[j+1]){ - int temp = a[j]; - a[j] = a[j+1]; - a[j+1] = temp; - } - } - } - -} //end \ No newline at end of file diff --git a/codes/ subNvue/11264972.java b/codes/ subNvue/11264972.java deleted file mode 100644 index 9e7534d4b41cf071c848fa4d5c08c6519526b6e3..0000000000000000000000000000000000000000 --- a/codes/ subNvue/11264972.java +++ /dev/null @@ -1,18 +0,0 @@ -/** - * 冒泡 排序 函数 - * aa bb cc - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - // 你的代码，使无序数组 a 变得有序 - for (int i = 0; i < n; i++) { - for (int j = 0; j < i; j++) { - if (a[i] < a[j]) { - int t = a[i]; - a[i] = a[j]; - a[j] = t; - } - } - } -}//end \ No newline at end of file diff --git a/codes/ susuplus/11211308.java b/codes/ susuplus/11211308.java deleted file mode 100644 index 4d7083fe05ce3e6d3fadd59d6d55e2cbc50d546d..0000000000000000000000000000000000000000 --- a/codes/ susuplus/11211308.java +++ /dev/null @@ -1,22 +0,0 @@ -/** - * 冒泡排序函数 - * aa bb cc - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - // 你的代码，使无序数组 a 变得有序 - int i, j; - - for(i=0; ia[j]){ - int temp; - temp = a[j-1]; - a[j-1] = a[j]; - a[j] = temp; - } - } - } - -} //end \ No newline at end of file diff --git a/codes/ swgger/11211222.java b/codes/ swgger/11211222.java deleted file mode 100644 index 1c8889947f924214c71a3c3f202500b4780dc281..0000000000000000000000000000000000000000 --- a/codes/ swgger/11211222.java +++ /dev/null @@ -1,11 +0,0 @@ -public static void bubbleSort(int [] a,int n){ - for(int i = 0; i < n-1 ; i++){ - for (int j = 0;j < n-1-i;j++){ - if(a[j] > a[j+1]){ - int temp = a[j]; - a[j] = a[j+1]; - a[j+1] = temp; - } - } - } -} \ No newline at end of file diff --git a/codes/ ttyylb/11228246.java b/codes/ ttyylb/11228246.java deleted file mode 100644 index 9e7534d4b41cf071c848fa4d5c08c6519526b6e3..0000000000000000000000000000000000000000 --- a/codes/ ttyylb/11228246.java +++ /dev/null @@ -1,18 +0,0 @@ -/** - * 冒泡 排序 函数 - * aa bb cc - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - // 你的代码，使无序数组 a 变得有序 - for (int i = 0; i < n; i++) { - for (int j = 0; j < i; j++) { - if (a[i] < a[j]) { - int t = a[i]; - a[i] = a[j]; - a[j] = t; - } - } - } -}//end \ No newline at end of file diff --git a/codes/ uioplck/11253331.java b/codes/ uioplck/11253331.java deleted file mode 100644 index cdabc2e0876ad629e41ff055727cf3af34be8917..0000000000000000000000000000000000000000 --- a/codes/ uioplck/11253331.java +++ /dev/null @@ -1,20 +0,0 @@ -/** - * 冒泡排序函数 - * aa bb cc - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - // 你的代码，使无序数组 a 变得有序 - for (int i = 0; i < n; i++) { - for (int j = i + 1; j < n; j++) { - if (a[i] > a[j]) { - int temp = a[j]; - a[j] = a[i]; - a[i] = temp; - - } - } - } - -} //end \ No newline at end of file diff --git a/codes/ xingwang/11302451.java b/codes/ xingwang/11302451.java deleted file mode 100644 index 4d7083fe05ce3e6d3fadd59d6d55e2cbc50d546d..0000000000000000000000000000000000000000 --- a/codes/ xingwang/11302451.java +++ /dev/null @@ -1,22 +0,0 @@ -/** - * 冒泡排序函数 - * aa bb cc - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - // 你的代码，使无序数组 a 变得有序 - int i, j; - - for(i=0; ia[j]){ - int temp; - temp = a[j-1]; - a[j-1] = a[j]; - a[j] = temp; - } - } - } - -} //end \ No newline at end of file diff --git a/codes/ zhoucheng/11464584.java b/codes/ zhoucheng/11464584.java deleted file mode 100644 index cacd12f1e4e4360dd1ffa22f3741e376110bcde4..0000000000000000000000000000000000000000 --- a/codes/ zhoucheng/11464584.java +++ /dev/null @@ -1,18 +0,0 @@ -/** - * 冒泡排序函数 - * aa bb cc - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - // 你的代码，使无序数组 a 变得有序 - for(int i=0;ia[j+1]){ - a[j] = a[j]+a[j+1]; - a[j+1] = a[j]-a[j+1]; - a[j] = a[j]-a[j+1]; - } - } - } -} //end \ No newline at end of file diff --git a/codes/ znnzmm/11212509.java b/codes/ znnzmm/11212509.java deleted file mode 100644 index 272a12fc81d3dd0e857bba9ae001c15818fb7123..0000000000000000000000000000000000000000 --- a/codes/ znnzmm/11212509.java +++ /dev/null @@ -1,18 +0,0 @@ - /** - * 冒泡排序函数 - * aa bb cc - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ - public static void bubbleSort(int [] arr, int n){ - // 你的代码，使无序数组 a 变得有序 - for (int i = 0; i < n; i++) { - for (int j = (i + 1); j < n; j++) { - if (arr[i] > arr[j]) { - int temp = arr[i]; - arr[i] = arr[j]; - arr[j] = temp; - } - } - } - } //end \ No newline at end of file diff --git a/codes/ zouyu5521/11464070.java b/codes/ zouyu5521/11464070.java deleted file mode 100644 index a833d8d31b2581029ab106b60f560dd2c73ff238..0000000000000000000000000000000000000000 --- a/codes/ zouyu5521/11464070.java +++ /dev/null @@ -1,24 +0,0 @@ -/** - * 冒泡排序函数 - * aa bb cc - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - // 你的代码，使无序数组 a 变得有序 - for(int j=0;ja[i+1]) - { - temp=a[i]; - a[i]=a[i+1]; - a[i+1]=temp; - } - } - } - //System.out.println(a); - -} //end \ No newline at end of file diff --git a/codes/.10968772.java.swo b/codes/.10968772.java.swo deleted file mode 100644 index 2f0782cd2cfb53bcbe2e5e5d2ab0284ecdb06b84..0000000000000000000000000000000000000000 Binary files a/codes/.10968772.java.swo and /dev/null differ diff --git a/codes/.14612723.java.swp b/codes/.14612723.java.swp deleted file mode 100644 index ac73c7bef85da8629ba5874ee159d7b3721b6afa..0000000000000000000000000000000000000000 Binary files a/codes/.14612723.java.swp and /dev/null differ diff --git a/codes/.15531109.java.swp b/codes/.15531109.java.swp deleted file mode 100644 index c864535bd03b34efb00f73d0285538349be06989..0000000000000000000000000000000000000000 Binary files a/codes/.15531109.java.swp and /dev/null differ diff --git a/codes/.15781098.java.swp b/codes/.15781098.java.swp deleted file mode 100644 index 7ab5fa2da02804ce9e1820104ce59e64b23ffae6..0000000000000000000000000000000000000000 Binary files a/codes/.15781098.java.swp and /dev/null differ diff --git a/codes/.15823309.java.swp b/codes/.15823309.java.swp deleted file mode 100644 index 95eacaa6a654b0d6f29a2f45305845706b088f6f..0000000000000000000000000000000000000000 Binary files a/codes/.15823309.java.swp and /dev/null differ diff --git a/codes/.16199622.java.swp b/codes/.16199622.java.swp deleted file mode 100644 index 32d3c90e5233ba647b45663b8ee036d1c77357fd..0000000000000000000000000000000000000000 Binary files a/codes/.16199622.java.swp and /dev/null differ diff --git a/codes/.9947891.java.swp b/codes/.9947891.java.swp deleted file mode 100644 index 747e1e75659f3a8001d33ded7f30de27959dd22e..0000000000000000000000000000000000000000 Binary files a/codes/.9947891.java.swp and /dev/null differ diff --git a/codes/.9947891.swp b/codes/.9947891.swp deleted file mode 100644 index fe92cb7063bbe4dfd1032f38b5a17ecf174b7b7c..0000000000000000000000000000000000000000 Binary files a/codes/.9947891.swp and /dev/null differ diff --git a/codes/.9968905.java.swp b/codes/.9968905.java.swp deleted file mode 100644 index 1ea805f549457592f7d7324cb00d8094cf54a3e5..0000000000000000000000000000000000000000 Binary files a/codes/.9968905.java.swp and /dev/null differ diff --git a/codes/.DS_Store b/codes/.DS_Store deleted file mode 100644 index 08398a745c3ed48fadca1439299475676fa814c6..0000000000000000000000000000000000000000 Binary files a/codes/.DS_Store and /dev/null differ diff --git a/codes/.keep b/codes/.keep deleted file mode 100644 index e69de29bb2d1d6434b8b29ae775ad8c2e48c5391..0000000000000000000000000000000000000000 diff --git a/codes/10971000.java b/codes/10971000.java deleted file mode 100644 index 67a97db0f2fbb50ee06aa49da443c533d4552bcd..0000000000000000000000000000000000000000 --- a/codes/10971000.java +++ /dev/null @@ -1,11 +0,0 @@ -public static void bubbleSort(int [] a, int n) { -for (int i=0 ; ia[wll+1]) { -int temp=a[wll]; -a[wll]=a[wll+1]; -a[wll+1]=temp; -} -} -} -} diff --git a/codes/11179070.java b/codes/11179070.java deleted file mode 100644 index b6134020eb47b17433f5865ae0f18fa31a59f274..0000000000000000000000000000000000000000 --- a/codes/11179070.java +++ /dev/null @@ -1,18 +0,0 @@ -/** - * 冒泡排序函数 - * aa bb cc - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - - for (int i = 0; i < n; i++) { - for (int j = 0; j < i; j++) { - if (a[i] < a[j]) { - int t = a[i]; - a[i] = a[j]; - a[j] = t; - } - } - } -}//end diff --git a/codes/11446072.java b/codes/11446072.java deleted file mode 100644 index 17fde96e95e5f036bffb1d3aa82fcac932734a29..0000000000000000000000000000000000000000 --- a/codes/11446072.java +++ /dev/null @@ -1,19 +0,0 @@ - /** - * 冒泡排序函数 - * aa bb cc - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - // 你的代码，使无序数组 a 变得有序 - for(int i = 0; i < n; i++) { - for(int j = 0; j < n-1; j++) { - if(a[j] > a[j+1]){ - int tmp = 0; - tmp = a[j]; - a[j] = a[j+1]; - a[j+1] = tmp; - } - } - } -} //end diff --git a/codes/15527405.java b/codes/15527405.java deleted file mode 100644 index cb54d2b32482419f700300ea22b13488343a544b..0000000000000000000000000000000000000000 --- a/codes/15527405.java +++ /dev/null @@ -1,18 +0,0 @@ -/** - * 冒泡排序函数 - * aa bb cc - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] arr, int n){ - // 你的代码，使无序数组 a 变得有序 - for (int i = 0; i < n; i++) { - for (int j = (i + 1); j < n; j++) { - if (arr[i] > arr[j]) { - int temp = arr[i]; - arr[i] = arr[j]; - arr[j] = temp; - } - } - } -} //end diff --git a/codes/15541001.java b/codes/15541001.java deleted file mode 100644 index 324687283489419c5a6916c234a8848f65a5eb64..0000000000000000000000000000000000000000 --- a/codes/15541001.java +++ /dev/null @@ -1,20 +0,0 @@ -/** - * 冒泡排序函数 - * aa bb cc - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - // 你的代码，使无序数组 a 变得有序 - for(int i = 0; i < n; i++) { - for(int tata = 0; tata < n - i - 1; tata++) { - if(a[tata] > a[tata + 1]) { - int temp = a[tata]; - a [tata] = a[tata + 1]; - a[tata + 1] = temp; - } - } - } - - -} //end,tatazj diff --git a/codes/15582699.java b/codes/15582699.java deleted file mode 100644 index e8b6c17bfddeca239363a2e17b4e7c55c1cbbcfc..0000000000000000000000000000000000000000 --- a/codes/15582699.java +++ /dev/null @@ -1,18 +0,0 @@ -OB/** - * 冒泡排序函数 - * aa bb cc - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int[] a, int n) { - for (int i = 0; i < n - 1; i++) { - for (int j = 0; j < n - i - 1; j++) { - if (a[j] > a[j + 1]) { - // 交换a[j]和a[j+1]的位置 - int temp = a[j]; - a[j] = a[j + 1]; - a[j + 1] = temp; - } - } - } -} diff --git a/codes/15585762.java b/codes/15585762.java deleted file mode 100644 index c2afaa2414da1853e4500b02c6de9068b64aeafe..0000000000000000000000000000000000000000 --- a/codes/15585762.java +++ /dev/null @@ -1,18 +0,0 @@ -/** - * 冒泡排序函数 - * aa bb cc - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - for(int i = 0; i < n-1 ; i++){ - for (int j = 0;j < n-1-i;j++){ - if(a[j] > a[j+1]){ - int temp = a[j]; - a[j] = a[j+1]; - a[j+1] = temp; - } - } - } - -} //end diff --git a/codes/15607358.java b/codes/15607358.java deleted file mode 100644 index ebbb1f9f8af1b6c610ac86c2a1d260b37da2d0b7..0000000000000000000000000000000000000000 --- a/codes/15607358.java +++ /dev/null @@ -1,19 +0,0 @@ -/** - * 冒泡排序函数 - * - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int[] a, int n) { - for (int i = 0; i < n - 1; i++) { - for (int j = 0; j < n - 1 - i; j++) { - if (a[j] > a[j + 1]) { - // 交换相邻两个元素的位置 - int temp = a[j]; - a[j] = a[j + 1]; - a[j + 1] = temp; - } - } - } -} - diff --git a/codes/15620229.java b/codes/15620229.java deleted file mode 100644 index 462bdb84d30a2b7c0d01f9f6822e460a63dd9b1d..0000000000000000000000000000000000000000 --- a/codes/15620229.java +++ /dev/null @@ -1,18 +0,0 @@ -/** - * 冒泡排序函数 - * aa bb cc - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int[] a, int n){ - for (int i = 0; i < n - 1; i++) { - for (int j = 0; j < n - 1 - i; j++) { - if (a[j] > a[j + 1]) { - // 交换 a[j] 和 a[j+1] - int temp = a[j]; - a[j] = a[j + 1]; - a[j + 1] = temp; - } - } - } -} //end diff --git a/codes/15636076.java b/codes/15636076.java deleted file mode 100644 index 65e242d018acedd1acc99659aaa896db112c5c58..0000000000000000000000000000000000000000 --- a/codes/15636076.java +++ /dev/null @@ -1,19 +0,0 @@ -```java -/** - * 冒泡排序函数 - * aa bb cc - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - // 你的代码，使无序数组 a 变得有序 - for (int i = 0; i < n - 1; i++) { - for (int j = 0; j < n - 1 - i; j++) { - if (a[j] > a[j + 1]) { - int temp = a[j]; - a[j] = a[j + 1]; - a[j + 1] = temp; - } - } - } -} //end diff --git a/codes/15699820.java b/codes/15699820.java deleted file mode 100644 index 987377810b5beca8eb4bf5eafeee5db45e234a87..0000000000000000000000000000000000000000 --- a/codes/15699820.java +++ /dev/null @@ -1,20 +0,0 @@ -/** - * 冒泡排序函数 - * aa bb cc - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - // 你的代码，使无序数组 a 变得有序 - for(int i = 0; i < n; i++) { - for(int liuy = 0; liuy < n - i - 1; liuy++) { - if(a[liuy] > a[liuy + 1]) { - int temp = a[liuy]; - a [liuy] = a[liuy + 1]; - a[liuy + 1] = temp; - } - } - } - - -} //end,liuy diff --git a/codes/15700256.java b/codes/15700256.java deleted file mode 100644 index 987377810b5beca8eb4bf5eafeee5db45e234a87..0000000000000000000000000000000000000000 --- a/codes/15700256.java +++ /dev/null @@ -1,20 +0,0 @@ -/** - * 冒泡排序函数 - * aa bb cc - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - // 你的代码，使无序数组 a 变得有序 - for(int i = 0; i < n; i++) { - for(int liuy = 0; liuy < n - i - 1; liuy++) { - if(a[liuy] > a[liuy + 1]) { - int temp = a[liuy]; - a [liuy] = a[liuy + 1]; - a[liuy + 1] = temp; - } - } - } - - -} //end,liuy diff --git a/codes/15700309.java b/codes/15700309.java deleted file mode 100644 index 987377810b5beca8eb4bf5eafeee5db45e234a87..0000000000000000000000000000000000000000 --- a/codes/15700309.java +++ /dev/null @@ -1,20 +0,0 @@ -/** - * 冒泡排序函数 - * aa bb cc - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - // 你的代码，使无序数组 a 变得有序 - for(int i = 0; i < n; i++) { - for(int liuy = 0; liuy < n - i - 1; liuy++) { - if(a[liuy] > a[liuy + 1]) { - int temp = a[liuy]; - a [liuy] = a[liuy + 1]; - a[liuy + 1] = temp; - } - } - } - - -} //end,liuy diff --git a/codes/15732362.java b/codes/15732362.java deleted file mode 100644 index 080b9658f9727c7d90618127cb6d7f9b5162b1d9..0000000000000000000000000000000000000000 --- a/codes/15732362.java +++ /dev/null @@ -1,18 +0,0 @@ -/** - * 冒泡排序函数 - * 通过对相邻的元素进行两两比较，顺序相反则进行交换，每一轮比较会将当前未排序部分的最大值“冒泡”到未排序部分的末尾。 - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int[] a, int n) { - for (int i = 0; i < n - 1; i++) { // 外层循环控制所有轮数 - for (int j = 0; j < n - i - 1; j++) { // 内层循环控制每轮比较的次数 - if (a[j] > a[j + 1]) { // 如果前一个元素大于后一个元素，则交换它们 - // 交换 a[j] 和 a[j+1] - int temp = a[j]; - a[j] = a[j + 1]; - a[j + 1] = temp; - } - } - } -} // endi diff --git a/codes/15759151.java b/codes/15759151.java deleted file mode 100644 index 76cbddd876f8669466e0a2651682cee667741713..0000000000000000000000000000000000000000 --- a/codes/15759151.java +++ /dev/null @@ -1,20 +0,0 @@ -/** - * 冒泡排序函数 - * aa bb cc - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - // 你的代码，使无序数组 a 变得有序 - for(int i = 0; i < n; i++) { - for(int b = 0; b < n - i - 1; b++) { - if(a[b] > a[b + 1]) { - int temp = a[b]; - a [b] = a[b + 1]; - a[b + 1] = temp; - } - } - } - - -} //end diff --git a/codes/15775145.java b/codes/15775145.java deleted file mode 100644 index 987377810b5beca8eb4bf5eafeee5db45e234a87..0000000000000000000000000000000000000000 --- a/codes/15775145.java +++ /dev/null @@ -1,20 +0,0 @@ -/** - * 冒泡排序函数 - * aa bb cc - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - // 你的代码，使无序数组 a 变得有序 - for(int i = 0; i < n; i++) { - for(int liuy = 0; liuy < n - i - 1; liuy++) { - if(a[liuy] > a[liuy + 1]) { - int temp = a[liuy]; - a [liuy] = a[liuy + 1]; - a[liuy + 1] = temp; - } - } - } - - -} //end,liuy diff --git a/codes/15776507.java b/codes/15776507.java deleted file mode 100644 index ae82e695cbfd360050241c3f1f592658c8c1d4e7..0000000000000000000000000000000000000000 --- a/codes/15776507.java +++ /dev/null @@ -1,35 +0,0 @@ -/** - - * 冒泡排序函数 - - * aa bb cc - - * @param a 待排序的数组 - - * @param n 待排序的数组长度 - - */ - -public static void bubbleSort(int [] a, int n){ - - for(int i = 0; i < n-1 ; i++){ - - for (int j = 0;j < n-1-i;j++){ - - if(a[j] > a[j+1]){ - - int temp = a[j]; - - a[j] = a[j+1]; - - a[j+1] = temp; - - } - - } - - } - - - -} //end diff --git a/codes/15834244.java b/codes/15834244.java deleted file mode 100644 index 359611893987a0706367c172b0c17be473dd366f..0000000000000000000000000000000000000000 --- a/codes/15834244.java +++ /dev/null @@ -1,18 +0,0 @@ -/** - * 冒泡排序函数 - * 对数组a进行冒泡排序，将其变为有序数组 - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int[] a, int n) { - for (int i = 0; i < n - 1; i++) { // 外层循环，控制排序趟数 - for (int j = 0; j < n - i - 1; j++) { // 内层循环，进行相邻元素比较和交换 - if (a[j] > a[j + 1]) { // 如果当前元素大于下一个元素，则交换它们 - // 交换a[j]和a[j+1] - int temp = a[j]; - a[j] = a[j + 1]; - a[j + 1] = temp; - } - } - } -} //end diff --git a/codes/15845628.java b/codes/15845628.java deleted file mode 100644 index 987377810b5beca8eb4bf5eafeee5db45e234a87..0000000000000000000000000000000000000000 --- a/codes/15845628.java +++ /dev/null @@ -1,20 +0,0 @@ -/** - * 冒泡排序函数 - * aa bb cc - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - // 你的代码，使无序数组 a 变得有序 - for(int i = 0; i < n; i++) { - for(int liuy = 0; liuy < n - i - 1; liuy++) { - if(a[liuy] > a[liuy + 1]) { - int temp = a[liuy]; - a [liuy] = a[liuy + 1]; - a[liuy + 1] = temp; - } - } - } - - -} //end,liuy diff --git a/codes/16200342.java b/codes/16200342.java deleted file mode 100644 index 044bc48abdde713488e6d017da0b2f958c241d68..0000000000000000000000000000000000000000 --- a/codes/16200342.java +++ /dev/null @@ -1,18 +0,0 @@ -/** - * 冒泡排序函数 - * aa bb cc - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - for (int i = 0; i < n - 1; i++) { - for (int j = 0; j < n - i - 1; j++) { - if (a[j] > a[j + 1]) { - int temp = a[j]; - a[j] = a[j + 1]; - a[j + 1] = temp; - } - } - } -} //end - diff --git a/codes/17034577.java b/codes/17034577.java deleted file mode 100644 index e69de29bb2d1d6434b8b29ae775ad8c2e48c5391..0000000000000000000000000000000000000000 diff --git a/codes/18149367.java b/codes/18149367.java deleted file mode 100644 index 63cda17a4694f81b5763b231572fa756bea3d1d4..0000000000000000000000000000000000000000 --- a/codes/18149367.java +++ /dev/null @@ -1,20 +0,0 @@ -/** - * 冒泡排序函数 - * aa bb cc - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - int temp; - for(i=0; i < a.length - 1;i++) { - for (int j = 0; j < arr.length - i - 1; j++) { - if(a[j] > a[j+1]){ - temp=a[j]; - a[j]=a[j+1]; - a[j+1]=temp; - } - } - } - - } -} //end diff --git a/codes/18379057.java b/codes/18379057.java deleted file mode 100644 index c1922950ae106525d1ed03091e2ae293c049bb13..0000000000000000000000000000000000000000 --- a/codes/18379057.java +++ /dev/null @@ -1,12 +0,0 @@ -public static void bubbleSort(int [] a, int n){ - // 你的代码，使无序数组 a 变得有序 - for(int i = 0; i < n; i++) { - for(int j = 0; j < n - i - 1; ++j) { - if(a[j] > a[j + 1]) { - int tmp = a[j]; - a[j] = a[j + 1]; - a[j + 1] = tmp; - } - } - } -} diff --git a/codes/9622480.java b/codes/9622480.java deleted file mode 100644 index 02b68330dadebd99139bc7a1bcc7757cb621cbca..0000000000000000000000000000000000000000 --- a/codes/9622480.java +++ /dev/null @@ -1,18 +0,0 @@ -/** - * 冒泡排序函数 - * 通过重复地遍历待排序数组，比较并交换相邻元素，使无序数组变得有序 - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - for(int i = 0; i < n - 1; i++) { - for(int j = 0; j < n - 1 - i; j++) { - // 如果当前元素大于下一个元素，则交换它们 - if(a[j] > a[j + 1]) { - int temp = a[j]; - a[j] = a[j + 1]; - a[j + 1] = temp; - } - } - } -} //end diff --git a/codes/9785926.java b/codes/9785926.java deleted file mode 100644 index 10dbc6525b8c4427dda5055b3f3c224c68398d2c..0000000000000000000000000000000000000000 --- a/codes/9785926.java +++ /dev/null @@ -1,19 +0,0 @@ -/** - * 冒泡排序函数 - * aa bb cc - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - // 你的代码，使无序数组 a 变得有序 - for(int i = 0 ; i < n - 1 ; i++){ - for(int j = 0 ; j < n - 1 - i ; j++){ - if(a[j] > a[j + 1]){ - int tmp = a[j]; - a[j] = a[j + 1]; - a[j + 1] = tmp; - } - } - } - -} //end diff --git a/codes/A13230295092/15791717.java b/codes/A13230295092/15791717.java deleted file mode 100644 index 187e282d1f96a04fe5e3e1f68cb96f8d295ba187..0000000000000000000000000000000000000000 --- a/codes/A13230295092/15791717.java +++ /dev/null @@ -1,26 +0,0 @@ -/** - * 冒泡排序函数 - * 对数组a进行升序排序 - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int[] a, int n) { - for (int i = 0; i < n - 1; i++) { - // 设置一个标志位，用于判断本轮是否发生了交换 - boolean swapped = false; - for (int j = 0; j < n - i - 1; j++) { - // 如果前一个元素大于后一个元素，则交换它们 - if (a[j] > a[j + 1]) { - int temp = a[j]; - a[j] = a[j + 1]; - a[j + 1] = temp; - // 发生了交换，设置标志位为true - swapped = true; - } - } - // 如果本轮没有发生交换，说明数组已经有序，可以提前结束排序 - if (!swapped) { - break; - } - } -} // end diff --git a/codes/A13753608906/15847648.java b/codes/A13753608906/15847648.java deleted file mode 100644 index 809e6c454de4e33d540c35a26f34e2679a08693a..0000000000000000000000000000000000000000 --- a/codes/A13753608906/15847648.java +++ /dev/null @@ -1,18 +0,0 @@ -/** - * 冒泡排序函数 - * 通过相邻元素两两比较和交换，使得每一轮循环后最大（或最小）的元素“冒泡”到数组的末尾。 - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int[] a, int n) { - for (int i = 0; i < n - 1; i++) { // 外层循环控制比较轮数 - for (int j = 0; j < n - 1 - i; j++) { // 内层循环控制每轮比较的次数 - if (a[j] > a[j + 1]) { // 如果当前元素大于下一个元素，则交换它们的位置 - // 交换 a[j] 和 a[j + 1] - int temp = a[j]; - a[j] = a[j + 1]; - a[j + 1] = temp; - } - } - } -} //end diff --git a/codes/A13753635706/15847469.java b/codes/A13753635706/15847469.java deleted file mode 100644 index 809e6c454de4e33d540c35a26f34e2679a08693a..0000000000000000000000000000000000000000 --- a/codes/A13753635706/15847469.java +++ /dev/null @@ -1,18 +0,0 @@ -/** - * 冒泡排序函数 - * 通过相邻元素两两比较和交换，使得每一轮循环后最大（或最小）的元素“冒泡”到数组的末尾。 - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int[] a, int n) { - for (int i = 0; i < n - 1; i++) { // 外层循环控制比较轮数 - for (int j = 0; j < n - 1 - i; j++) { // 内层循环控制每轮比较的次数 - if (a[j] > a[j + 1]) { // 如果当前元素大于下一个元素，则交换它们的位置 - // 交换 a[j] 和 a[j + 1] - int temp = a[j]; - a[j] = a[j + 1]; - a[j + 1] = temp; - } - } - } -} //end diff --git a/codes/A15579521660/15861437.java b/codes/A15579521660/15861437.java deleted file mode 100644 index 54c5f3869cd16ee9e7c2b77895a39fae63f05dbc..0000000000000000000000000000000000000000 --- a/codes/A15579521660/15861437.java +++ /dev/null @@ -1,20 +0,0 @@ -/** - * 冒泡排序函数 - * aa bb cc - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - // 你的代码，使无序数组 a 变得有序 - for(int i = 0; i < n; i++) { - for(int liuy = 0; liuy < n - i - 1; liuy++) { - if(a[liuy] > a[liuy + 1]) { - int temp = a[liuy]; - a [liuy] = a[liuy + 1]; - a[liuy + 1] = temp; - } - } - } - - -} //end,liuy \ No newline at end of file diff --git a/codes/A15579541660/15861674.java b/codes/A15579541660/15861674.java deleted file mode 100644 index 54c5f3869cd16ee9e7c2b77895a39fae63f05dbc..0000000000000000000000000000000000000000 --- a/codes/A15579541660/15861674.java +++ /dev/null @@ -1,20 +0,0 @@ -/** - * 冒泡排序函数 - * aa bb cc - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - // 你的代码，使无序数组 a 变得有序 - for(int i = 0; i < n; i++) { - for(int liuy = 0; liuy < n - i - 1; liuy++) { - if(a[liuy] > a[liuy + 1]) { - int temp = a[liuy]; - a [liuy] = a[liuy + 1]; - a[liuy + 1] = temp; - } - } - } - - -} //end,liuy \ No newline at end of file diff --git a/codes/A15898703309/15820507.java b/codes/A15898703309/15820507.java deleted file mode 100644 index 33be1b95e65b4aac0ebce48bfeb09323f568c4f7..0000000000000000000000000000000000000000 --- a/codes/A15898703309/15820507.java +++ /dev/null @@ -1,19 +0,0 @@ -/** -* 冒泡排序函数 -* aa bb cc -* @param a 待排序的数组 -* @param n 待排序的数组长度 -*/ -public static void bubbleSort(int [] a, int n){ -// 你的代码，使无序数组 a 变得有序 -for (int i = 0; i < n - 1; i++) { -for (int j = 0; j < n - i - 1; j++) { -if (a[j] > a[j + 1]) { -// 交换元素 -int temp = a[j]; -a[j] = a[j + 1]; -a[j + 1] = temp; -} -} -} -} //end diff --git a/codes/A1607142431/10995009.java b/codes/A1607142431/10995009.java deleted file mode 100644 index cdabc2e0876ad629e41ff055727cf3af34be8917..0000000000000000000000000000000000000000 --- a/codes/A1607142431/10995009.java +++ /dev/null @@ -1,20 +0,0 @@ -/** - * 冒泡排序函数 - * aa bb cc - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - // 你的代码，使无序数组 a 变得有序 - for (int i = 0; i < n; i++) { - for (int j = i + 1; j < n; j++) { - if (a[i] > a[j]) { - int temp = a[j]; - a[j] = a[i]; - a[i] = temp; - - } - } - } - -} //end \ No newline at end of file diff --git a/codes/A16691797881/15854214.java b/codes/A16691797881/15854214.java deleted file mode 100644 index db00df4317c2971d839dccd193fa0332f983ff23..0000000000000000000000000000000000000000 --- a/codes/A16691797881/15854214.java +++ /dev/null @@ -1,22 +0,0 @@ -/** - * 冒泡排序函数 - * 对数组进行冒泡排序，使得数组中的元素按从小到大的顺序排列 - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int[] a, int n) { - // 外层循环控制排序趟数 - for (int i = 0; i < n - 1; i++) { - // 内层循环负责进行每趟排序，通过相邻元素的比较和交换来移动较大元素到数组的末尾 - for (int j = 0; j < n - i - 1; j++) { - // 如果前一个元素大于后一个元素，则交换它们的位置 - if (a[j] > a[j + 1]) { - // 交换元素 - int temp = a[j]; - a[j] = a[j + 1]; - a[j + 1] = temp; - } - } - } - // 经过 n-1 趟排序后，数组已经变为有序 -} // end diff --git a/codes/A17355931314/15646257.java b/codes/A17355931314/15646257.java deleted file mode 100644 index 20575dc4ccc75a5bf6af9ea4614fcfa2a84fdeaf..0000000000000000000000000000000000000000 --- a/codes/A17355931314/15646257.java +++ /dev/null @@ -1,19 +0,0 @@ -/** - * 冒泡排序函数 - * aa bb cc - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - // 你的代码，使无序数组 a 变得有序 - for (int i = 0; i < n - 1; i++) { - for (int j = 0; j < n - i - 1; j++) { - if (a[j] > a[j + 1]) { - // 交换元素 - int temp = a[j]; - a[j] = a[j + 1]; - a[j + 1] = temp; - } - } - } -} //end diff --git a/codes/A17730000544/15630407.java b/codes/A17730000544/15630407.java deleted file mode 100644 index 20575dc4ccc75a5bf6af9ea4614fcfa2a84fdeaf..0000000000000000000000000000000000000000 --- a/codes/A17730000544/15630407.java +++ /dev/null @@ -1,19 +0,0 @@ -/** - * 冒泡排序函数 - * aa bb cc - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - // 你的代码，使无序数组 a 变得有序 - for (int i = 0; i < n - 1; i++) { - for (int j = 0; j < n - i - 1; j++) { - if (a[j] > a[j + 1]) { - // 交换元素 - int temp = a[j]; - a[j] = a[j + 1]; - a[j + 1] = temp; - } - } - } -} //end diff --git a/codes/A17864114150/15832573.java b/codes/A17864114150/15832573.java deleted file mode 100644 index 33be1b95e65b4aac0ebce48bfeb09323f568c4f7..0000000000000000000000000000000000000000 --- a/codes/A17864114150/15832573.java +++ /dev/null @@ -1,19 +0,0 @@ -/** -* 冒泡排序函数 -* aa bb cc -* @param a 待排序的数组 -* @param n 待排序的数组长度 -*/ -public static void bubbleSort(int [] a, int n){ -// 你的代码，使无序数组 a 变得有序 -for (int i = 0; i < n - 1; i++) { -for (int j = 0; j < n - i - 1; j++) { -if (a[j] > a[j + 1]) { -// 交换元素 -int temp = a[j]; -a[j] = a[j + 1]; -a[j + 1] = temp; -} -} -} -} //end diff --git a/codes/A17864115054/15528622.java b/codes/A17864115054/15528622.java deleted file mode 100644 index 20575dc4ccc75a5bf6af9ea4614fcfa2a84fdeaf..0000000000000000000000000000000000000000 --- a/codes/A17864115054/15528622.java +++ /dev/null @@ -1,19 +0,0 @@ -/** - * 冒泡排序函数 - * aa bb cc - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - // 你的代码，使无序数组 a 变得有序 - for (int i = 0; i < n - 1; i++) { - for (int j = 0; j < n - i - 1; j++) { - if (a[j] > a[j + 1]) { - // 交换元素 - int temp = a[j]; - a[j] = a[j + 1]; - a[j + 1] = temp; - } - } - } -} //end diff --git a/codes/A18172972897/15861687.java b/codes/A18172972897/15861687.java deleted file mode 100644 index 54c5f3869cd16ee9e7c2b77895a39fae63f05dbc..0000000000000000000000000000000000000000 --- a/codes/A18172972897/15861687.java +++ /dev/null @@ -1,20 +0,0 @@ -/** - * 冒泡排序函数 - * aa bb cc - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - // 你的代码，使无序数组 a 变得有序 - for(int i = 0; i < n; i++) { - for(int liuy = 0; liuy < n - i - 1; liuy++) { - if(a[liuy] > a[liuy + 1]) { - int temp = a[liuy]; - a [liuy] = a[liuy + 1]; - a[liuy + 1] = temp; - } - } - } - - -} //end,liuy \ No newline at end of file diff --git a/codes/A18839698468/15830742.java b/codes/A18839698468/15830742.java deleted file mode 100644 index d612a9d6324e9ddde1fce6ccb74b38a12b4e973d..0000000000000000000000000000000000000000 --- a/codes/A18839698468/15830742.java +++ /dev/null @@ -1,27 +0,0 @@ -/** - * 冒泡排序函数 - * 将无序数组通过冒泡排序算法变为有序数组 - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - for (int i = 0; i < n - 1; i++) { - // 设置一个标志位，用于优化算法，减少不必要的比较 - boolean swapped = false; - for (int j = 0; j < n - i - 1; j++) { - // 如果前一个元素比后一个元素大，则交换它们的位置 - if (a[j] > a[j + 1]) { - int temp = a[j]; - a[j] = a[j + 1]; - a[j + 1] = temp; - // 如果有元素交换，则标志位设为true - swapped = true; - } - } - // 如果没有元素交换，说明数组已经有序，可以提前结束排序 - if (!swapped) { - break; - } - } -} //end - diff --git a/codes/A19114652439/15836795.java b/codes/A19114652439/15836795.java deleted file mode 100644 index d0e7038df81a1dcd40ba57e5267839caad594f03..0000000000000000000000000000000000000000 --- a/codes/A19114652439/15836795.java +++ /dev/null @@ -1,19 +0,0 @@ -/** - * 冒泡排序函数 - * 冒泡排序是一种简单的排序算法，它重复地遍历要排序的数列，一次比较两个元素，如果他们的顺序错误就把他们交换过来。 - * 遍历数列的工作是重复地进行直到没有再需要交换，也就是说该数列已经排序完成。 - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - for (int i = 0; i < n - 1; i++) { // 外层循环控制比较的次数 - for (int j = 0; j < n - 1 - i; j++) { // 内层循环控制每一轮比较的次数 - // 如果前一个元素比后一个元素大，则交换它们的位置 - if (a[j] > a[j + 1]) { - int temp = a[j]; - a[j] = a[j + 1]; - a[j + 1] = temp; - } - } - } -} //end diff --git a/codes/A19127470761/15834094.java b/codes/A19127470761/15834094.java deleted file mode 100644 index db00df4317c2971d839dccd193fa0332f983ff23..0000000000000000000000000000000000000000 --- a/codes/A19127470761/15834094.java +++ /dev/null @@ -1,22 +0,0 @@ -/** - * 冒泡排序函数 - * 对数组进行冒泡排序，使得数组中的元素按从小到大的顺序排列 - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int[] a, int n) { - // 外层循环控制排序趟数 - for (int i = 0; i < n - 1; i++) { - // 内层循环负责进行每趟排序，通过相邻元素的比较和交换来移动较大元素到数组的末尾 - for (int j = 0; j < n - i - 1; j++) { - // 如果前一个元素大于后一个元素，则交换它们的位置 - if (a[j] > a[j + 1]) { - // 交换元素 - int temp = a[j]; - a[j] = a[j + 1]; - a[j + 1] = temp; - } - } - } - // 经过 n-1 趟排序后，数组已经变为有序 -} // end diff --git a/codes/A19356583352/15628459.java b/codes/A19356583352/15628459.java deleted file mode 100644 index 20575dc4ccc75a5bf6af9ea4614fcfa2a84fdeaf..0000000000000000000000000000000000000000 --- a/codes/A19356583352/15628459.java +++ /dev/null @@ -1,19 +0,0 @@ -/** - * 冒泡排序函数 - * aa bb cc - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - // 你的代码，使无序数组 a 变得有序 - for (int i = 0; i < n - 1; i++) { - for (int j = 0; j < n - i - 1; j++) { - if (a[j] > a[j + 1]) { - // 交换元素 - int temp = a[j]; - a[j] = a[j + 1]; - a[j + 1] = temp; - } - } - } -} //end diff --git a/codes/A19897301746/15836849.java b/codes/A19897301746/15836849.java deleted file mode 100644 index d0e7038df81a1dcd40ba57e5267839caad594f03..0000000000000000000000000000000000000000 --- a/codes/A19897301746/15836849.java +++ /dev/null @@ -1,19 +0,0 @@ -/** - * 冒泡排序函数 - * 冒泡排序是一种简单的排序算法，它重复地遍历要排序的数列，一次比较两个元素，如果他们的顺序错误就把他们交换过来。 - * 遍历数列的工作是重复地进行直到没有再需要交换，也就是说该数列已经排序完成。 - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - for (int i = 0; i < n - 1; i++) { // 外层循环控制比较的次数 - for (int j = 0; j < n - 1 - i; j++) { // 内层循环控制每一轮比较的次数 - // 如果前一个元素比后一个元素大，则交换它们的位置 - if (a[j] > a[j + 1]) { - int temp = a[j]; - a[j] = a[j + 1]; - a[j + 1] = temp; - } - } - } -} //end diff --git a/codes/A2606488516/15814309.java b/codes/A2606488516/15814309.java deleted file mode 100644 index 1d4a099c85c0ea3893658bda6a7cc89afa13c81c..0000000000000000000000000000000000000000 --- a/codes/A2606488516/15814309.java +++ /dev/null @@ -1,18 +0,0 @@ -/** - * 冒泡排序函数 - * 将无序数组 a 进行升序排序 - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int[] a, int n) { - for (int i = 0; i < n - 1; i++) { // 外层循环控制排序趟数 - for (int j = 0; j < n - 1 - i; j++) { // 内层循环负责每趟的比较和交换 - if (a[j] > a[j + 1]) { // 如果当前元素大于下一个元素，则交换它们的位置 - // 交换 a[j] 和 a[j+1] - int temp = a[j]; - a[j] = a[j + 1]; - a[j + 1] = temp; - } - } - } -} // end diff --git a/codes/A7777777/11213040.java b/codes/A7777777/11213040.java deleted file mode 100644 index cdabc2e0876ad629e41ff055727cf3af34be8917..0000000000000000000000000000000000000000 --- a/codes/A7777777/11213040.java +++ /dev/null @@ -1,20 +0,0 @@ -/** - * 冒泡排序函数 - * aa bb cc - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - // 你的代码，使无序数组 a 变得有序 - for (int i = 0; i < n; i++) { - for (int j = i + 1; j < n; j++) { - if (a[i] > a[j]) { - int temp = a[j]; - a[j] = a[i]; - a[i] = temp; - - } - } - } - -} //end \ No newline at end of file diff --git a/codes/A853047901/.java b/codes/A853047901/.java deleted file mode 100644 index 0d5a14b00410819d7cb653a0daa1a319eb87c03c..0000000000000000000000000000000000000000 --- a/codes/A853047901/.java +++ /dev/null @@ -1,64 +0,0 @@ -ad - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - diff --git a/codes/A853047901/10845109.java b/codes/A853047901/10845109.java deleted file mode 100644 index ab3d8f390cfa4cee1947d39872e75bac48b3058a..0000000000000000000000000000000000000000 --- a/codes/A853047901/10845109.java +++ /dev/null @@ -1,11 +0,0 @@ -public static void bubbleSort(int [] a, int n) { - for (int i=0 ; ia[j+1]) { - int temp=a[j]; - a[j]=a[j+1]; - a[j+1]=temp; - } - } - } -} diff --git a/codes/A8888888/11187517.java b/codes/A8888888/11187517.java deleted file mode 100644 index 9c9fea7e5a6f112ef881921d767eabc005fa9092..0000000000000000000000000000000000000000 --- a/codes/A8888888/11187517.java +++ /dev/null @@ -1,18 +0,0 @@ - /** - * 冒泡排序函数 - * aa bb cc - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ - public static void bubbleSort(int [] arr, int n){ - // 你的代码，使无序数组 a 变得有序 - for (int i = 0; i < n; i++) { - for (int j = (i + 1); j < n; j++) { - if (arr[i] > arr[j]) { - int temp = arr[i]; - arr[i] = arr[j]; - arr[j] = temp; - } - } - } - } //end diff --git a/codes/AA15930757026/15765678.java b/codes/AA15930757026/15765678.java deleted file mode 100644 index 20575dc4ccc75a5bf6af9ea4614fcfa2a84fdeaf..0000000000000000000000000000000000000000 --- a/codes/AA15930757026/15765678.java +++ /dev/null @@ -1,19 +0,0 @@ -/** - * 冒泡排序函数 - * aa bb cc - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - // 你的代码，使无序数组 a 变得有序 - for (int i = 0; i < n - 1; i++) { - for (int j = 0; j < n - i - 1; j++) { - if (a[j] > a[j + 1]) { - // 交换元素 - int temp = a[j]; - a[j] = a[j + 1]; - a[j + 1] = temp; - } - } - } -} //end diff --git a/codes/ABOD01/11326499.java b/codes/ABOD01/11326499.java deleted file mode 100644 index 8d589d7edfe50246fe5deff283186d81a64dc137..0000000000000000000000000000000000000000 --- a/codes/ABOD01/11326499.java +++ /dev/null @@ -1,21 +0,0 @@ -/** - * 冒泡排序函数 - * aa bb cc - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a,int n){ - int temp =0; - for(int i = 0;ia[j+1]){ - temp = a[j]; - a[j] = a[j+1]; - a[j+1] = temp; - } - } - } - - - -} \ No newline at end of file diff --git a/codes/ARSHAM/11202647.java b/codes/ARSHAM/11202647.java deleted file mode 100644 index 272a12fc81d3dd0e857bba9ae001c15818fb7123..0000000000000000000000000000000000000000 --- a/codes/ARSHAM/11202647.java +++ /dev/null @@ -1,18 +0,0 @@ - /** - * 冒泡排序函数 - * aa bb cc - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ - public static void bubbleSort(int [] arr, int n){ - // 你的代码，使无序数组 a 变得有序 - for (int i = 0; i < n; i++) { - for (int j = (i + 1); j < n; j++) { - if (arr[i] > arr[j]) { - int temp = arr[i]; - arr[i] = arr[j]; - arr[j] = temp; - } - } - } - } //end \ No newline at end of file diff --git a/codes/ASD8899/.keep b/codes/ASD8899/.keep deleted file mode 100644 index e69de29bb2d1d6434b8b29ae775ad8c2e48c5391..0000000000000000000000000000000000000000 diff --git a/codes/ASD8899/15742420.java b/codes/ASD8899/15742420.java deleted file mode 100644 index 6e9861fa3ec6d5a2553cdccd1bb1e977430c671b..0000000000000000000000000000000000000000 --- a/codes/ASD8899/15742420.java +++ /dev/null @@ -1,19 +0,0 @@ -/** - * 冒泡排序函数 - * aa bb cc - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - // 你的代码，使无序数组 a 变得有序 - for (int i = 0; i < n - 1; i++) { - for (int j = 0; j < n - i - 1; j++) { - if (a[j] > a[j + 1]) { - - int temp = a[j]; - a[j] = a[j + 1]; - a[j + 1] = temp; - } - } - } -} //end \ No newline at end of file diff --git a/codes/ASR1523580/15669420.java b/codes/ASR1523580/15669420.java deleted file mode 100644 index 02a20ce54b5eb4c0667f7a563b4df0adc5785297..0000000000000000000000000000000000000000 --- a/codes/ASR1523580/15669420.java +++ /dev/null @@ -1,17 +0,0 @@ -/** - * 冒泡排序函数 - * 通过相邻元素两两比较和交换，将较大的元素逐步“浮”到数组的末尾，实现排序 - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int[] a, int n) { - for (int i = 0; i < n - 1; i++) { // 外层循环控制需要比较的轮数 - for (int j = 0; j < n - 1 - i; j++) { // 内层循环控制每轮比较的次数 - if (a[j] > a[j + 1]) { // 如果前一个元素大于后一个元素，则交换它们的位置 - int temp = a[j]; - a[j] = a[j + 1]; - a[j + 1] = temp; - } - } - } -} // end diff --git a/codes/Aa12345678/.keep b/codes/Aa12345678/.keep deleted file mode 100644 index e69de29bb2d1d6434b8b29ae775ad8c2e48c5391..0000000000000000000000000000000000000000 diff --git a/codes/Aa12345678/10043731.java b/codes/Aa12345678/10043731.java deleted file mode 100644 index 667eee0f585ec38ce639cb36d80df080e935946d..0000000000000000000000000000000000000000 --- a/codes/Aa12345678/10043731.java +++ /dev/null @@ -1,11 +0,0 @@ -public static void bubbleSort(int [] a,int n){ - for(int i = 0; i < n-1 ; i++){ - for (int j = 0;j < n-1-i;j++){ - if(a[j] > a[j+1]){ - int temp = a[j]; - a[j] = a[j+1]; - a[j+1] = temp; - } - } - } -} \ No newline at end of file diff --git a/codes/Airbnb/11260348.java b/codes/Airbnb/11260348.java deleted file mode 100644 index 4d7083fe05ce3e6d3fadd59d6d55e2cbc50d546d..0000000000000000000000000000000000000000 --- a/codes/Airbnb/11260348.java +++ /dev/null @@ -1,22 +0,0 @@ -/** - * 冒泡排序函数 - * aa bb cc - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - // 你的代码，使无序数组 a 变得有序 - int i, j; - - for(i=0; ia[j]){ - int temp; - temp = a[j-1]; - a[j-1] = a[j]; - a[j] = temp; - } - } - } - -} //end \ No newline at end of file diff --git a/codes/Allen123/18357308.java b/codes/Allen123/18357308.java deleted file mode 100644 index ce0e06ef69e327ca9540da1041d060c0ecc25fcd..0000000000000000000000000000000000000000 --- a/codes/Allen123/18357308.java +++ /dev/null @@ -1,19 +0,0 @@ - /** - * 冒泡排序函数 - * aa bb cc - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ - public static void bubbleSort(int [] a, int n){ - // 你的代码，使无序数组 a 变得有序 - for (int i = 0; i < a.length - 1; i++) { - for (int j = 0; j < a.length - 1 - i; j++) { - if (a[j] > a[j + 1]) { - a[j] ^= a[j + 1]; - a[j + 1] ^= a[j]; - a[j] ^= a[j + 1]; - } - } - } - - } //end diff --git a/codes/Amyaaa/15624605.java b/codes/Amyaaa/15624605.java deleted file mode 100644 index ad8ad09a2f9c88791a9e320badbe7431bfe97c08..0000000000000000000000000000000000000000 --- a/codes/Amyaaa/15624605.java +++ /dev/null @@ -1,18 +0,0 @@ -/** - * 冒泡排序函数 - * 通过相邻元素之间的比较和交换，使得每一轮比较后最大（或最小）的元素能够"冒泡"到数组的末尾。 - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int[] a, int n) { - for (int i = 0; i < n - 1; i++) { // 外层循环控制排序趟数 - for (int j = 0; j < n - i - 1; j++) { // 内层循环控制每一趟排序多少次 - if (a[j] > a[j + 1]) { // 如果前一个元素比后一个元素大，则交换它们的位置 - // 交换 a[j] 和 a[j+1] - int temp = a[j]; - a[j] = a[j + 1]; - a[j + 1] = temp; - } - } - } -} //end diff --git a/codes/Anheqiao/15630084.java b/codes/Anheqiao/15630084.java deleted file mode 100644 index c2afaa2414da1853e4500b02c6de9068b64aeafe..0000000000000000000000000000000000000000 --- a/codes/Anheqiao/15630084.java +++ /dev/null @@ -1,18 +0,0 @@ -/** - * 冒泡排序函数 - * aa bb cc - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - for(int i = 0; i < n-1 ; i++){ - for (int j = 0;j < n-1-i;j++){ - if(a[j] > a[j+1]){ - int temp = a[j]; - a[j] = a[j+1]; - a[j+1] = temp; - } - } - } - -} //end diff --git a/codes/Anheqiao0512/15535529.java b/codes/Anheqiao0512/15535529.java deleted file mode 100644 index 854beb62bfcf4ead3549d682ffca7f1b9f32d947..0000000000000000000000000000000000000000 --- a/codes/Anheqiao0512/15535529.java +++ /dev/null @@ -1,19 +0,0 @@ -/** - * 冒泡排序函数 - * aa bb cc - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - for(int i = 0; i < n-1 ; i++){ - for (int j = 0;j < n-1-i;j++){ - if(a[j] > a[j+1]){ - int temp = a[j]; - a[j] = a[j+1]; - a[j+1] = temp; - } - } - } - -} //end - diff --git a/codes/AnolisOpen/9754131.java b/codes/AnolisOpen/9754131.java deleted file mode 100644 index 90103364fd2d7804bcb50390b65e743a21bba374..0000000000000000000000000000000000000000 --- a/codes/AnolisOpen/9754131.java +++ /dev/null @@ -1,20 +0,0 @@ - /** - * 冒泡排序函数 - * aa bb cc - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ - public static void bubbleSort(int [] arr, int n){ - // 你的代码，使无序数组 a 变得有序 - for (int i = 0; i < n; i++) { - for (int j = (i + 1); j < n; j++) { - if (arr[i] > arr[j]) { - int temp = arr[i]; - arr[i] = arr[j]; - arr[j] = temp; - } - } - } - } //end - - diff --git a/codes/AnshunEduc/.keep b/codes/AnshunEduc/.keep deleted file mode 100644 index e69de29bb2d1d6434b8b29ae775ad8c2e48c5391..0000000000000000000000000000000000000000 diff --git a/codes/AnshunEduc/15815295.java b/codes/AnshunEduc/15815295.java deleted file mode 100644 index 6e9861fa3ec6d5a2553cdccd1bb1e977430c671b..0000000000000000000000000000000000000000 --- a/codes/AnshunEduc/15815295.java +++ /dev/null @@ -1,19 +0,0 @@ -/** - * 冒泡排序函数 - * aa bb cc - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - // 你的代码，使无序数组 a 变得有序 - for (int i = 0; i < n - 1; i++) { - for (int j = 0; j < n - i - 1; j++) { - if (a[j] > a[j + 1]) { - - int temp = a[j]; - a[j] = a[j + 1]; - a[j + 1] = temp; - } - } - } -} //end \ No newline at end of file diff --git a/codes/AuuuAa/11292635.java b/codes/AuuuAa/11292635.java deleted file mode 100644 index 4d7083fe05ce3e6d3fadd59d6d55e2cbc50d546d..0000000000000000000000000000000000000000 --- a/codes/AuuuAa/11292635.java +++ /dev/null @@ -1,22 +0,0 @@ -/** - * 冒泡排序函数 - * aa bb cc - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - // 你的代码，使无序数组 a 变得有序 - int i, j; - - for(i=0; ia[j]){ - int temp; - temp = a[j-1]; - a[j-1] = a[j]; - a[j] = temp; - } - } - } - -} //end \ No newline at end of file diff --git a/codes/Ayj200417/15815229.java b/codes/Ayj200417/15815229.java deleted file mode 100644 index 5335cfe30760f85213a9c07e444c14406e7ff009..0000000000000000000000000000000000000000 --- a/codes/Ayj200417/15815229.java +++ /dev/null @@ -1,20 +0,0 @@ -/** - * 冒泡排序函数 - * aa bb cc - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - // 你的代码，使无序数组 a 变得有序 - int t; - for (int i = 0; i < n; i++){ - for (int j = i+1;j < n;j++){ - if(a[i] > a[j]){ - t=a[i]; - a[i]=a[j]; - a[j]=t; - } - } - } - -} //end diff --git a/codes/Ayuanlou/15592112.java b/codes/Ayuanlou/15592112.java deleted file mode 100644 index ae82e695cbfd360050241c3f1f592658c8c1d4e7..0000000000000000000000000000000000000000 --- a/codes/Ayuanlou/15592112.java +++ /dev/null @@ -1,35 +0,0 @@ -/** - - * 冒泡排序函数 - - * aa bb cc - - * @param a 待排序的数组 - - * @param n 待排序的数组长度 - - */ - -public static void bubbleSort(int [] a, int n){ - - for(int i = 0; i < n-1 ; i++){ - - for (int j = 0;j < n-1-i;j++){ - - if(a[j] > a[j+1]){ - - int temp = a[j]; - - a[j] = a[j+1]; - - a[j+1] = temp; - - } - - } - - } - - - -} //end diff --git a/codes/BHUIJ217892/11003994.java b/codes/BHUIJ217892/11003994.java deleted file mode 100644 index cdabc2e0876ad629e41ff055727cf3af34be8917..0000000000000000000000000000000000000000 --- a/codes/BHUIJ217892/11003994.java +++ /dev/null @@ -1,20 +0,0 @@ -/** - * 冒泡排序函数 - * aa bb cc - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - // 你的代码，使无序数组 a 变得有序 - for (int i = 0; i < n; i++) { - for (int j = i + 1; j < n; j++) { - if (a[i] > a[j]) { - int temp = a[j]; - a[j] = a[i]; - a[i] = temp; - - } - } - } - -} //end \ No newline at end of file diff --git a/codes/BMWAimee/15775743.java b/codes/BMWAimee/15775743.java deleted file mode 100644 index e7912b20e3feda836763fb3e2489ed9167b1e3a7..0000000000000000000000000000000000000000 --- a/codes/BMWAimee/15775743.java +++ /dev/null @@ -1,20 +0,0 @@ -public static void bubbleSort(int[] a, int n) { - for (int i = 0; i < n - 1; i++) { - // 标记是否发生交换，用于优化，如果这一趟没有发生交换，说明已经有序 - boolean swapped = false; - for (int j = 0; j < n - i - 1; j++) { - // 如果前一个元素大于后一个元素，则交换它们 - if (a[j] > a[j + 1]) { - int temp = a[j]; - a[j] = a[j + 1]; - a[j + 1] = temp; - // 标记发生了交换 - swapped = true; - } - } - // 如果这一趟没有发生交换，说明数组已经有序，提前结束排序 - if (!swapped) { - break; - } - } -} //end diff --git a/codes/BY2487564355/15781003.java b/codes/BY2487564355/15781003.java deleted file mode 100644 index f9b707d85e5ff4aaff4481cb3922450e8ed7ace8..0000000000000000000000000000000000000000 --- a/codes/BY2487564355/15781003.java +++ /dev/null @@ -1,20 +0,0 @@ -/** - * 冒泡排序函数 - * 通过重复遍历待排序的数组，比较相邻的元素，如果它们的顺序错误就把它们交换过来。 - * 遍历数组的工作是重复地进行直到没有再需要交换，也就是说该数组已经排序完成。 - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - for (int i = 0; i < n - 1; i++) { - for (int j = 0; j < n - i - 1; j++) { - // 如果前一个元素大于后一个元素，则交换它们的位置 - if (a[j] > a[j + 1]) { - // 交换 a[j] 和 a[j + 1] - int temp = a[j]; - a[j] = a[j + 1]; - a[j + 1] = temp; - } - } - } -} //end diff --git a/codes/Beca0101/11118448.java b/codes/Beca0101/11118448.java deleted file mode 100644 index 029e9d84c1474520908887693e69aabcb7ff0aba..0000000000000000000000000000000000000000 --- a/codes/Beca0101/11118448.java +++ /dev/null @@ -1,28 +0,0 @@ -/** - * 冒泡排序函数 - * aa bb cc - * @param a 待排序的数组 - * @param n 待排序的数组长度 -*/ -public static void bubbleSort(int [] a, int n){ - int j , k; - int flag = n ;//flag来记录最后交换的位置，也就是排序的尾边界 - - while (flag > 0){//排序未结束标志 - k = flag; //k 来记录遍历的尾边界 - flag = 0; - - for(j=1; j a[j]){//前面的数字大于后面的数字就交换 - //交换a[j-1]和a[j] - int temp; - temp = a[j-1]; - a[j-1] = a[j]; - a[j]=temp; - - //表示交换过数据; - flag = j;//记录最新的尾边界. - } - } - } -} \ No newline at end of file diff --git a/codes/BitBlitz/.keep b/codes/BitBlitz/.keep deleted file mode 100644 index e69de29bb2d1d6434b8b29ae775ad8c2e48c5391..0000000000000000000000000000000000000000 diff --git a/codes/BitBlitz/15775656.java b/codes/BitBlitz/15775656.java deleted file mode 100644 index 6426772fb479b07ed3be21ef1867921d1dbb194c..0000000000000000000000000000000000000000 --- a/codes/BitBlitz/15775656.java +++ /dev/null @@ -1,20 +0,0 @@ -/** - * 冒泡排序函数 - * aa bb cc - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - // 你的代码，使无序数组 a 变得有序 - for(int i = 0; i < n; i++) { - for(int j = 0; j < n - i - 1; j++) { - if(a[j] > a[j + 1]) { - int temp = a[j]; - a [j] = a[j + 1]; - a[j + 1] = temp; - } - } - } - - -} //end \ No newline at end of file diff --git a/codes/Blue_Snow/15778600.java b/codes/Blue_Snow/15778600.java deleted file mode 100644 index 2be998a09939da3d98bb04ca9c2405cceef2ddef..0000000000000000000000000000000000000000 --- a/codes/Blue_Snow/15778600.java +++ /dev/null @@ -1,18 +0,0 @@ -/** - * 冒泡排序函数 - * 通过相邻元素两两比较并交换位置，使得每一轮循环后最大（或最小）的元素能够“冒泡”到数组的末尾 - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int[] a, int n) { - for (int i = 0; i < n - 1; i++) { // 外层循环控制排序的轮数 - for (int j = 0; j < n - 1 - i; j++) { // 内层循环控制每轮需要比较的次数 - if (a[j] > a[j + 1]) { // 如果前一个元素大于后一个元素，则交换它们的位置 - // 交换 a[j] 和 a[j+1] - int temp = a[j]; - a[j] = a[j + 1]; - a[j + 1] = temp; - } - } - } -} // end diff --git a/codes/BrokenDreams/11287383.java b/codes/BrokenDreams/11287383.java deleted file mode 100644 index 4d7083fe05ce3e6d3fadd59d6d55e2cbc50d546d..0000000000000000000000000000000000000000 --- a/codes/BrokenDreams/11287383.java +++ /dev/null @@ -1,22 +0,0 @@ -/** - * 冒泡排序函数 - * aa bb cc - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - // 你的代码，使无序数组 a 变得有序 - int i, j; - - for(i=0; ia[j]){ - int temp; - temp = a[j-1]; - a[j-1] = a[j]; - a[j] = temp; - } - } - } - -} //end \ No newline at end of file diff --git a/codes/C15703010346/15826230.java b/codes/C15703010346/15826230.java deleted file mode 100644 index 24f513b3219ac31ac3dcffe774647aa7bfdac254..0000000000000000000000000000000000000000 --- a/codes/C15703010346/15826230.java +++ /dev/null @@ -1,11 +0,0 @@ -public static void bubbleSort(int [] a, int n){ - for (int i = 0; i < n - 1; i++) { - for (int j = 0; j < n - 1 - i; j++) { - if (a[j] > a[j + 1]) { - int temp = a[j]; - a[j] = a[j + 1]; - a[j + 1] = temp; - } - } - } -} diff --git a/codes/CC422AAACC/.keep b/codes/CC422AAACC/.keep deleted file mode 100644 index e69de29bb2d1d6434b8b29ae775ad8c2e48c5391..0000000000000000000000000000000000000000 diff --git a/codes/CC422AAACC/15742406.java b/codes/CC422AAACC/15742406.java deleted file mode 100644 index 6e9861fa3ec6d5a2553cdccd1bb1e977430c671b..0000000000000000000000000000000000000000 --- a/codes/CC422AAACC/15742406.java +++ /dev/null @@ -1,19 +0,0 @@ -/** - * 冒泡排序函数 - * aa bb cc - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - // 你的代码，使无序数组 a 变得有序 - for (int i = 0; i < n - 1; i++) { - for (int j = 0; j < n - i - 1; j++) { - if (a[j] > a[j + 1]) { - - int temp = a[j]; - a[j] = a[j + 1]; - a[j + 1] = temp; - } - } - } -} //end \ No newline at end of file diff --git a/codes/CKXGZXA/14237106.java b/codes/CKXGZXA/14237106.java deleted file mode 100644 index 60c32309776bdae63a5929fa9f76b4d197f9bfdd..0000000000000000000000000000000000000000 --- a/codes/CKXGZXA/14237106.java +++ /dev/null @@ -1,21 +0,0 @@ -/** - * 冒泡排序函数 - * aa bb cc - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - // 你的代码，使无序数组 a 变得有序 - for (int i = 0; i < n - 1; i++) { - for (int j = 0; j < n - i - 1; j++) { - // 如果相邻元素逆序，则交换它们 - if (a[j] > a[j + 1]) { - int temp = a[j]; - a[j] = a[j + 1]; - a[j + 1] = temp; - } - } - } - - -} //end diff --git a/codes/CMOSInverter/.keep b/codes/CMOSInverter/.keep deleted file mode 100644 index e69de29bb2d1d6434b8b29ae775ad8c2e48c5391..0000000000000000000000000000000000000000 diff --git a/codes/CMOSInverter/15780363.java b/codes/CMOSInverter/15780363.java deleted file mode 100644 index 3e6ece81d82d2f09f9be76837d62d334aef592af..0000000000000000000000000000000000000000 --- a/codes/CMOSInverter/15780363.java +++ /dev/null @@ -1,27 +0,0 @@ -/** - * 冒泡排序函数 - * aa bb cc - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - if (n <= 1) return; // 如果数组长度小于等于1，不需要排序 - - boolean swapped; - for (int i = 0; i < n - 1; i++) { - swapped = false; - for (int j = 0; j < n - 1 - i; j++) { - if (a[j] > a[j + 1]) { - // 交换a[j]和a[j + 1] - int temp = a[j]; - a[j] = a[j + 1]; - a[j + 1] = temp; - swapped = true; - } - } - // 如果这一轮没有发生交换，说明数组已经有序，退出排序 - if (!swapped) { - break; - } - } -} //end diff --git a/codes/CS_Joer/11449450.java b/codes/CS_Joer/11449450.java deleted file mode 100644 index cacd12f1e4e4360dd1ffa22f3741e376110bcde4..0000000000000000000000000000000000000000 --- a/codes/CS_Joer/11449450.java +++ /dev/null @@ -1,18 +0,0 @@ -/** - * 冒泡排序函数 - * aa bb cc - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - // 你的代码，使无序数组 a 变得有序 - for(int i=0;ia[j+1]){ - a[j] = a[j]+a[j+1]; - a[j+1] = a[j]-a[j+1]; - a[j] = a[j]-a[j+1]; - } - } - } -} //end \ No newline at end of file diff --git a/codes/CY3761/15780413.java b/codes/CY3761/15780413.java deleted file mode 100644 index 14e46fcff299b3a6c35419c00c5398d6e5ad7e59..0000000000000000000000000000000000000000 --- a/codes/CY3761/15780413.java +++ /dev/null @@ -1,18 +0,0 @@ -/** - * 冒泡排序函数 - * - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - for(int i = 0; i < n - 1; i++) { - for(int j = 0; j < n - 1 - i; j++) { - if(a[j] > a[j + 1]) { - // 交换 a[j] 和 a[j + 1] - int temp = a[j]; - a[j] = a[j + 1]; - a[j + 1] = temp; - } - } - } -} //end diff --git a/codes/Calli990/11027717.java b/codes/Calli990/11027717.java deleted file mode 100644 index a833d8d31b2581029ab106b60f560dd2c73ff238..0000000000000000000000000000000000000000 --- a/codes/Calli990/11027717.java +++ /dev/null @@ -1,24 +0,0 @@ -/** - * 冒泡排序函数 - * aa bb cc - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - // 你的代码，使无序数组 a 变得有序 - for(int j=0;ja[i+1]) - { - temp=a[i]; - a[i]=a[i+1]; - a[i+1]=temp; - } - } - } - //System.out.println(a); - -} //end \ No newline at end of file diff --git a/codes/CangBOP/11303209.java b/codes/CangBOP/11303209.java deleted file mode 100644 index 24b49b4b1fd01d1f21be8b362a582158452e41d3..0000000000000000000000000000000000000000 --- a/codes/CangBOP/11303209.java +++ /dev/null @@ -1,19 +0,0 @@ -/** - * 冒泡排序函数 - * aa bb cc - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - // 你的代码，使无序数组 a 变得有序 - for(int i = 0 ; i < n - 1 ; i++){ - for(int j = 0 ; j < n - 1 - i ; j++){ - if(a[j] > a[j + 1]){ - int tmp = a[j]; - a[j] = a[j + 1]; - a[j + 1] = tmp; - } - } - } - -} //end \ No newline at end of file diff --git a/codes/Cannon/11268645.java b/codes/Cannon/11268645.java deleted file mode 100644 index cdabc2e0876ad629e41ff055727cf3af34be8917..0000000000000000000000000000000000000000 --- a/codes/Cannon/11268645.java +++ /dev/null @@ -1,20 +0,0 @@ -/** - * 冒泡排序函数 - * aa bb cc - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - // 你的代码，使无序数组 a 变得有序 - for (int i = 0; i < n; i++) { - for (int j = i + 1; j < n; j++) { - if (a[i] > a[j]) { - int temp = a[j]; - a[j] = a[i]; - a[i] = temp; - - } - } - } - -} //end \ No newline at end of file diff --git a/codes/Captaincc/.keep b/codes/Captaincc/.keep deleted file mode 100644 index e69de29bb2d1d6434b8b29ae775ad8c2e48c5391..0000000000000000000000000000000000000000 diff --git a/codes/Captaincc/15781895.java b/codes/Captaincc/15781895.java deleted file mode 100644 index 9f86eb587f5fb5dee2fac7e589a1cf95128af5cc..0000000000000000000000000000000000000000 --- a/codes/Captaincc/15781895.java +++ /dev/null @@ -1,18 +0,0 @@ -/** - * 冒泡排序函数 - * aa bb cc - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - // 你的代码，使无序数组 a 变得有序 - for(int i=0;ia[j+1]){ - a[j] = a[j]+a[j+1]; - a[j+1] = a[j]-a[j+1]; - a[j] = a[j]-a[j+1]; - } - } - } -} //end \ No newline at end of file diff --git a/codes/Case19523171659/.keep b/codes/Case19523171659/.keep deleted file mode 100644 index e69de29bb2d1d6434b8b29ae775ad8c2e48c5391..0000000000000000000000000000000000000000 diff --git a/codes/Case19523171659/10972507.java b/codes/Case19523171659/10972507.java deleted file mode 100644 index 9eccfac593dd84bb4c285d230d4de6b8c72a1d65..0000000000000000000000000000000000000000 --- a/codes/Case19523171659/10972507.java +++ /dev/null @@ -1,11 +0,0 @@ -public static void bubbleSort(int [] a, int n) { - for (int i=0 ; ia[j+1]) { - int temp=a[j]; - a[j]=a[j+1]; - a[j+1]=temp; - } - } - } -} diff --git a/codes/Chailly/15776240.java b/codes/Chailly/15776240.java deleted file mode 100644 index 659e1697be57b8b8879ab97d4fc1abcf6f759708..0000000000000000000000000000000000000000 --- a/codes/Chailly/15776240.java +++ /dev/null @@ -1,18 +0,0 @@ -/** - * 冒泡排序函数 - * 功能：将无序数组通过冒泡排序算法变得有序 - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - for(int i = 0; i < n - 1; i++){ - for(int j = 0; j < n - 1 - i; j++){ - if(a[j] > a[j + 1]){ - // 如果前一个元素大于后一个元素，则交换它们的位置 - int temp = a[j]; - a[j] = a[j + 1]; - a[j + 1] = temp; - } - } - } -} //end diff --git a/codes/Charles953/11342263.java b/codes/Charles953/11342263.java deleted file mode 100644 index b9bf7818d9ffdce1bf2bd0863a51890bffa3f951..0000000000000000000000000000000000000000 --- a/codes/Charles953/11342263.java +++ /dev/null @@ -1,11 +0,0 @@ -public static void bubbleSort(int [] a, int n) { - for (int i=0 ; ia[j+1]) { - int temp=a[j]; - a[j]=a[j+1]; - a[j+1]=temp; - } - } - } -} \ No newline at end of file diff --git a/codes/Chat-4/11187682.java b/codes/Chat-4/11187682.java deleted file mode 100644 index 8c505501c812f686a9abe78a0d1191db6085134c..0000000000000000000000000000000000000000 --- a/codes/Chat-4/11187682.java +++ /dev/null @@ -1,19 +0,0 @@ -/** - * 冒泡排序函数 - * aa bb cc - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - // 你的代码，使无序数组 a 变得有序 - for(int i=0;i a[j+1]){ - int temp = a[j]; - a[j] = a[j+1]; - a[j+1] = temp; - } - } - } - -} //end \ No newline at end of file diff --git a/codes/CheeseMen/11466037.java b/codes/CheeseMen/11466037.java deleted file mode 100644 index 9e7534d4b41cf071c848fa4d5c08c6519526b6e3..0000000000000000000000000000000000000000 --- a/codes/CheeseMen/11466037.java +++ /dev/null @@ -1,18 +0,0 @@ -/** - * 冒泡 排序 函数 - * aa bb cc - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - // 你的代码，使无序数组 a 变得有序 - for (int i = 0; i < n; i++) { - for (int j = 0; j < i; j++) { - if (a[i] < a[j]) { - int t = a[i]; - a[i] = a[j]; - a[j] = t; - } - } - } -}//end \ No newline at end of file diff --git a/codes/ChengRunji/15532439.java b/codes/ChengRunji/15532439.java deleted file mode 100644 index 2252b818e6125ed4f8bbd23eca03c12c15ca1757..0000000000000000000000000000000000000000 --- a/codes/ChengRunji/15532439.java +++ /dev/null @@ -1,19 +0,0 @@ -/** - * 冒泡排序函数 - * aa bb cc - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - // 你的代码，使无序数组 a 变得有序 - for (int i = 0; i < n - 1; i++) { - for (int j = 0; j < n - i - 1; j++) { - if (a[j] > a[j + 1]) { - // 交换元素 - int temp = a[j]; - a[j] = a[j + 1]; - a[j + 1] = temp; - } - } - } -} //end \ No newline at end of file diff --git a/codes/Chengxiaoyu/15650592.java b/codes/Chengxiaoyu/15650592.java deleted file mode 100644 index c2afaa2414da1853e4500b02c6de9068b64aeafe..0000000000000000000000000000000000000000 --- a/codes/Chengxiaoyu/15650592.java +++ /dev/null @@ -1,18 +0,0 @@ -/** - * 冒泡排序函数 - * aa bb cc - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - for(int i = 0; i < n-1 ; i++){ - for (int j = 0;j < n-1-i;j++){ - if(a[j] > a[j+1]){ - int temp = a[j]; - a[j] = a[j+1]; - a[j+1] = temp; - } - } - } - -} //end diff --git a/codes/Chesed/18676140.java b/codes/Chesed/18676140.java deleted file mode 100644 index bb4a238350b3525aa9920e010425890b53ecef5f..0000000000000000000000000000000000000000 --- a/codes/Chesed/18676140.java +++ /dev/null @@ -1,18 +0,0 @@ -/** - * ð - * aa bb cc - * @param a - * @param n 鳤 - */ -public static void bubbleSort(int [] a, int n){ - for(int i = 0; i < n-1 ; i++){ - for (int j = 0;j < n-1-i;j++){ - if(a[j] > a[j+1]){ - int temp = a[j]; - a[j] = a[j+1]; - a[j+1] = temp; - } - } - } - -} //end \ No newline at end of file diff --git a/codes/Christopher/15635786.java b/codes/Christopher/15635786.java deleted file mode 100644 index 9c9fea7e5a6f112ef881921d767eabc005fa9092..0000000000000000000000000000000000000000 --- a/codes/Christopher/15635786.java +++ /dev/null @@ -1,18 +0,0 @@ - /** - * 冒泡排序函数 - * aa bb cc - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ - public static void bubbleSort(int [] arr, int n){ - // 你的代码，使无序数组 a 变得有序 - for (int i = 0; i < n; i++) { - for (int j = (i + 1); j < n; j++) { - if (arr[i] > arr[j]) { - int temp = arr[i]; - arr[i] = arr[j]; - arr[j] = temp; - } - } - } - } //end diff --git a/codes/Chuck395/11358350.java b/codes/Chuck395/11358350.java deleted file mode 100644 index b9bf7818d9ffdce1bf2bd0863a51890bffa3f951..0000000000000000000000000000000000000000 --- a/codes/Chuck395/11358350.java +++ /dev/null @@ -1,11 +0,0 @@ -public static void bubbleSort(int [] a, int n) { - for (int i=0 ; ia[j+1]) { - int temp=a[j]; - a[j]=a[j+1]; - a[j+1]=temp; - } - } - } -} \ No newline at end of file diff --git a/codes/Chy3095852337/18699632.java b/codes/Chy3095852337/18699632.java deleted file mode 100644 index 09874a861bd2c9fa32c705360cfcee5093150c39..0000000000000000000000000000000000000000 --- a/codes/Chy3095852337/18699632.java +++ /dev/null @@ -1,31 +0,0 @@ -/** - * 冒泡排序函数 - * aa bb cc - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int[] a, int n) { - // 外层循环控制排序的总轮数，轮数等于数组长度减一 - for (int i = 0; i < n - 1; i++) { - // 初始化一个标志位，用于判断当前轮是否发生了交换 - boolean swapped = false; - - // 内层循环控制每一轮的比较次数，每次比较相邻的两个元素 - for (int j = 0; j < n - i - 1; j++) { - // 如果当前元素大于下一个元素，交换它们 - if (a[j] > a[j + 1]) { - // 交换元素 - int temp = a[j]; - a[j] = a[j + 1]; - a[j + 1] = temp; - - // 设置标志位为 true - swapped = true; - } - } - - if (!swapped) { - break; - } - } -} diff --git a/codes/CloudyLemonade/15780990.java b/codes/CloudyLemonade/15780990.java deleted file mode 100644 index d6a8d70a5eafb125213036fa616535a49bb64f61..0000000000000000000000000000000000000000 --- a/codes/CloudyLemonade/15780990.java +++ /dev/null @@ -1,18 +0,0 @@ -/** - * 冒泡排序函数 - * 遍历数组，比较相邻元素，如果顺序错误则交换它们，重复这个过程直到没有需要交换的元素为止。 - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - for (int i = 0; i < n - 1; i++) { - for (int j = 0; j < n - 1 - i; j++) { - if (a[j] > a[j + 1]) { - // 如果前一个元素大于后一个元素，则交换它们 - int temp = a[j]; - a[j] = a[j + 1]; - a[j + 1] = temp; - } - } - } -} //end diff --git a/codes/Cobytebyte/.keep b/codes/Cobytebyte/.keep deleted file mode 100644 index e69de29bb2d1d6434b8b29ae775ad8c2e48c5391..0000000000000000000000000000000000000000 diff --git a/codes/Cobytebyte/15779518.java b/codes/Cobytebyte/15779518.java deleted file mode 100644 index 83497d9a50b2195c0f83f28598452b59573c98ad..0000000000000000000000000000000000000000 --- a/codes/Cobytebyte/15779518.java +++ /dev/null @@ -1,18 +0,0 @@ -/** - * 冒泡 排序 函数 - * aa bb cc - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - // 你的代码，使无序数组 a 变得有序 - for (int i = 0; i < n; i++) { - for (int j = 0; j < i; j++) { - if (a[i] < a[j]) { - int t = a[i]; - a[i] = a[j]; - a[j] = t; - } - } - } -}//end \ No newline at end of file diff --git a/codes/Coder_Kang/.keep b/codes/Coder_Kang/.keep deleted file mode 100644 index e69de29bb2d1d6434b8b29ae775ad8c2e48c5391..0000000000000000000000000000000000000000 diff --git a/codes/Coder_Kang/15777819.java b/codes/Coder_Kang/15777819.java deleted file mode 100644 index 343fcd48366acf1c442cc3c54da0deb903bde96b..0000000000000000000000000000000000000000 --- a/codes/Coder_Kang/15777819.java +++ /dev/null @@ -1,18 +0,0 @@ - /** - * 冒泡排序函数 - * aa bb cc - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ - public static void bubbleSort(int [] arr, int n){ - // 你的代码，使无序数组 a 变得有序 - for (int i = 0; i < n; i++) { - for (int j = (i + 1); j < n; j++) { - if (arr[i] > arr[j]) { - int temp = arr[i]; - arr[i] = arr[j]; - arr[j] = temp; - } - } - } - } //end \ No newline at end of file diff --git a/codes/Colazxk/9952351.java b/codes/Colazxk/9952351.java deleted file mode 100644 index 53759c2f48f52ac41393572a21510648027f32cd..0000000000000000000000000000000000000000 --- a/codes/Colazxk/9952351.java +++ /dev/null @@ -1,19 +0,0 @@ -/** - * 冒泡排序函数 - * aa bb cc - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - // 你的代码，使无序数组 a 变得有序 - for(int i=0;ia[j+1]){ - int t=a[j]; - a[j]=a[j+1]; - a[j+1]=t; - } - } - } - -} //end diff --git a/codes/CuiChenyuan/15758456.java b/codes/CuiChenyuan/15758456.java deleted file mode 100644 index 2252b818e6125ed4f8bbd23eca03c12c15ca1757..0000000000000000000000000000000000000000 --- a/codes/CuiChenyuan/15758456.java +++ /dev/null @@ -1,19 +0,0 @@ -/** - * 冒泡排序函数 - * aa bb cc - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - // 你的代码，使无序数组 a 变得有序 - for (int i = 0; i < n - 1; i++) { - for (int j = 0; j < n - i - 1; j++) { - if (a[j] > a[j + 1]) { - // 交换元素 - int temp = a[j]; - a[j] = a[j + 1]; - a[j + 1] = temp; - } - } - } -} //end \ No newline at end of file diff --git a/codes/D15059170203/.keep b/codes/D15059170203/.keep deleted file mode 100644 index e69de29bb2d1d6434b8b29ae775ad8c2e48c5391..0000000000000000000000000000000000000000 diff --git a/codes/D15059170203/10976249.java b/codes/D15059170203/10976249.java deleted file mode 100644 index 9eccfac593dd84bb4c285d230d4de6b8c72a1d65..0000000000000000000000000000000000000000 --- a/codes/D15059170203/10976249.java +++ /dev/null @@ -1,11 +0,0 @@ -public static void bubbleSort(int [] a, int n) { - for (int i=0 ; ia[j+1]) { - int temp=a[j]; - a[j]=a[j+1]; - a[j+1]=temp; - } - } - } -} diff --git a/codes/DENGXC/10553088.java b/codes/DENGXC/10553088.java deleted file mode 100644 index 7db1ed71c900652c30e8b1c3e9172e685287856a..0000000000000000000000000000000000000000 --- a/codes/DENGXC/10553088.java +++ /dev/null @@ -1,11 +0,0 @@ -public static void bubbleSort(int []arr, int n) { - for(int i=0; i < n-1; i++) { - for(int j=0; j < n-i-1; j++) { - if(arr[j]>arr[j+1]) { - int temp = arr[j+1]; - arr[j+1] = arr[j]; - arr[j] = temp; - } - } - } -} \ No newline at end of file diff --git a/codes/DFSVVV/16465950.java b/codes/DFSVVV/16465950.java deleted file mode 100644 index f7a73b33c97218a7aa395452e3f69a8f2bfb58d7..0000000000000000000000000000000000000000 --- a/codes/DFSVVV/16465950.java +++ /dev/null @@ -1,19 +0,0 @@ -/** - * 冒泡排序函数 - * aa bb cc - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - // 你的代码，使无序数组 a 变得有序 - for(int i = 0;i < n-1 ; i++){ - for(int j = 1;j < n -i ;j++){ - if(a[j-1] > a[j]){ - int temp = a[j -1]; - a[j-1] = a[j]; - a[j] = temp; - } - } - } - -} //end diff --git a/codes/DH13480641255/15621028.java b/codes/DH13480641255/15621028.java deleted file mode 100644 index 38ba933c754afe70ecd4b39c7b225fe0231cfc11..0000000000000000000000000000000000000000 --- a/codes/DH13480641255/15621028.java +++ /dev/null @@ -1,20 +0,0 @@ - -/** - * 冒泡排序函数 - * 实现数组的冒泡排序 - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int[] a, int n) { - for (int i = 0; i < n - 1; i++) { - for (int j = 0; j < n - 1 - i; j++) { - if (a[j] > a[j + 1]) { - // 交换 a[j] 和 a[j+1] 的值 - int temp = a[j]; - a[j] = a[j + 1]; - a[j + 1] = temp; - } - } - } -} //end - diff --git a/codes/Daenery/.keep b/codes/Daenery/.keep deleted file mode 100644 index e69de29bb2d1d6434b8b29ae775ad8c2e48c5391..0000000000000000000000000000000000000000 diff --git a/codes/Daenery/15780888.java b/codes/Daenery/15780888.java deleted file mode 100644 index 9f86eb587f5fb5dee2fac7e589a1cf95128af5cc..0000000000000000000000000000000000000000 --- a/codes/Daenery/15780888.java +++ /dev/null @@ -1,18 +0,0 @@ -/** - * 冒泡排序函数 - * aa bb cc - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - // 你的代码，使无序数组 a 变得有序 - for(int i=0;ia[j+1]){ - a[j] = a[j]+a[j+1]; - a[j+1] = a[j]-a[j+1]; - a[j] = a[j]-a[j+1]; - } - } - } -} //end \ No newline at end of file diff --git a/codes/DaybyDay/11117022.java b/codes/DaybyDay/11117022.java deleted file mode 100644 index b9bf7818d9ffdce1bf2bd0863a51890bffa3f951..0000000000000000000000000000000000000000 --- a/codes/DaybyDay/11117022.java +++ /dev/null @@ -1,11 +0,0 @@ -public static void bubbleSort(int [] a, int n) { - for (int i=0 ; ia[j+1]) { - int temp=a[j]; - a[j]=a[j+1]; - a[j+1]=temp; - } - } - } -} \ No newline at end of file diff --git a/codes/DeepThinking/11452012.java b/codes/DeepThinking/11452012.java deleted file mode 100644 index cacd12f1e4e4360dd1ffa22f3741e376110bcde4..0000000000000000000000000000000000000000 --- a/codes/DeepThinking/11452012.java +++ /dev/null @@ -1,18 +0,0 @@ -/** - * 冒泡排序函数 - * aa bb cc - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - // 你的代码，使无序数组 a 变得有序 - for(int i=0;ia[j+1]){ - a[j] = a[j]+a[j+1]; - a[j+1] = a[j]-a[j+1]; - a[j] = a[j]-a[j+1]; - } - } - } -} //end \ No newline at end of file diff --git a/codes/Dgwoisdg/11001326.java b/codes/Dgwoisdg/11001326.java deleted file mode 100644 index 1c8889947f924214c71a3c3f202500b4780dc281..0000000000000000000000000000000000000000 --- a/codes/Dgwoisdg/11001326.java +++ /dev/null @@ -1,11 +0,0 @@ -public static void bubbleSort(int [] a,int n){ - for(int i = 0; i < n-1 ; i++){ - for (int j = 0;j < n-1-i;j++){ - if(a[j] > a[j+1]){ - int temp = a[j]; - a[j] = a[j+1]; - a[j+1] = temp; - } - } - } -} \ No newline at end of file diff --git a/codes/Dobyhe4rts/.keep b/codes/Dobyhe4rts/.keep deleted file mode 100644 index e69de29bb2d1d6434b8b29ae775ad8c2e48c5391..0000000000000000000000000000000000000000 diff --git a/codes/Dobyhe4rts/15844721.java b/codes/Dobyhe4rts/15844721.java deleted file mode 100644 index 6e9861fa3ec6d5a2553cdccd1bb1e977430c671b..0000000000000000000000000000000000000000 --- a/codes/Dobyhe4rts/15844721.java +++ /dev/null @@ -1,19 +0,0 @@ -/** - * 冒泡排序函数 - * aa bb cc - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - // 你的代码，使无序数组 a 变得有序 - for (int i = 0; i < n - 1; i++) { - for (int j = 0; j < n - i - 1; j++) { - if (a[j] > a[j + 1]) { - - int temp = a[j]; - a[j] = a[j + 1]; - a[j + 1] = temp; - } - } - } -} //end \ No newline at end of file diff --git a/codes/DongGuoPy/.keep b/codes/DongGuoPy/.keep deleted file mode 100644 index e69de29bb2d1d6434b8b29ae775ad8c2e48c5391..0000000000000000000000000000000000000000 diff --git a/codes/DongGuoPy/15844969.java b/codes/DongGuoPy/15844969.java deleted file mode 100644 index 6e9861fa3ec6d5a2553cdccd1bb1e977430c671b..0000000000000000000000000000000000000000 --- a/codes/DongGuoPy/15844969.java +++ /dev/null @@ -1,19 +0,0 @@ -/** - * 冒泡排序函数 - * aa bb cc - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - // 你的代码，使无序数组 a 变得有序 - for (int i = 0; i < n - 1; i++) { - for (int j = 0; j < n - i - 1; j++) { - if (a[j] > a[j + 1]) { - - int temp = a[j]; - a[j] = a[j + 1]; - a[j + 1] = temp; - } - } - } -} //end \ No newline at end of file diff --git a/codes/Dream1tposs/.keep b/codes/Dream1tposs/.keep deleted file mode 100644 index e69de29bb2d1d6434b8b29ae775ad8c2e48c5391..0000000000000000000000000000000000000000 diff --git a/codes/Dream1tposs/15843789.java b/codes/Dream1tposs/15843789.java deleted file mode 100644 index 6e9861fa3ec6d5a2553cdccd1bb1e977430c671b..0000000000000000000000000000000000000000 --- a/codes/Dream1tposs/15843789.java +++ /dev/null @@ -1,19 +0,0 @@ -/** - * 冒泡排序函数 - * aa bb cc - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - // 你的代码，使无序数组 a 变得有序 - for (int i = 0; i < n - 1; i++) { - for (int j = 0; j < n - i - 1; j++) { - if (a[j] > a[j + 1]) { - - int temp = a[j]; - a[j] = a[j + 1]; - a[j + 1] = temp; - } - } - } -} //end \ No newline at end of file diff --git a/codes/Dream_37/15775021.java b/codes/Dream_37/15775021.java deleted file mode 100644 index 2ec05a46452ed06bc6db9d35d61a106ee60950ca..0000000000000000000000000000000000000000 --- a/codes/Dream_37/15775021.java +++ /dev/null @@ -1,21 +0,0 @@ -/** - * 冒泡排序函数 - * 通过不断比较相邻的元素，如果顺序错误则交换它们的位置，直到没有元素需要交换，排序完成。 - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int[] a, int n) { - // 遍历整个数组 - for (int i = 0; i < n - 1; i++) { - // Last i elements are already in place - for (int j = 0; j < n - i - 1; j++) { - // 遍历数组从 0 到 n-i-1，交换如果元素找到比下一个元素大 - if (a[j] > a[j + 1]) { - // 交换 a[j] 和 a[j+1] - int temp = a[j]; - a[j] = a[j + 1]; - a[j + 1] = temp; - } - } - } -} //end diff --git a/codes/Dreamachine/15834244.java b/codes/Dreamachine/15834244.java deleted file mode 100644 index 359611893987a0706367c172b0c17be473dd366f..0000000000000000000000000000000000000000 --- a/codes/Dreamachine/15834244.java +++ /dev/null @@ -1,18 +0,0 @@ -/** - * 冒泡排序函数 - * 对数组a进行冒泡排序，将其变为有序数组 - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int[] a, int n) { - for (int i = 0; i < n - 1; i++) { // 外层循环，控制排序趟数 - for (int j = 0; j < n - i - 1; j++) { // 内层循环，进行相邻元素比较和交换 - if (a[j] > a[j + 1]) { // 如果当前元素大于下一个元素，则交换它们 - // 交换a[j]和a[j+1] - int temp = a[j]; - a[j] = a[j + 1]; - a[j + 1] = temp; - } - } - } -} //end diff --git a/codes/Dreamlover/11202583.java b/codes/Dreamlover/11202583.java deleted file mode 100644 index 272a12fc81d3dd0e857bba9ae001c15818fb7123..0000000000000000000000000000000000000000 --- a/codes/Dreamlover/11202583.java +++ /dev/null @@ -1,18 +0,0 @@ - /** - * 冒泡排序函数 - * aa bb cc - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ - public static void bubbleSort(int [] arr, int n){ - // 你的代码，使无序数组 a 变得有序 - for (int i = 0; i < n; i++) { - for (int j = (i + 1); j < n; j++) { - if (arr[i] > arr[j]) { - int temp = arr[i]; - arr[i] = arr[j]; - arr[j] = temp; - } - } - } - } //end \ No newline at end of file diff --git a/codes/Duvet123/11306690.java b/codes/Duvet123/11306690.java deleted file mode 100644 index 8d589d7edfe50246fe5deff283186d81a64dc137..0000000000000000000000000000000000000000 --- a/codes/Duvet123/11306690.java +++ /dev/null @@ -1,21 +0,0 @@ -/** - * 冒泡排序函数 - * aa bb cc - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a,int n){ - int temp =0; - for(int i = 0;ia[j+1]){ - temp = a[j]; - a[j] = a[j+1]; - a[j+1] = temp; - } - } - } - - - -} \ No newline at end of file diff --git a/codes/DuxiaoJava/.keep b/codes/DuxiaoJava/.keep deleted file mode 100644 index e69de29bb2d1d6434b8b29ae775ad8c2e48c5391..0000000000000000000000000000000000000000 diff --git a/codes/DuxiaoJava/15841250.java b/codes/DuxiaoJava/15841250.java deleted file mode 100644 index 6e9861fa3ec6d5a2553cdccd1bb1e977430c671b..0000000000000000000000000000000000000000 --- a/codes/DuxiaoJava/15841250.java +++ /dev/null @@ -1,19 +0,0 @@ -/** - * 冒泡排序函数 - * aa bb cc - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - // 你的代码，使无序数组 a 变得有序 - for (int i = 0; i < n - 1; i++) { - for (int j = 0; j < n - i - 1; j++) { - if (a[j] > a[j + 1]) { - - int temp = a[j]; - a[j] = a[j + 1]; - a[j + 1] = temp; - } - } - } -} //end \ No newline at end of file diff --git a/codes/EthanLeo/10155282.java b/codes/EthanLeo/10155282.java deleted file mode 100644 index f920043964316c8b98cc5590b2416759315d88b8..0000000000000000000000000000000000000000 --- a/codes/EthanLeo/10155282.java +++ /dev/null @@ -1,20 +0,0 @@ -/** - * 冒泡排序函数 - * aa bb cc - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - // 你的代码，使无序数组 a 变得有序 - for (int i = 0; i < n; i++) { - for (int j = i + 1; j < n; j++) { - if (a[i] > a[j]) { - int temp = a[j]; - a[j] = a[i]; - a[i] = temp; - - } - } - } - -} //end diff --git a/codes/Evening/15453362.java b/codes/Evening/15453362.java deleted file mode 100644 index 74d00cd537347abc649db59a9c02dc1f89ee0c8b..0000000000000000000000000000000000000000 --- a/codes/Evening/15453362.java +++ /dev/null @@ -1,25 +0,0 @@ -/** - * 冒泡排序函数 - * aa bb cc - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - // 你的代码，使无序数组 a 变得有序 - for (int i = 0; i < n; i++) { - boolean flag = false; - - for (int j = 0; j < n - i - 1; j++) { - if (a[j] > a[j + 1]) { - int temp = a[j]; - a[j] = a[j + 1]; - a[j + 1] = temp; - flag = true; - } - } - - if (!flag) { - break; - } - } -} //end diff --git a/codes/F5Lauchers/.keep b/codes/F5Lauchers/.keep deleted file mode 100644 index e69de29bb2d1d6434b8b29ae775ad8c2e48c5391..0000000000000000000000000000000000000000 diff --git a/codes/F5Lauchers/15845684.java b/codes/F5Lauchers/15845684.java deleted file mode 100644 index 6e9861fa3ec6d5a2553cdccd1bb1e977430c671b..0000000000000000000000000000000000000000 --- a/codes/F5Lauchers/15845684.java +++ /dev/null @@ -1,19 +0,0 @@ -/** - * 冒泡排序函数 - * aa bb cc - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - // 你的代码，使无序数组 a 变得有序 - for (int i = 0; i < n - 1; i++) { - for (int j = 0; j < n - i - 1; j++) { - if (a[j] > a[j + 1]) { - - int temp = a[j]; - a[j] = a[j + 1]; - a[j + 1] = temp; - } - } - } -} //end \ No newline at end of file diff --git a/codes/FEEEDED/15775783.java b/codes/FEEEDED/15775783.java deleted file mode 100644 index 14e46fcff299b3a6c35419c00c5398d6e5ad7e59..0000000000000000000000000000000000000000 --- a/codes/FEEEDED/15775783.java +++ /dev/null @@ -1,18 +0,0 @@ -/** - * 冒泡排序函数 - * - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - for(int i = 0; i < n - 1; i++) { - for(int j = 0; j < n - 1 - i; j++) { - if(a[j] > a[j + 1]) { - // 交换 a[j] 和 a[j + 1] - int temp = a[j]; - a[j] = a[j + 1]; - a[j + 1] = temp; - } - } - } -} //end diff --git a/codes/FE_winter/.keep b/codes/FE_winter/.keep deleted file mode 100644 index e69de29bb2d1d6434b8b29ae775ad8c2e48c5391..0000000000000000000000000000000000000000 diff --git a/codes/FE_winter/15781031.java b/codes/FE_winter/15781031.java deleted file mode 100644 index 481ec544586e454023356184f1ce87ca671a7507..0000000000000000000000000000000000000000 --- a/codes/FE_winter/15781031.java +++ /dev/null @@ -1,19 +0,0 @@ -/** - * 冒泡排序函数 - * aa bb cc - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - // 你的代码，使无序数组 a 变得有序 - for(int i = 0 ; i < n - 1 ; i++){ - for(int j = 0 ; j < n - 1 - i ; j++){ - if(a[j] > a[j + 1]){ - int tmp = a[j]; - a[j] = a[j + 1]; - a[j + 1] = tmp; - } - } - } - -} //end \ No newline at end of file diff --git a/codes/FNCdoinb/.keep b/codes/FNCdoinb/.keep deleted file mode 100644 index e69de29bb2d1d6434b8b29ae775ad8c2e48c5391..0000000000000000000000000000000000000000 diff --git a/codes/FNCdoinb/15845153.java b/codes/FNCdoinb/15845153.java deleted file mode 100644 index 6e9861fa3ec6d5a2553cdccd1bb1e977430c671b..0000000000000000000000000000000000000000 --- a/codes/FNCdoinb/15845153.java +++ /dev/null @@ -1,19 +0,0 @@ -/** - * 冒泡排序函数 - * aa bb cc - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - // 你的代码，使无序数组 a 变得有序 - for (int i = 0; i < n - 1; i++) { - for (int j = 0; j < n - i - 1; j++) { - if (a[j] > a[j + 1]) { - - int temp = a[j]; - a[j] = a[j + 1]; - a[j + 1] = temp; - } - } - } -} //end \ No newline at end of file diff --git a/codes/FOYEGE/11326121.java b/codes/FOYEGE/11326121.java deleted file mode 100644 index 9e7534d4b41cf071c848fa4d5c08c6519526b6e3..0000000000000000000000000000000000000000 --- a/codes/FOYEGE/11326121.java +++ /dev/null @@ -1,18 +0,0 @@ -/** - * 冒泡 排序 函数 - * aa bb cc - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - // 你的代码，使无序数组 a 变得有序 - for (int i = 0; i < n; i++) { - for (int j = 0; j < i; j++) { - if (a[i] < a[j]) { - int t = a[i]; - a[i] = a[j]; - a[j] = t; - } - } - } -}//end \ No newline at end of file diff --git a/codes/Falcon/17001758.java b/codes/Falcon/17001758.java deleted file mode 100644 index 731902b0ed0f98f152c81575f106635d723b3f88..0000000000000000000000000000000000000000 --- a/codes/Falcon/17001758.java +++ /dev/null @@ -1,19 +0,0 @@ -/** - * 冒泡排序函数 - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int[] a, int n) { - // 外层循环控制排序轮数 - for (int i = 0; i < n - 1; i++) { - // 内层循环进行相邻元素的比较和交换 - for (int j = 0; j < n - 1 - i; j++) { - if (a[j] > a[j + 1]) { - // 交换a[j]和a[j+1] - int temp = a[j]; - a[j] = a[j + 1]; - a[j + 1] = temp; - } - } - } -} //end diff --git a/codes/Faweiya/11259965.java b/codes/Faweiya/11259965.java deleted file mode 100644 index 24b49b4b1fd01d1f21be8b362a582158452e41d3..0000000000000000000000000000000000000000 --- a/codes/Faweiya/11259965.java +++ /dev/null @@ -1,19 +0,0 @@ -/** - * 冒泡排序函数 - * aa bb cc - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - // 你的代码，使无序数组 a 变得有序 - for(int i = 0 ; i < n - 1 ; i++){ - for(int j = 0 ; j < n - 1 - i ; j++){ - if(a[j] > a[j + 1]){ - int tmp = a[j]; - a[j] = a[j + 1]; - a[j + 1] = tmp; - } - } - } - -} //end \ No newline at end of file diff --git a/codes/FbxgIt/11302915.java b/codes/FbxgIt/11302915.java deleted file mode 100644 index 4d7083fe05ce3e6d3fadd59d6d55e2cbc50d546d..0000000000000000000000000000000000000000 --- a/codes/FbxgIt/11302915.java +++ /dev/null @@ -1,22 +0,0 @@ -/** - * 冒泡排序函数 - * aa bb cc - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - // 你的代码，使无序数组 a 变得有序 - int i, j; - - for(i=0; ia[j]){ - int temp; - temp = a[j-1]; - a[j-1] = a[j]; - a[j] = temp; - } - } - } - -} //end \ No newline at end of file diff --git a/codes/FiberMoney/.keep b/codes/FiberMoney/.keep deleted file mode 100644 index e69de29bb2d1d6434b8b29ae775ad8c2e48c5391..0000000000000000000000000000000000000000 diff --git a/codes/FiberMoney/15842105.java b/codes/FiberMoney/15842105.java deleted file mode 100644 index 6e9861fa3ec6d5a2553cdccd1bb1e977430c671b..0000000000000000000000000000000000000000 --- a/codes/FiberMoney/15842105.java +++ /dev/null @@ -1,19 +0,0 @@ -/** - * 冒泡排序函数 - * aa bb cc - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - // 你的代码，使无序数组 a 变得有序 - for (int i = 0; i < n - 1; i++) { - for (int j = 0; j < n - i - 1; j++) { - if (a[j] > a[j + 1]) { - - int temp = a[j]; - a[j] = a[j + 1]; - a[j + 1] = temp; - } - } - } -} //end \ No newline at end of file diff --git a/codes/Fickler/15510871.java b/codes/Fickler/15510871.java deleted file mode 100644 index 09064e0de2a17f59f9d03567fa6cd8733beb1238..0000000000000000000000000000000000000000 --- a/codes/Fickler/15510871.java +++ /dev/null @@ -1,19 +0,0 @@ -/** - * 冒泡排序函数 - * 通过相邻元素两两比较和交换，将最大（或最小）的元素冒泡到数组末尾。 - * 重复执行，直到整个数组有序。 - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int[] a, int n) { - for (int i = 0; i < n - 1; i++) { // 外层循环控制排序趟数 - for (int j = 0; j < n - 1 - i; j++) { // 内层循环控制每一趟排序多少次 - if (a[j] > a[j + 1]) { // 相邻元素两两比较，如果前一个元素比后一个元素大则交换它们 - // 交换 a[j] 和 a[j + 1] - int temp = a[j]; - a[j] = a[j + 1]; - a[j + 1] = temp; - } - } - } -} // end bubbleSort diff --git a/codes/Firethrows/.keep b/codes/Firethrows/.keep deleted file mode 100644 index e69de29bb2d1d6434b8b29ae775ad8c2e48c5391..0000000000000000000000000000000000000000 diff --git a/codes/Firethrows/15845639.java b/codes/Firethrows/15845639.java deleted file mode 100644 index 6e9861fa3ec6d5a2553cdccd1bb1e977430c671b..0000000000000000000000000000000000000000 --- a/codes/Firethrows/15845639.java +++ /dev/null @@ -1,19 +0,0 @@ -/** - * 冒泡排序函数 - * aa bb cc - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - // 你的代码，使无序数组 a 变得有序 - for (int i = 0; i < n - 1; i++) { - for (int j = 0; j < n - i - 1; j++) { - if (a[j] > a[j + 1]) { - - int temp = a[j]; - a[j] = a[j + 1]; - a[j + 1] = temp; - } - } - } -} //end \ No newline at end of file diff --git a/codes/Fitz_dev/9948244.java b/codes/Fitz_dev/9948244.java deleted file mode 100644 index 191de91d18bdb330ab1609aaa3b20eeb19226481..0000000000000000000000000000000000000000 --- a/codes/Fitz_dev/9948244.java +++ /dev/null @@ -1,11 +0,0 @@ - public static void bubbleSort(int[] a, int n) { - for (int i = 0; i < a.length - 1; i++) { - for (int j = 0; j < a.length - 1 - i; j++) { - if (a[j] > a[j + 1]) { - int temp = a[j + 1]; - a[j + 1] = a[j]; - a[j] = temp; - } - } - } - } \ No newline at end of file diff --git a/codes/Fog16623132936/.keep b/codes/Fog16623132936/.keep deleted file mode 100644 index e69de29bb2d1d6434b8b29ae775ad8c2e48c5391..0000000000000000000000000000000000000000 diff --git a/codes/Fog16623132936/10972627.java b/codes/Fog16623132936/10972627.java deleted file mode 100644 index 9eccfac593dd84bb4c285d230d4de6b8c72a1d65..0000000000000000000000000000000000000000 --- a/codes/Fog16623132936/10972627.java +++ /dev/null @@ -1,11 +0,0 @@ -public static void bubbleSort(int [] a, int n) { - for (int i=0 ; ia[j+1]) { - int temp=a[j]; - a[j]=a[j+1]; - a[j+1]=temp; - } - } - } -} diff --git a/codes/Freewarnings/.keep b/codes/Freewarnings/.keep deleted file mode 100644 index e69de29bb2d1d6434b8b29ae775ad8c2e48c5391..0000000000000000000000000000000000000000 diff --git a/codes/Freewarnings/15841566.java b/codes/Freewarnings/15841566.java deleted file mode 100644 index 6e9861fa3ec6d5a2553cdccd1bb1e977430c671b..0000000000000000000000000000000000000000 --- a/codes/Freewarnings/15841566.java +++ /dev/null @@ -1,19 +0,0 @@ -/** - * 冒泡排序函数 - * aa bb cc - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - // 你的代码，使无序数组 a 变得有序 - for (int i = 0; i < n - 1; i++) { - for (int j = 0; j < n - i - 1; j++) { - if (a[j] > a[j + 1]) { - - int temp = a[j]; - a[j] = a[j + 1]; - a[j + 1] = temp; - } - } - } -} //end \ No newline at end of file diff --git a/codes/Fulovecode/.keep b/codes/Fulovecode/.keep deleted file mode 100644 index e69de29bb2d1d6434b8b29ae775ad8c2e48c5391..0000000000000000000000000000000000000000 diff --git a/codes/Fulovecode/15843647.java b/codes/Fulovecode/15843647.java deleted file mode 100644 index 6e9861fa3ec6d5a2553cdccd1bb1e977430c671b..0000000000000000000000000000000000000000 --- a/codes/Fulovecode/15843647.java +++ /dev/null @@ -1,19 +0,0 @@ -/** - * 冒泡排序函数 - * aa bb cc - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - // 你的代码，使无序数组 a 变得有序 - for (int i = 0; i < n - 1; i++) { - for (int j = 0; j < n - i - 1; j++) { - if (a[j] > a[j + 1]) { - - int temp = a[j]; - a[j] = a[j + 1]; - a[j + 1] = temp; - } - } - } -} //end \ No newline at end of file diff --git a/codes/Fuysus/15342593.java b/codes/Fuysus/15342593.java deleted file mode 100644 index 42efb78bd2fda83f4dd10b8e410a507cadd6f995..0000000000000000000000000000000000000000 --- a/codes/Fuysus/15342593.java +++ /dev/null @@ -1,21 +0,0 @@ -/** - * 冒泡排序函数 - * aa bb cc - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int[] a, int n) -{ - for(int i = 0; i < n - 1; ++i) - { - for(int j = 0; j < n - i - 1; ++j) - { - if(a[j] > a[j+1]) - { - a[j] = a[j] ^ a[j+1]; - a[j+1] = a[j] ^ a[j+1]; - a[j] = a[j]^ a[j+1]; - } - } - } -} diff --git a/codes/G3264043229/15813840.java b/codes/G3264043229/15813840.java deleted file mode 100644 index 1d4a099c85c0ea3893658bda6a7cc89afa13c81c..0000000000000000000000000000000000000000 --- a/codes/G3264043229/15813840.java +++ /dev/null @@ -1,18 +0,0 @@ -/** - * 冒泡排序函数 - * 将无序数组 a 进行升序排序 - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int[] a, int n) { - for (int i = 0; i < n - 1; i++) { // 外层循环控制排序趟数 - for (int j = 0; j < n - 1 - i; j++) { // 内层循环负责每趟的比较和交换 - if (a[j] > a[j + 1]) { // 如果当前元素大于下一个元素，则交换它们的位置 - // 交换 a[j] 和 a[j+1] - int temp = a[j]; - a[j] = a[j + 1]; - a[j + 1] = temp; - } - } - } -} // end diff --git a/codes/G4me4399/.keep b/codes/G4me4399/.keep deleted file mode 100644 index e69de29bb2d1d6434b8b29ae775ad8c2e48c5391..0000000000000000000000000000000000000000 diff --git a/codes/G4me4399/15843085.java b/codes/G4me4399/15843085.java deleted file mode 100644 index 6e9861fa3ec6d5a2553cdccd1bb1e977430c671b..0000000000000000000000000000000000000000 --- a/codes/G4me4399/15843085.java +++ /dev/null @@ -1,19 +0,0 @@ -/** - * 冒泡排序函数 - * aa bb cc - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - // 你的代码，使无序数组 a 变得有序 - for (int i = 0; i < n - 1; i++) { - for (int j = 0; j < n - i - 1; j++) { - if (a[j] > a[j + 1]) { - - int temp = a[j]; - a[j] = a[j + 1]; - a[j + 1] = temp; - } - } - } -} //end \ No newline at end of file diff --git a/codes/GIN0001/15777016.java b/codes/GIN0001/15777016.java deleted file mode 100644 index dd8f3220a2b5b3c77f77304ba9c37cec2ddcfe23..0000000000000000000000000000000000000000 --- a/codes/GIN0001/15777016.java +++ /dev/null @@ -1,26 +0,0 @@ -/** - * 冒泡排序函数 - * 通过相邻元素两两比较并交换，使得每一轮循环后最大（或最小）的元素被放到正确的位置 - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - for (int i = 0; i < n - 1; i++) { // 外层循环控制比较的轮数 - for (int j = 0; j < n - i - 1; j++) { // 内层循环控制每轮比较的次数 - if (a[j] > a[j + 1]) { // 如果前一个元素大于后一个元素，则交换它们的位置 - int temp = a[j]; - a[j] = a[j + 1]; - a[j + 1] = temp; - } - } - } -} //end - - - - - - - - - diff --git a/codes/GUIDM1966/15524857.java b/codes/GUIDM1966/15524857.java deleted file mode 100644 index c2afaa2414da1853e4500b02c6de9068b64aeafe..0000000000000000000000000000000000000000 --- a/codes/GUIDM1966/15524857.java +++ /dev/null @@ -1,18 +0,0 @@ -/** - * 冒泡排序函数 - * aa bb cc - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - for(int i = 0; i < n-1 ; i++){ - for (int j = 0;j < n-1-i;j++){ - if(a[j] > a[j+1]){ - int temp = a[j]; - a[j] = a[j+1]; - a[j+1] = temp; - } - } - } - -} //end diff --git a/codes/GZofGO/.keep b/codes/GZofGO/.keep deleted file mode 100644 index e69de29bb2d1d6434b8b29ae775ad8c2e48c5391..0000000000000000000000000000000000000000 diff --git a/codes/GZofGO/15846696.java b/codes/GZofGO/15846696.java deleted file mode 100644 index 6e9861fa3ec6d5a2553cdccd1bb1e977430c671b..0000000000000000000000000000000000000000 --- a/codes/GZofGO/15846696.java +++ /dev/null @@ -1,19 +0,0 @@ -/** - * 冒泡排序函数 - * aa bb cc - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - // 你的代码，使无序数组 a 变得有序 - for (int i = 0; i < n - 1; i++) { - for (int j = 0; j < n - i - 1; j++) { - if (a[j] > a[j + 1]) { - - int temp = a[j]; - a[j] = a[j + 1]; - a[j + 1] = temp; - } - } - } -} //end \ No newline at end of file diff --git a/codes/Gesture/11255850.java b/codes/Gesture/11255850.java deleted file mode 100644 index 4d7083fe05ce3e6d3fadd59d6d55e2cbc50d546d..0000000000000000000000000000000000000000 --- a/codes/Gesture/11255850.java +++ /dev/null @@ -1,22 +0,0 @@ -/** - * 冒泡排序函数 - * aa bb cc - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - // 你的代码，使无序数组 a 变得有序 - int i, j; - - for(i=0; ia[j]){ - int temp; - temp = a[j-1]; - a[j-1] = a[j]; - a[j] = temp; - } - } - } - -} //end \ No newline at end of file diff --git a/codes/Ghib66/15510318.java b/codes/Ghib66/15510318.java deleted file mode 100644 index a347a636e0d7dd3b4246030898b4eb7a389aedb6..0000000000000000000000000000000000000000 --- a/codes/Ghib66/15510318.java +++ /dev/null @@ -1,20 +0,0 @@ -/** - * 冒泡排序函数 - * aa bb cc - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - // 你的代码，使无序数组 a 变得有序 - for (int i = 0; i < n - 1; i++) { - // 内层循环控制每一趟排序多少次 - for (int j = 0; j < n - 1 - i; j++) { - if (a[j] > a[j + 1]) { - // 交换两个元素 - int temp = a[j]; - a[j] = a[j + 1]; - a[j + 1] = temp; - } - } - } -} //end diff --git a/codes/GiteeWy1/.keep b/codes/GiteeWy1/.keep deleted file mode 100644 index e69de29bb2d1d6434b8b29ae775ad8c2e48c5391..0000000000000000000000000000000000000000 diff --git a/codes/GiteeWy1/15843556.java b/codes/GiteeWy1/15843556.java deleted file mode 100644 index 6e9861fa3ec6d5a2553cdccd1bb1e977430c671b..0000000000000000000000000000000000000000 --- a/codes/GiteeWy1/15843556.java +++ /dev/null @@ -1,19 +0,0 @@ -/** - * 冒泡排序函数 - * aa bb cc - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - // 你的代码，使无序数组 a 变得有序 - for (int i = 0; i < n - 1; i++) { - for (int j = 0; j < n - i - 1; j++) { - if (a[j] > a[j + 1]) { - - int temp = a[j]; - a[j] = a[j + 1]; - a[j + 1] = temp; - } - } - } -} //end \ No newline at end of file diff --git a/codes/GoStraightOn/14341961.java b/codes/GoStraightOn/14341961.java deleted file mode 100644 index 6115f0ce1ea819bc98cdd13856a7b2619b01db61..0000000000000000000000000000000000000000 --- a/codes/GoStraightOn/14341961.java +++ /dev/null @@ -1,18 +0,0 @@ -/** - * 冒泡排序函数 - * aa bb cc - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - // 你的代码，使无序数组 a 变得有序 - for(int i = 0; i < n - 1; ++i) { - for(int j = 0; j < n - i - 1; ++j){ - if(a[j] > a[j+1]){ - int k = a[j]; - a[j] = a[j+1]; - a[j+1] = k; - } - } - } -} //end diff --git a/codes/Golangu4ge/.keep b/codes/Golangu4ge/.keep deleted file mode 100644 index e69de29bb2d1d6434b8b29ae775ad8c2e48c5391..0000000000000000000000000000000000000000 diff --git a/codes/Golangu4ge/15844492.java b/codes/Golangu4ge/15844492.java deleted file mode 100644 index 6e9861fa3ec6d5a2553cdccd1bb1e977430c671b..0000000000000000000000000000000000000000 --- a/codes/Golangu4ge/15844492.java +++ /dev/null @@ -1,19 +0,0 @@ -/** - * 冒泡排序函数 - * aa bb cc - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - // 你的代码，使无序数组 a 变得有序 - for (int i = 0; i < n - 1; i++) { - for (int j = 0; j < n - i - 1; j++) { - if (a[j] > a[j + 1]) { - - int temp = a[j]; - a[j] = a[j + 1]; - a[j + 1] = temp; - } - } - } -} //end \ No newline at end of file diff --git a/codes/Greeter/11262621.java b/codes/Greeter/11262621.java deleted file mode 100644 index cdabc2e0876ad629e41ff055727cf3af34be8917..0000000000000000000000000000000000000000 --- a/codes/Greeter/11262621.java +++ /dev/null @@ -1,20 +0,0 @@ -/** - * 冒泡排序函数 - * aa bb cc - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - // 你的代码，使无序数组 a 变得有序 - for (int i = 0; i < n; i++) { - for (int j = i + 1; j < n; j++) { - if (a[i] > a[j]) { - int temp = a[j]; - a[j] = a[i]; - a[i] = temp; - - } - } - } - -} //end \ No newline at end of file diff --git a/codes/Guna777/15714682.java b/codes/Guna777/15714682.java deleted file mode 100644 index 7ba11c491b7e3e78e934dce29820c01e071d926a..0000000000000000000000000000000000000000 --- a/codes/Guna777/15714682.java +++ /dev/null @@ -1,21 +0,0 @@ -/** - * 冒泡排序函数 - * 通过相邻元素两两比较和交换，将较大的元素逐渐“浮”到数组的末尾，从而完成排序 - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int[] a, int n) { - // 外层循环，表示所有未排序部分的趟数 - for (int i = 0; i < n - 1; i++) { - // 内层循环，负责将当前未排序部分的最大值“浮”到末尾 - for (int j = 0; j < n - 1 - i; j++) { - // 如果前一个元素比后一个元素大，则交换它们的位置 - if (a[j] > a[j + 1]) { - int temp = a[j]; - a[j] = a[j + 1]; - a[j + 1] = temp; - } - } - } - // 当外层循环和内层循环都执行完毕后，数组a已变为有序 -} //end diff --git a/codes/H17630975837/15780333.java b/codes/H17630975837/15780333.java deleted file mode 100644 index 9e3572b1aa27c47f945bd725fba05ddbd6882fd8..0000000000000000000000000000000000000000 --- a/codes/H17630975837/15780333.java +++ /dev/null @@ -1,26 +0,0 @@ -/** - * 冒泡排序函数 - * 通过相邻元素之间的比较和交换，将最大的元素“冒泡”到数组的末尾 - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - for (int i = 0; i < n - 1; i++) { - // 标志位，表示这一趟排序是否有数据交换 - boolean swapped = false; - for (int j = 0; j < n - i - 1; j++) { - // 如果当前元素大于下一个元素，则交换它们的位置 - if (a[j] > a[j + 1]) { - int temp = a[j]; - a[j] = a[j + 1]; - a[j + 1] = temp; - // 发生了交换，将标志位设为true - swapped = true; - } - } - // 如果这一趟没有发生交换，说明数组已经有序，可以提前结束排序 - if (!swapped) { - break; - } - } -} //end diff --git a/codes/H17695838659/15775857.java b/codes/H17695838659/15775857.java deleted file mode 100644 index 949cc5cba59c790741e3671cd858e9368bfd96fe..0000000000000000000000000000000000000000 --- a/codes/H17695838659/15775857.java +++ /dev/null @@ -1,18 +0,0 @@ -/** - * 冒泡排序函数 - * 使用冒泡排序算法对数组进行升序排序 - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int[] a, int n) { - for (int i = 0; i < n - 1; i++) { - for (int j = 0; j < n - i - 1; j++) { - // 如果前一个元素大于后一个元素，则交换它们的位置 - if (a[j] > a[j + 1]) { - int temp = a[j]; - a[j] = a[j + 1]; - a[j + 1] = temp; - } - } - } -} //end diff --git a/codes/HCTema/.keep b/codes/HCTema/.keep deleted file mode 100644 index e69de29bb2d1d6434b8b29ae775ad8c2e48c5391..0000000000000000000000000000000000000000 diff --git a/codes/HCTema/15846117.java b/codes/HCTema/15846117.java deleted file mode 100644 index 6e9861fa3ec6d5a2553cdccd1bb1e977430c671b..0000000000000000000000000000000000000000 --- a/codes/HCTema/15846117.java +++ /dev/null @@ -1,19 +0,0 @@ -/** - * 冒泡排序函数 - * aa bb cc - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - // 你的代码，使无序数组 a 变得有序 - for (int i = 0; i < n - 1; i++) { - for (int j = 0; j < n - i - 1; j++) { - if (a[j] > a[j + 1]) { - - int temp = a[j]; - a[j] = a[j + 1]; - a[j + 1] = temp; - } - } - } -} //end \ No newline at end of file diff --git a/codes/HMqusi/11299684.java b/codes/HMqusi/11299684.java deleted file mode 100644 index 1c8889947f924214c71a3c3f202500b4780dc281..0000000000000000000000000000000000000000 --- a/codes/HMqusi/11299684.java +++ /dev/null @@ -1,11 +0,0 @@ -public static void bubbleSort(int [] a,int n){ - for(int i = 0; i < n-1 ; i++){ - for (int j = 0;j < n-1-i;j++){ - if(a[j] > a[j+1]){ - int temp = a[j]; - a[j] = a[j+1]; - a[j+1] = temp; - } - } - } -} \ No newline at end of file diff --git a/codes/HUmui0101/11027238.java b/codes/HUmui0101/11027238.java deleted file mode 100644 index 8c505501c812f686a9abe78a0d1191db6085134c..0000000000000000000000000000000000000000 --- a/codes/HUmui0101/11027238.java +++ /dev/null @@ -1,19 +0,0 @@ -/** - * 冒泡排序函数 - * aa bb cc - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - // 你的代码，使无序数组 a 变得有序 - for(int i=0;i a[j+1]){ - int temp = a[j]; - a[j] = a[j+1]; - a[j+1] = temp; - } - } - } - -} //end \ No newline at end of file diff --git a/codes/Haichan/15780779.java b/codes/Haichan/15780779.java deleted file mode 100644 index 8b62be3e5bd311258e32c651c65f293fe0c50223..0000000000000000000000000000000000000000 --- a/codes/Haichan/15780779.java +++ /dev/null @@ -1,18 +0,0 @@ -/** - * 冒泡排序函数 - * 将数组 a 中的元素按照升序排列 - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - for (int i = 0; i < n - 1; i++) { - for (int j = 0; j < n - i - 1; j++) { - if (a[j] > a[j + 1]) { - // 交换 a[j] 和 a[j + 1] - int temp = a[j]; - a[j] = a[j + 1]; - a[j + 1] = temp; - } - } - } -} //end diff --git a/codes/HandsomeSean/11463861.java b/codes/HandsomeSean/11463861.java deleted file mode 100644 index cdabc2e0876ad629e41ff055727cf3af34be8917..0000000000000000000000000000000000000000 --- a/codes/HandsomeSean/11463861.java +++ /dev/null @@ -1,20 +0,0 @@ -/** - * 冒泡排序函数 - * aa bb cc - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - // 你的代码，使无序数组 a 变得有序 - for (int i = 0; i < n; i++) { - for (int j = i + 1; j < n; j++) { - if (a[i] > a[j]) { - int temp = a[j]; - a[j] = a[i]; - a[i] = temp; - - } - } - } - -} //end \ No newline at end of file diff --git a/codes/HappyJess/16199150.java b/codes/HappyJess/16199150.java deleted file mode 100644 index 0374d9db10d7d6358dd3b7f13264f098f0d61e65..0000000000000000000000000000000000000000 --- a/codes/HappyJess/16199150.java +++ /dev/null @@ -1,19 +0,0 @@ -/** - * 冒泡排序函数 - * aa bb cc - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - for (int i = 0; i < n - 1; i++) { - for (int j = 0; j < n - i - 1; j++) { - if (a[j] > a[j + 1]) { - // 交换 a[j] 和 a[j+1] - int temp = a[j]; - a[j] = a[j + 1]; - a[j + 1] = temp; - } - } - } - -} diff --git a/codes/HappyJess/16200488.java b/codes/HappyJess/16200488.java deleted file mode 100644 index f5b52e93498071c1293fb08000a661c685308a0e..0000000000000000000000000000000000000000 --- a/codes/HappyJess/16200488.java +++ /dev/null @@ -1,19 +0,0 @@ -/** - * 冒泡排序函数 - * aa bb cc - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int[] a, int n) { - for (int i = 0; i < n - 1; i++) { - for (int j = 0; j < n - i - 1; j++) { - if (a[j] > a[j + 1]) { - // 交换 a[j] 和 a[j+1] - int temp = a[j]; - a[j] = a[j + 1]; - a[j + 1] = temp; - } - } - } -} - diff --git a/codes/HappyJess/16200532.java b/codes/HappyJess/16200532.java deleted file mode 100644 index f5b52e93498071c1293fb08000a661c685308a0e..0000000000000000000000000000000000000000 --- a/codes/HappyJess/16200532.java +++ /dev/null @@ -1,19 +0,0 @@ -/** - * 冒泡排序函数 - * aa bb cc - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int[] a, int n) { - for (int i = 0; i < n - 1; i++) { - for (int j = 0; j < n - i - 1; j++) { - if (a[j] > a[j + 1]) { - // 交换 a[j] 和 a[j+1] - int temp = a[j]; - a[j] = a[j + 1]; - a[j + 1] = temp; - } - } - } -} - diff --git a/codes/HeRuo123/15520250.java b/codes/HeRuo123/15520250.java deleted file mode 100644 index 1f0c75d37de508002cfe9323af47f87cc3264e88..0000000000000000000000000000000000000000 --- a/codes/HeRuo123/15520250.java +++ /dev/null @@ -1,21 +0,0 @@ -/** - * 冒泡排序函数 - * - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int[] a, int n) { - // 外层循环控制排序的轮数 - for (int i = 0; i < n - 1; i++) { - // 内层循环控制每一轮排序中相邻元素的比较和交换 - for (int j = 0; j < n - 1 - i; j++) { - if (a[j] > a[j + 1]) { - // 如果前一个元素大于后一个元素，则交换它们的位置 - int temp = a[j]; - a[j] = a[j + 1]; - a[j + 1] = temp; - } - } - } -} - diff --git a/codes/HelloWorld1/11257582.java b/codes/HelloWorld1/11257582.java deleted file mode 100644 index 272a12fc81d3dd0e857bba9ae001c15818fb7123..0000000000000000000000000000000000000000 --- a/codes/HelloWorld1/11257582.java +++ /dev/null @@ -1,18 +0,0 @@ - /** - * 冒泡排序函数 - * aa bb cc - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ - public static void bubbleSort(int [] arr, int n){ - // 你的代码，使无序数组 a 变得有序 - for (int i = 0; i < n; i++) { - for (int j = (i + 1); j < n; j++) { - if (arr[i] > arr[j]) { - int temp = arr[i]; - arr[i] = arr[j]; - arr[j] = temp; - } - } - } - } //end \ No newline at end of file diff --git a/codes/Henriette/11038762.java b/codes/Henriette/11038762.java deleted file mode 100644 index efb824a489dc8b727f3bfc156b5793c17767c02d..0000000000000000000000000000000000000000 --- a/codes/Henriette/11038762.java +++ /dev/null @@ -1,19 +0,0 @@ -/** - * 冒泡排序函数 - * aa bb cc - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - // 你的代码，使无序数组 a 变得有序 - for (int i=0;ia[j+1]) { - tmp = a[j+1]; - a[j+1] = a[j]; - a[j] = tmp; - } - } - } -} //end \ No newline at end of file diff --git a/codes/Hksr223/15534956.java b/codes/Hksr223/15534956.java deleted file mode 100644 index c2afaa2414da1853e4500b02c6de9068b64aeafe..0000000000000000000000000000000000000000 --- a/codes/Hksr223/15534956.java +++ /dev/null @@ -1,18 +0,0 @@ -/** - * 冒泡排序函数 - * aa bb cc - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - for(int i = 0; i < n-1 ; i++){ - for (int j = 0;j < n-1-i;j++){ - if(a[j] > a[j+1]){ - int temp = a[j]; - a[j] = a[j+1]; - a[j+1] = temp; - } - } - } - -} //end diff --git a/codes/HotSpringEye/11446072.java b/codes/HotSpringEye/11446072.java deleted file mode 100644 index 17fde96e95e5f036bffb1d3aa82fcac932734a29..0000000000000000000000000000000000000000 --- a/codes/HotSpringEye/11446072.java +++ /dev/null @@ -1,19 +0,0 @@ - /** - * 冒泡排序函数 - * aa bb cc - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - // 你的代码，使无序数组 a 变得有序 - for(int i = 0; i < n; i++) { - for(int j = 0; j < n-1; j++) { - if(a[j] > a[j+1]){ - int tmp = 0; - tmp = a[j]; - a[j] = a[j+1]; - a[j+1] = tmp; - } - } - } -} //end diff --git a/codes/HsuehBo/18504702.java b/codes/HsuehBo/18504702.java deleted file mode 100644 index db7e56d790da8d1b8e1abb8b323f8d7f2b8a81c1..0000000000000000000000000000000000000000 --- a/codes/HsuehBo/18504702.java +++ /dev/null @@ -1,20 +0,0 @@ -/** - * 冒泡排序函数 - * aa bb cc - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - // 你的代码，使无序数组 a 变得有序 - int tmp = 0; - for (int i = 0; i < n - 1; i++) { - for (int j = 0; j < n - 1 - i; j++) { - if (a[j] > a[j + 1]) { - tmp = a[j]; - a[j] = a[j + 1]; - a[j + 1] = tmp; - } - } - } -} //end - diff --git a/codes/HunterHans/12287484.java b/codes/HunterHans/12287484.java deleted file mode 100644 index ab3d8f390cfa4cee1947d39872e75bac48b3058a..0000000000000000000000000000000000000000 --- a/codes/HunterHans/12287484.java +++ /dev/null @@ -1,11 +0,0 @@ -public static void bubbleSort(int [] a, int n) { - for (int i=0 ; ia[j+1]) { - int temp=a[j]; - a[j]=a[j+1]; - a[j+1]=temp; - } - } - } -} diff --git a/codes/Hybridsky/.keep b/codes/Hybridsky/.keep deleted file mode 100644 index e69de29bb2d1d6434b8b29ae775ad8c2e48c5391..0000000000000000000000000000000000000000 diff --git a/codes/Hybridsky/15775385.java b/codes/Hybridsky/15775385.java deleted file mode 100644 index 1c8889947f924214c71a3c3f202500b4780dc281..0000000000000000000000000000000000000000 --- a/codes/Hybridsky/15775385.java +++ /dev/null @@ -1,11 +0,0 @@ -public static void bubbleSort(int [] a,int n){ - for(int i = 0; i < n-1 ; i++){ - for (int j = 0;j < n-1-i;j++){ - if(a[j] > a[j+1]){ - int temp = a[j]; - a[j] = a[j+1]; - a[j+1] = temp; - } - } - } -} \ No newline at end of file diff --git a/codes/IM12138/11469383.java b/codes/IM12138/11469383.java deleted file mode 100644 index 8c505501c812f686a9abe78a0d1191db6085134c..0000000000000000000000000000000000000000 --- a/codes/IM12138/11469383.java +++ /dev/null @@ -1,19 +0,0 @@ -/** - * 冒泡排序函数 - * aa bb cc - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - // 你的代码，使无序数组 a 变得有序 - for(int i=0;i a[j+1]){ - int temp = a[j]; - a[j] = a[j+1]; - a[j+1] = temp; - } - } - } - -} //end \ No newline at end of file diff --git a/codes/IXHE2004/15639769.java b/codes/IXHE2004/15639769.java deleted file mode 100644 index 92fad2772ec71c37138adb4f351dd2ff2abf77f7..0000000000000000000000000000000000000000 --- a/codes/IXHE2004/15639769.java +++ /dev/null @@ -1,25 +0,0 @@ -/** - * 冒泡排序函数 - * aa bb cc - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - // 你的代码，使无序数组 a 变得有序 - for(int i = 0; i < n - 1; i++){ - boolean swapped = false; - for(int j = 0; j < n - i - 1; j++){ - if(a[j] > a[j+1]){ - int temp = a[j]; - a[j] = a[j+1]; - a[j+1] = temp; - swapped = true; - } - } - if(!swapped){ - break; - } - } - - -} //end diff --git a/codes/Iboydoss/11210866.java b/codes/Iboydoss/11210866.java deleted file mode 100644 index cdabc2e0876ad629e41ff055727cf3af34be8917..0000000000000000000000000000000000000000 --- a/codes/Iboydoss/11210866.java +++ /dev/null @@ -1,20 +0,0 @@ -/** - * 冒泡排序函数 - * aa bb cc - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - // 你的代码，使无序数组 a 变得有序 - for (int i = 0; i < n; i++) { - for (int j = i + 1; j < n; j++) { - if (a[i] > a[j]) { - int temp = a[j]; - a[j] = a[i]; - a[i] = temp; - - } - } - } - -} //end \ No newline at end of file diff --git a/codes/IoTanw/11135258.java b/codes/IoTanw/11135258.java deleted file mode 100644 index 9e7534d4b41cf071c848fa4d5c08c6519526b6e3..0000000000000000000000000000000000000000 --- a/codes/IoTanw/11135258.java +++ /dev/null @@ -1,18 +0,0 @@ -/** - * 冒泡 排序 函数 - * aa bb cc - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - // 你的代码，使无序数组 a 变得有序 - for (int i = 0; i < n; i++) { - for (int j = 0; j < i; j++) { - if (a[i] < a[j]) { - int t = a[i]; - a[i] = a[j]; - a[j] = t; - } - } - } -}//end \ No newline at end of file diff --git a/codes/JJ18809227089/15752040.java b/codes/JJ18809227089/15752040.java deleted file mode 100644 index 818e91524d6786d8c2e0dac24368b79d3395558c..0000000000000000000000000000000000000000 --- a/codes/JJ18809227089/15752040.java +++ /dev/null @@ -1,18 +0,0 @@ -/** - * 冒泡排序函数 - * 实现冒泡排序算法对数组进行升序排序 - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - for (int i = 0; i < n - 1; i++) { - for (int j = 0; j < n - i - 1; j++) { - if (a[j] > a[j + 1]) { - // 交换元素 - int temp = a[j]; - a[j] = a[j + 1]; - a[j + 1] = temp; - } - } - } -} //end diff --git a/codes/JackieYe/15543330.java b/codes/JackieYe/15543330.java deleted file mode 100644 index 4cb5df82ea987d9fa35001f4e783a0dc005030df..0000000000000000000000000000000000000000 --- a/codes/JackieYe/15543330.java +++ /dev/null @@ -1,18 +0,0 @@ -/** - * 冒泡排序函数 - * 对数组进行升序排序 - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - for (int i = 0; i < n - 1; i++) { - for (int j = 0; j < n - 1 - i; j++) { - // 如果当前元素大于下一个元素，则交换它们的位置 - if (a[j] > a[j + 1]) { - int temp = a[j]; - a[j] = a[j + 1]; - a[j + 1] = temp; - } - } - } -} //end diff --git a/codes/Jang10/15536247.java b/codes/Jang10/15536247.java deleted file mode 100644 index c2afaa2414da1853e4500b02c6de9068b64aeafe..0000000000000000000000000000000000000000 --- a/codes/Jang10/15536247.java +++ /dev/null @@ -1,18 +0,0 @@ -/** - * 冒泡排序函数 - * aa bb cc - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - for(int i = 0; i < n-1 ; i++){ - for (int j = 0;j < n-1-i;j++){ - if(a[j] > a[j+1]){ - int temp = a[j]; - a[j] = a[j+1]; - a[j+1] = temp; - } - } - } - -} //end diff --git a/codes/January/.keep b/codes/January/.keep deleted file mode 100644 index e69de29bb2d1d6434b8b29ae775ad8c2e48c5391..0000000000000000000000000000000000000000 diff --git a/codes/January/11070767.java b/codes/January/11070767.java deleted file mode 100644 index 2bc93cadc50baaddb1c4cb8426d848cafbe04c0d..0000000000000000000000000000000000000000 --- a/codes/January/11070767.java +++ /dev/null @@ -1,18 +0,0 @@ -/** - * 冒泡排序函数 - * aa bb cc - * - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int[]a,int n){ - for (int i = 0; i < n-1; i++) { - for (int j = i+1; j < n; j++) { - if (a[i] > a[j]) { - int temp = a[i]; - a[i] = a[j]; - a[j] = temp; - } - } - } -} //end \ No newline at end of file diff --git a/codes/JasenChao/13984025.java b/codes/JasenChao/13984025.java deleted file mode 100644 index 8b3ae08584db3b5f717703183280ee686b85e555..0000000000000000000000000000000000000000 --- a/codes/JasenChao/13984025.java +++ /dev/null @@ -1,17 +0,0 @@ -/** - * 冒泡排序函数 - * aa bb cc - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - for (int i = 0; i < n - 1; i++) { - for (int j = 0; j < n - 1 - i; j++) { - if (a[j] > a[j + 1]) { - int t = a[j]; - a[j] = a[j + 1]; - a[j + 1] = t; - } - } - } -} //end diff --git a/codes/Jasonakeke/15520912.java b/codes/Jasonakeke/15520912.java deleted file mode 100644 index 9167756b83f8756b4e75585ce4edbb8589e589bb..0000000000000000000000000000000000000000 --- a/codes/Jasonakeke/15520912.java +++ /dev/null @@ -1,18 +0,0 @@ -/** - * 冒泡排序函数 - * 通过相邻元素比较和交换，使得每一轮迭代后最大（或最小）的元素被移动到数组的末尾。 - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - for (int i = 0; i < n - 1; i++) { - for (int j = 0; j < n - i - 1; j++) { - // 如果前一个元素大于后一个元素，则交换它们的位置 - if (a[j] > a[j + 1]) { - int temp = a[j]; - a[j] = a[j + 1]; - a[j + 1] = temp; - } - } - } -} //end diff --git a/codes/Jgf3096619665/15774713.java b/codes/Jgf3096619665/15774713.java deleted file mode 100644 index 1cabf6d136484b1313d87727d7689c90ecbfaff3..0000000000000000000000000000000000000000 --- a/codes/Jgf3096619665/15774713.java +++ /dev/null @@ -1,18 +0,0 @@ -/** - * 冒泡排序函数 - * 通过相邻元素两两比较和交换，使得每一轮循环后最大（或最小）的元素能够“冒泡”到数组的末尾 - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int[] a, int n) { - for (int i = 0; i < n - 1; i++) { // 外层循环控制需要排序的趟数 - for (int j = 0; j < n - 1 - i; j++) { // 内层循环控制每趟排序的过程 - // 如果前一个元素大于后一个元素，则交换它们的位置 - if (a[j] > a[j + 1]) { - int temp = a[j]; - a[j] = a[j + 1]; - a[j + 1] = temp; - } - } - } -} // end diff --git a/codes/Jingyu/11302198.java b/codes/Jingyu/11302198.java deleted file mode 100644 index cacd12f1e4e4360dd1ffa22f3741e376110bcde4..0000000000000000000000000000000000000000 --- a/codes/Jingyu/11302198.java +++ /dev/null @@ -1,18 +0,0 @@ -/** - * 冒泡排序函数 - * aa bb cc - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - // 你的代码，使无序数组 a 变得有序 - for(int i=0;ia[j+1]){ - a[j] = a[j]+a[j+1]; - a[j+1] = a[j]-a[j+1]; - a[j] = a[j]-a[j+1]; - } - } - } -} //end \ No newline at end of file diff --git a/codes/Jinzj_828/15842649.java b/codes/Jinzj_828/15842649.java deleted file mode 100644 index 8e911f6b33de07fb78d225f3cf4ba136d7f8e45e..0000000000000000000000000000000000000000 --- a/codes/Jinzj_828/15842649.java +++ /dev/null @@ -1,18 +0,0 @@ -/** - * 冒泡排序函数 - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int[] a, int n) { - for (int i = 0; i < n - 1; i++) { - for (int j = 0; j < n - 1 - i; j++) { - if (a[j] > a[j + 1]) { - // 交换位置 - int temp = a[j]; - a[j] = a[j + 1]; - a[j + 1] = temp; - } - } - } -} //end - diff --git a/codes/Juliani/11207255.java b/codes/Juliani/11207255.java deleted file mode 100644 index 272a12fc81d3dd0e857bba9ae001c15818fb7123..0000000000000000000000000000000000000000 --- a/codes/Juliani/11207255.java +++ /dev/null @@ -1,18 +0,0 @@ - /** - * 冒泡排序函数 - * aa bb cc - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ - public static void bubbleSort(int [] arr, int n){ - // 你的代码，使无序数组 a 变得有序 - for (int i = 0; i < n; i++) { - for (int j = (i + 1); j < n; j++) { - if (arr[i] > arr[j]) { - int temp = arr[i]; - arr[i] = arr[j]; - arr[j] = temp; - } - } - } - } //end \ No newline at end of file diff --git a/codes/K18475329871/15592083.java b/codes/K18475329871/15592083.java deleted file mode 100644 index c2afaa2414da1853e4500b02c6de9068b64aeafe..0000000000000000000000000000000000000000 --- a/codes/K18475329871/15592083.java +++ /dev/null @@ -1,18 +0,0 @@ -/** - * 冒泡排序函数 - * aa bb cc - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - for(int i = 0; i < n-1 ; i++){ - for (int j = 0;j < n-1-i;j++){ - if(a[j] > a[j+1]){ - int temp = a[j]; - a[j] = a[j+1]; - a[j+1] = temp; - } - } - } - -} //end diff --git a/codes/KEQI73205/.keep b/codes/KEQI73205/.keep deleted file mode 100644 index e69de29bb2d1d6434b8b29ae775ad8c2e48c5391..0000000000000000000000000000000000000000 diff --git a/codes/KEQI73205/15778430.java b/codes/KEQI73205/15778430.java deleted file mode 100644 index 83497d9a50b2195c0f83f28598452b59573c98ad..0000000000000000000000000000000000000000 --- a/codes/KEQI73205/15778430.java +++ /dev/null @@ -1,18 +0,0 @@ -/** - * 冒泡 排序 函数 - * aa bb cc - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - // 你的代码，使无序数组 a 变得有序 - for (int i = 0; i < n; i++) { - for (int j = 0; j < i; j++) { - if (a[i] < a[j]) { - int t = a[i]; - a[i] = a[j]; - a[j] = t; - } - } - } -}//end \ No newline at end of file diff --git a/codes/Kang12138/15653043.java b/codes/Kang12138/15653043.java deleted file mode 100644 index 45f0745ac6230b9ee65fd1fc81955aaafb291621..0000000000000000000000000000000000000000 --- a/codes/Kang12138/15653043.java +++ /dev/null @@ -1,23 +0,0 @@ -/** - * 冒泡排序函数 - * aa bb cc - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int[] a, int n) { - // 外层循环，遍历所有的数 - for (int i = 0; i < n - 1; i++) { - // 内层循环，进行当前轮的比较和交换 - for (int j = 0; j < n - 1 - i; j++) { - // 如果当前数比下一个数大，交换它们 - if (a[j] > a[j + 1]) { - // 交换 a[j] 和 a[j+1] - int temp = a[j]; - a[j] = a[j + 1]; - a[j + 1] = temp; - } - } - } -} //end - - diff --git a/codes/Keeper/15775425.java b/codes/Keeper/15775425.java deleted file mode 100644 index 2d3a53010266ae21b2b24a242d9fa40c6d471c68..0000000000000000000000000000000000000000 --- a/codes/Keeper/15775425.java +++ /dev/null @@ -1,15 +0,0 @@ -public static void bubbleSort(int[] a,int n) -{ - for(int i=0;ia[j+1]) - { - int temp=a[j]; - a[j]=a[j+1]; - a[j+1]=temp; - } - } - } -} diff --git a/codes/KijD_wyp/15647839.java b/codes/KijD_wyp/15647839.java deleted file mode 100644 index 5403354dc82f171186f125d43576ddd280c9a37a..0000000000000000000000000000000000000000 --- a/codes/KijD_wyp/15647839.java +++ /dev/null @@ -1,21 +0,0 @@ -/** - * 冒泡排序函数 - * 功能：对数组进行升序排序 - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int[] a, int n) { - // 外层循环控制比较的次数 - for (int i = 0; i < n - 1; i++) { - // 内层循环负责具体的比较和交换 - for (int j = 0; j < n - 1 - i; j++) { - // 如果当前元素大于下一个元素，则交换它们的位置 - if (a[j] > a[j + 1]) { - // 交换 a[j] 和 a[j+1] - int temp = a[j]; - a[j] = a[j + 1]; - a[j + 1] = temp; - } - } - } -} // end diff --git a/codes/Kio1262902996/11044068.java b/codes/Kio1262902996/11044068.java deleted file mode 100644 index 4d7083fe05ce3e6d3fadd59d6d55e2cbc50d546d..0000000000000000000000000000000000000000 --- a/codes/Kio1262902996/11044068.java +++ /dev/null @@ -1,22 +0,0 @@ -/** - * 冒泡排序函数 - * aa bb cc - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - // 你的代码，使无序数组 a 变得有序 - int i, j; - - for(i=0; ia[j]){ - int temp; - temp = a[j-1]; - a[j-1] = a[j]; - a[j] = temp; - } - } - } - -} //end \ No newline at end of file diff --git a/codes/Kristen/11804698.java b/codes/Kristen/11804698.java deleted file mode 100644 index fcd1392a4e24c037551bc75309c7d023ecd2e22f..0000000000000000000000000000000000000000 --- a/codes/Kristen/11804698.java +++ /dev/null @@ -1,18 +0,0 @@ -/** - * 冒泡排序函数 - * aa bb cc - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - // 你的代码，使无序数组 a 变得有序 - for(int i = 0; i a[j + 1]) { - // 交换元素 - int temp = a[j]; - a[j] = a[j + 1]; - a[j + 1] = temp; - } - } - } -} //end diff --git a/codes/L13225391057/15834676.java b/codes/L13225391057/15834676.java deleted file mode 100644 index d0e7038df81a1dcd40ba57e5267839caad594f03..0000000000000000000000000000000000000000 --- a/codes/L13225391057/15834676.java +++ /dev/null @@ -1,19 +0,0 @@ -/** - * 冒泡排序函数 - * 冒泡排序是一种简单的排序算法，它重复地遍历要排序的数列，一次比较两个元素，如果他们的顺序错误就把他们交换过来。 - * 遍历数列的工作是重复地进行直到没有再需要交换，也就是说该数列已经排序完成。 - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - for (int i = 0; i < n - 1; i++) { // 外层循环控制比较的次数 - for (int j = 0; j < n - 1 - i; j++) { // 内层循环控制每一轮比较的次数 - // 如果前一个元素比后一个元素大，则交换它们的位置 - if (a[j] > a[j + 1]) { - int temp = a[j]; - a[j] = a[j + 1]; - a[j + 1] = temp; - } - } - } -} //end diff --git a/codes/L21362757/15899070.java b/codes/L21362757/15899070.java deleted file mode 100644 index 11828f51477fb09430c4876d88ede22dbb8b95d7..0000000000000000000000000000000000000000 --- a/codes/L21362757/15899070.java +++ /dev/null @@ -1,11 +0,0 @@ -public static void bubbleSort(int []a,int n){ - for(int i=0;ia[j+1]){ - int temp=a[j]; - a[j]=a[j+1]; - a[j+1]=temp; - } - } - } -} diff --git a/codes/LIJIAN-yuzhong/16982842.java b/codes/LIJIAN-yuzhong/16982842.java deleted file mode 100644 index 8d011368582c218abba5497eabff76cc9efc2330..0000000000000000000000000000000000000000 --- a/codes/LIJIAN-yuzhong/16982842.java +++ /dev/null @@ -1,19 +0,0 @@ -/** - * 冒泡排序函数 - * aa bb cc - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - - for (int i = 0; i < n - 1; i++) { - for (int j = 0; j < n - i - 1; j++) { - if (a[j] > a[j + 1]) { - // 交换 a[j] 和 a[j + 1] - int temp = a[j]; - a[j] = a[j + 1]; - a[j + 1] = temp; - } - } - } -} //end diff --git a/codes/LJX0857/.keep b/codes/LJX0857/.keep deleted file mode 100644 index e69de29bb2d1d6434b8b29ae775ad8c2e48c5391..0000000000000000000000000000000000000000 diff --git a/codes/LJX0857/10042274.java b/codes/LJX0857/10042274.java deleted file mode 100644 index 667eee0f585ec38ce639cb36d80df080e935946d..0000000000000000000000000000000000000000 --- a/codes/LJX0857/10042274.java +++ /dev/null @@ -1,11 +0,0 @@ -public static void bubbleSort(int [] a,int n){ - for(int i = 0; i < n-1 ; i++){ - for (int j = 0;j < n-1-i;j++){ - if(a[j] > a[j+1]){ - int temp = a[j]; - a[j] = a[j+1]; - a[j+1] = temp; - } - } - } -} \ No newline at end of file diff --git a/codes/LS2698853114/15540958.java b/codes/LS2698853114/15540958.java deleted file mode 100644 index a7e15843a04a39100dcec79c259a955307b2a501..0000000000000000000000000000000000000000 --- a/codes/LS2698853114/15540958.java +++ /dev/null @@ -1,26 +0,0 @@ -/** - * 冒泡排序函数 - * 功能：对输入的整数数组进行冒泡排序 - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int[] a, int n) { - for (int i = 0; i < n - 1; i++) { - // 标志位，表示这一趟是否有交换 - boolean swapped = false; - for (int j = 0; j < n - i - 1; j++) { - // 如果当前元素大于下一个元素，则交换它们的位置 - if (a[j] > a[j + 1]) { - int temp = a[j]; - a[j] = a[j + 1]; - a[j + 1] = temp; - // 发生了交换，将标志位设为true - swapped = true; - } - } - // 如果在内层循环中没有发生交换，说明数组已经有序，可以退出排序 - if (!swapped) { - break; - } - } -} // end diff --git a/codes/LX2745347279/16198492.java b/codes/LX2745347279/16198492.java deleted file mode 100644 index 2bc7742926886c3c1d4576d0a32ac19e77855e68..0000000000000000000000000000000000000000 --- a/codes/LX2745347279/16198492.java +++ /dev/null @@ -1,20 +0,0 @@ -/** - * 冒泡排序函数 - * aa bb cc - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - // 你的代码，使无序数组 a 变得有序 - for(int i = 0; i < n - 1; i++) { - for(int j = 0; j < n - 1 - i; j++) { - // 如果当前元素大于下一个元素，则交换它们 - if(a[j] > a[j + 1]) { - int temp = a[j]; - a[j] = a[j + 1]; - a[j + 1] = temp; - } - } - } - -} //end diff --git a/codes/Laodeng/15839462.java b/codes/Laodeng/15839462.java deleted file mode 100644 index f5d92931d8907d8266d7626d31d412a3e2f1085a..0000000000000000000000000000000000000000 --- a/codes/Laodeng/15839462.java +++ /dev/null @@ -1,22 +0,0 @@ -/** - * 冒泡排序函数 - * 通过重复遍历待排序的数组，比较每对相邻的元素，如果它们的顺序错误就把它们交换过来， - * 遍历数组的工作是重复地进行直到没有再需要交换，也就是说该数组已经排序完成。 - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int[] a, int n) { - // 遍历所有数组元素 - for (int i = 0; i < n - 1; i++) { - // Last i elements are already in place - for (int j = 0; j < n - i - 1; j++) { - // 遍历数组从0到n-i-1，交换如果元素找到比下一个元素大 - if (a[j] > a[j + 1]) { - // 交换 a[j] 和 a[j+1] - int temp = a[j]; - a[j] = a[j + 1]; - a[j + 1] = temp; - } - } - } -} // end diff --git a/codes/LatiaoPro/11352722.java b/codes/LatiaoPro/11352722.java deleted file mode 100644 index 8c505501c812f686a9abe78a0d1191db6085134c..0000000000000000000000000000000000000000 --- a/codes/LatiaoPro/11352722.java +++ /dev/null @@ -1,19 +0,0 @@ -/** - * 冒泡排序函数 - * aa bb cc - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - // 你的代码，使无序数组 a 变得有序 - for(int i=0;i a[j+1]){ - int temp = a[j]; - a[j] = a[j+1]; - a[j+1] = temp; - } - } - } - -} //end \ No newline at end of file diff --git a/codes/LightLeaf/14443538.java b/codes/LightLeaf/14443538.java deleted file mode 100644 index 926b81024fd86b5e4f59fe93b0b5e8e8e9536b3d..0000000000000000000000000000000000000000 --- a/codes/LightLeaf/14443538.java +++ /dev/null @@ -1,20 +0,0 @@ -/** - * 冒泡排序函数 - * aa bb cc - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - int i=0; - int temp; - while(ia[j+1]){ - temp=a[j]; - a[j]=a[j+1]; - a[j+1]=temp; - } - } - i++; - } -} //end diff --git a/codes/Likui123/.keep b/codes/Likui123/.keep deleted file mode 100644 index e69de29bb2d1d6434b8b29ae775ad8c2e48c5391..0000000000000000000000000000000000000000 diff --git a/codes/Likui123/15713905.java b/codes/Likui123/15713905.java deleted file mode 100644 index 6426772fb479b07ed3be21ef1867921d1dbb194c..0000000000000000000000000000000000000000 --- a/codes/Likui123/15713905.java +++ /dev/null @@ -1,20 +0,0 @@ -/** - * 冒泡排序函数 - * aa bb cc - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - // 你的代码，使无序数组 a 变得有序 - for(int i = 0; i < n; i++) { - for(int j = 0; j < n - i - 1; j++) { - if(a[j] > a[j + 1]) { - int temp = a[j]; - a [j] = a[j + 1]; - a[j + 1] = temp; - } - } - } - - -} //end \ No newline at end of file diff --git a/codes/Lishen/.keep b/codes/Lishen/.keep deleted file mode 100644 index e69de29bb2d1d6434b8b29ae775ad8c2e48c5391..0000000000000000000000000000000000000000 diff --git a/codes/Lishen/15630879.java b/codes/Lishen/15630879.java deleted file mode 100644 index 6426772fb479b07ed3be21ef1867921d1dbb194c..0000000000000000000000000000000000000000 --- a/codes/Lishen/15630879.java +++ /dev/null @@ -1,20 +0,0 @@ -/** - * 冒泡排序函数 - * aa bb cc - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - // 你的代码，使无序数组 a 变得有序 - for(int i = 0; i < n; i++) { - for(int j = 0; j < n - i - 1; j++) { - if(a[j] > a[j + 1]) { - int temp = a[j]; - a [j] = a[j + 1]; - a[j + 1] = temp; - } - } - } - - -} //end \ No newline at end of file diff --git a/codes/LongXiTWT/.keep b/codes/LongXiTWT/.keep deleted file mode 100644 index e69de29bb2d1d6434b8b29ae775ad8c2e48c5391..0000000000000000000000000000000000000000 diff --git a/codes/LongXiTWT/15840763.java b/codes/LongXiTWT/15840763.java deleted file mode 100644 index 6e9861fa3ec6d5a2553cdccd1bb1e977430c671b..0000000000000000000000000000000000000000 --- a/codes/LongXiTWT/15840763.java +++ /dev/null @@ -1,19 +0,0 @@ -/** - * 冒泡排序函数 - * aa bb cc - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - // 你的代码，使无序数组 a 变得有序 - for (int i = 0; i < n - 1; i++) { - for (int j = 0; j < n - i - 1; j++) { - if (a[j] > a[j + 1]) { - - int temp = a[j]; - a[j] = a[j + 1]; - a[j + 1] = temp; - } - } - } -} //end \ No newline at end of file diff --git a/codes/Lorin210926/15605953.java b/codes/Lorin210926/15605953.java deleted file mode 100644 index 20575dc4ccc75a5bf6af9ea4614fcfa2a84fdeaf..0000000000000000000000000000000000000000 --- a/codes/Lorin210926/15605953.java +++ /dev/null @@ -1,19 +0,0 @@ -/** - * 冒泡排序函数 - * aa bb cc - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - // 你的代码，使无序数组 a 变得有序 - for (int i = 0; i < n - 1; i++) { - for (int j = 0; j < n - i - 1; j++) { - if (a[j] > a[j + 1]) { - // 交换元素 - int temp = a[j]; - a[j] = a[j + 1]; - a[j + 1] = temp; - } - } - } -} //end diff --git a/codes/Lovershandd/.keep b/codes/Lovershandd/.keep deleted file mode 100644 index e69de29bb2d1d6434b8b29ae775ad8c2e48c5391..0000000000000000000000000000000000000000 diff --git a/codes/Lovershandd/15845218.java b/codes/Lovershandd/15845218.java deleted file mode 100644 index 6e9861fa3ec6d5a2553cdccd1bb1e977430c671b..0000000000000000000000000000000000000000 --- a/codes/Lovershandd/15845218.java +++ /dev/null @@ -1,19 +0,0 @@ -/** - * 冒泡排序函数 - * aa bb cc - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - // 你的代码，使无序数组 a 变得有序 - for (int i = 0; i < n - 1; i++) { - for (int j = 0; j < n - i - 1; j++) { - if (a[j] > a[j + 1]) { - - int temp = a[j]; - a[j] = a[j + 1]; - a[j + 1] = temp; - } - } - } -} //end \ No newline at end of file diff --git a/codes/Lsaoei/15836207.java b/codes/Lsaoei/15836207.java deleted file mode 100644 index d0e7038df81a1dcd40ba57e5267839caad594f03..0000000000000000000000000000000000000000 --- a/codes/Lsaoei/15836207.java +++ /dev/null @@ -1,19 +0,0 @@ -/** - * 冒泡排序函数 - * 冒泡排序是一种简单的排序算法，它重复地遍历要排序的数列，一次比较两个元素，如果他们的顺序错误就把他们交换过来。 - * 遍历数列的工作是重复地进行直到没有再需要交换，也就是说该数列已经排序完成。 - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - for (int i = 0; i < n - 1; i++) { // 外层循环控制比较的次数 - for (int j = 0; j < n - 1 - i; j++) { // 内层循环控制每一轮比较的次数 - // 如果前一个元素比后一个元素大，则交换它们的位置 - if (a[j] > a[j + 1]) { - int temp = a[j]; - a[j] = a[j + 1]; - a[j + 1] = temp; - } - } - } -} //end diff --git a/codes/Lundyli/11471416.java b/codes/Lundyli/11471416.java deleted file mode 100644 index 8c505501c812f686a9abe78a0d1191db6085134c..0000000000000000000000000000000000000000 --- a/codes/Lundyli/11471416.java +++ /dev/null @@ -1,19 +0,0 @@ -/** - * 冒泡排序函数 - * aa bb cc - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - // 你的代码，使无序数组 a 变得有序 - for(int i=0;i a[j+1]){ - int temp = a[j]; - a[j] = a[j+1]; - a[j+1] = temp; - } - } - } - -} //end \ No newline at end of file diff --git a/codes/Lyw413181892/15630146.java b/codes/Lyw413181892/15630146.java deleted file mode 100644 index f2b711a46fe664a20752955f5730ee67702ccb8b..0000000000000000000000000000000000000000 --- a/codes/Lyw413181892/15630146.java +++ /dev/null @@ -1,20 +0,0 @@ -/** - * 冒泡排序函数 - * aa bb cc - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - // 你的代码，使无序数组 a 变得有序 - for(int i = 0; i < n; i++) { - for(int huat = 0; huat < n - i - 1; huat++) { - if(a[huat] > a[huat + 1]) { - int temp = a[huat]; - a [huat] = a[huat + 1]; - a[huat + 1] = temp; - } - } - } - - -} //end,huat diff --git a/codes/M8M9900/11211820.java b/codes/M8M9900/11211820.java deleted file mode 100644 index 1c8889947f924214c71a3c3f202500b4780dc281..0000000000000000000000000000000000000000 --- a/codes/M8M9900/11211820.java +++ /dev/null @@ -1,11 +0,0 @@ -public static void bubbleSort(int [] a,int n){ - for(int i = 0; i < n-1 ; i++){ - for (int j = 0;j < n-1-i;j++){ - if(a[j] > a[j+1]){ - int temp = a[j]; - a[j] = a[j+1]; - a[j+1] = temp; - } - } - } -} \ No newline at end of file diff --git a/codes/MIngDx/11303026.java b/codes/MIngDx/11303026.java deleted file mode 100644 index 029e9d84c1474520908887693e69aabcb7ff0aba..0000000000000000000000000000000000000000 --- a/codes/MIngDx/11303026.java +++ /dev/null @@ -1,28 +0,0 @@ -/** - * 冒泡排序函数 - * aa bb cc - * @param a 待排序的数组 - * @param n 待排序的数组长度 -*/ -public static void bubbleSort(int [] a, int n){ - int j , k; - int flag = n ;//flag来记录最后交换的位置，也就是排序的尾边界 - - while (flag > 0){//排序未结束标志 - k = flag; //k 来记录遍历的尾边界 - flag = 0; - - for(j=1; j a[j]){//前面的数字大于后面的数字就交换 - //交换a[j-1]和a[j] - int temp; - temp = a[j-1]; - a[j-1] = a[j]; - a[j]=temp; - - //表示交换过数据; - flag = j;//记录最新的尾边界. - } - } - } -} \ No newline at end of file diff --git a/codes/ML777-7/15832109.java b/codes/ML777-7/15832109.java deleted file mode 100644 index d0e7038df81a1dcd40ba57e5267839caad594f03..0000000000000000000000000000000000000000 --- a/codes/ML777-7/15832109.java +++ /dev/null @@ -1,19 +0,0 @@ -/** - * 冒泡排序函数 - * 冒泡排序是一种简单的排序算法，它重复地遍历要排序的数列，一次比较两个元素，如果他们的顺序错误就把他们交换过来。 - * 遍历数列的工作是重复地进行直到没有再需要交换，也就是说该数列已经排序完成。 - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - for (int i = 0; i < n - 1; i++) { // 外层循环控制比较的次数 - for (int j = 0; j < n - 1 - i; j++) { // 内层循环控制每一轮比较的次数 - // 如果前一个元素比后一个元素大，则交换它们的位置 - if (a[j] > a[j + 1]) { - int temp = a[j]; - a[j] = a[j + 1]; - a[j + 1] = temp; - } - } - } -} //end diff --git a/codes/MardaWang/15960606.java b/codes/MardaWang/15960606.java deleted file mode 100644 index 23e5c9e0d22285a882784de3a77d9f21bc9722f2..0000000000000000000000000000000000000000 --- a/codes/MardaWang/15960606.java +++ /dev/null @@ -1,19 +0,0 @@ -/** - * 冒泡排序函数 - * aa bb cc - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - // 你的代码，使无序数组 a 变得有序 - for(int i = 0; i < n-1; i++){ - for(int j=0; j < n-1-i; j++){ - if(a[j] > a[j+1]){ - int temp = a[j]; - a[j] = a[j+1]; - a[j+1] = temp; - } - } - } - -} //end diff --git a/codes/Martin-9527/15628832.java b/codes/Martin-9527/15628832.java deleted file mode 100644 index 20575dc4ccc75a5bf6af9ea4614fcfa2a84fdeaf..0000000000000000000000000000000000000000 --- a/codes/Martin-9527/15628832.java +++ /dev/null @@ -1,19 +0,0 @@ -/** - * 冒泡排序函数 - * aa bb cc - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - // 你的代码，使无序数组 a 变得有序 - for (int i = 0; i < n - 1; i++) { - for (int j = 0; j < n - i - 1; j++) { - if (a[j] > a[j + 1]) { - // 交换元素 - int temp = a[j]; - a[j] = a[j + 1]; - a[j + 1] = temp; - } - } - } -} //end diff --git a/codes/MaxLeton/.15571733.java.swp b/codes/MaxLeton/.15571733.java.swp deleted file mode 100644 index 48a16a164a447d809c471f303c8ca39d8de57ac9..0000000000000000000000000000000000000000 Binary files a/codes/MaxLeton/.15571733.java.swp and /dev/null differ diff --git a/codes/MaxLeton/15562550.java b/codes/MaxLeton/15562550.java deleted file mode 100644 index 4fe168de370c66365f5713fe8aa4aad2854eb4c7..0000000000000000000000000000000000000000 --- a/codes/MaxLeton/15562550.java +++ /dev/null @@ -1,17 +0,0 @@ -/** - * 冒泡排序函数 - * aa bb cc - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - for(int i = 0; i < n - 1; i++) { - for(int j = 0; j< n - i - 1; j++) { - if (a[j] > a[j + 1]) { - int temp = a[j]; - a[j] = a[j + 1]; - a[j + 1] = temp; - } - } - } -} //end diff --git a/codes/MaxLeton/15571733.java b/codes/MaxLeton/15571733.java deleted file mode 100644 index 4fe168de370c66365f5713fe8aa4aad2854eb4c7..0000000000000000000000000000000000000000 --- a/codes/MaxLeton/15571733.java +++ /dev/null @@ -1,17 +0,0 @@ -/** - * 冒泡排序函数 - * aa bb cc - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - for(int i = 0; i < n - 1; i++) { - for(int j = 0; j< n - i - 1; j++) { - if (a[j] > a[j + 1]) { - int temp = a[j]; - a[j] = a[j + 1]; - a[j + 1] = temp; - } - } - } -} //end diff --git a/codes/MaxLeton/15575568.java b/codes/MaxLeton/15575568.java deleted file mode 100644 index 4fe168de370c66365f5713fe8aa4aad2854eb4c7..0000000000000000000000000000000000000000 --- a/codes/MaxLeton/15575568.java +++ /dev/null @@ -1,17 +0,0 @@ -/** - * 冒泡排序函数 - * aa bb cc - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - for(int i = 0; i < n - 1; i++) { - for(int j = 0; j< n - i - 1; j++) { - if (a[j] > a[j + 1]) { - int temp = a[j]; - a[j] = a[j + 1]; - a[j + 1] = temp; - } - } - } -} //end diff --git a/codes/MaxLeton/15576146.java b/codes/MaxLeton/15576146.java deleted file mode 100644 index 4fe168de370c66365f5713fe8aa4aad2854eb4c7..0000000000000000000000000000000000000000 --- a/codes/MaxLeton/15576146.java +++ /dev/null @@ -1,17 +0,0 @@ -/** - * 冒泡排序函数 - * aa bb cc - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - for(int i = 0; i < n - 1; i++) { - for(int j = 0; j< n - i - 1; j++) { - if (a[j] > a[j + 1]) { - int temp = a[j]; - a[j] = a[j + 1]; - a[j + 1] = temp; - } - } - } -} //end diff --git a/codes/MaxLeton/15576148.java b/codes/MaxLeton/15576148.java deleted file mode 100644 index 4fe168de370c66365f5713fe8aa4aad2854eb4c7..0000000000000000000000000000000000000000 --- a/codes/MaxLeton/15576148.java +++ /dev/null @@ -1,17 +0,0 @@ -/** - * 冒泡排序函数 - * aa bb cc - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - for(int i = 0; i < n - 1; i++) { - for(int j = 0; j< n - i - 1; j++) { - if (a[j] > a[j + 1]) { - int temp = a[j]; - a[j] = a[j + 1]; - a[j + 1] = temp; - } - } - } -} //end diff --git a/codes/MaxLeton/15576152.java b/codes/MaxLeton/15576152.java deleted file mode 100644 index 4fe168de370c66365f5713fe8aa4aad2854eb4c7..0000000000000000000000000000000000000000 --- a/codes/MaxLeton/15576152.java +++ /dev/null @@ -1,17 +0,0 @@ -/** - * 冒泡排序函数 - * aa bb cc - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - for(int i = 0; i < n - 1; i++) { - for(int j = 0; j< n - i - 1; j++) { - if (a[j] > a[j + 1]) { - int temp = a[j]; - a[j] = a[j + 1]; - a[j + 1] = temp; - } - } - } -} //end diff --git a/codes/MaxLeton/15579562.java b/codes/MaxLeton/15579562.java deleted file mode 100644 index 4fe168de370c66365f5713fe8aa4aad2854eb4c7..0000000000000000000000000000000000000000 --- a/codes/MaxLeton/15579562.java +++ /dev/null @@ -1,17 +0,0 @@ -/** - * 冒泡排序函数 - * aa bb cc - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - for(int i = 0; i < n - 1; i++) { - for(int j = 0; j< n - i - 1; j++) { - if (a[j] > a[j + 1]) { - int temp = a[j]; - a[j] = a[j + 1]; - a[j + 1] = temp; - } - } - } -} //end diff --git a/codes/MaxLeton/15579566.java b/codes/MaxLeton/15579566.java deleted file mode 100644 index 4fe168de370c66365f5713fe8aa4aad2854eb4c7..0000000000000000000000000000000000000000 --- a/codes/MaxLeton/15579566.java +++ /dev/null @@ -1,17 +0,0 @@ -/** - * 冒泡排序函数 - * aa bb cc - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - for(int i = 0; i < n - 1; i++) { - for(int j = 0; j< n - i - 1; j++) { - if (a[j] > a[j + 1]) { - int temp = a[j]; - a[j] = a[j + 1]; - a[j + 1] = temp; - } - } - } -} //end diff --git a/codes/MaxLeton/15579567.java b/codes/MaxLeton/15579567.java deleted file mode 100644 index 4fe168de370c66365f5713fe8aa4aad2854eb4c7..0000000000000000000000000000000000000000 --- a/codes/MaxLeton/15579567.java +++ /dev/null @@ -1,17 +0,0 @@ -/** - * 冒泡排序函数 - * aa bb cc - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - for(int i = 0; i < n - 1; i++) { - for(int j = 0; j< n - i - 1; j++) { - if (a[j] > a[j + 1]) { - int temp = a[j]; - a[j] = a[j + 1]; - a[j + 1] = temp; - } - } - } -} //end diff --git a/codes/MaxLeton/15579569.java b/codes/MaxLeton/15579569.java deleted file mode 100644 index 4fe168de370c66365f5713fe8aa4aad2854eb4c7..0000000000000000000000000000000000000000 --- a/codes/MaxLeton/15579569.java +++ /dev/null @@ -1,17 +0,0 @@ -/** - * 冒泡排序函数 - * aa bb cc - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - for(int i = 0; i < n - 1; i++) { - for(int j = 0; j< n - i - 1; j++) { - if (a[j] > a[j + 1]) { - int temp = a[j]; - a[j] = a[j + 1]; - a[j + 1] = temp; - } - } - } -} //end diff --git a/codes/MaxLeton/15579570.java b/codes/MaxLeton/15579570.java deleted file mode 100644 index 4fe168de370c66365f5713fe8aa4aad2854eb4c7..0000000000000000000000000000000000000000 --- a/codes/MaxLeton/15579570.java +++ /dev/null @@ -1,17 +0,0 @@ -/** - * 冒泡排序函数 - * aa bb cc - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - for(int i = 0; i < n - 1; i++) { - for(int j = 0; j< n - i - 1; j++) { - if (a[j] > a[j + 1]) { - int temp = a[j]; - a[j] = a[j + 1]; - a[j + 1] = temp; - } - } - } -} //end diff --git a/codes/MaxLeton/15594053.java b/codes/MaxLeton/15594053.java deleted file mode 100644 index 4fe168de370c66365f5713fe8aa4aad2854eb4c7..0000000000000000000000000000000000000000 --- a/codes/MaxLeton/15594053.java +++ /dev/null @@ -1,17 +0,0 @@ -/** - * 冒泡排序函数 - * aa bb cc - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - for(int i = 0; i < n - 1; i++) { - for(int j = 0; j< n - i - 1; j++) { - if (a[j] > a[j + 1]) { - int temp = a[j]; - a[j] = a[j + 1]; - a[j + 1] = temp; - } - } - } -} //end diff --git a/codes/MaxLeton/15594054.java b/codes/MaxLeton/15594054.java deleted file mode 100644 index 4fe168de370c66365f5713fe8aa4aad2854eb4c7..0000000000000000000000000000000000000000 --- a/codes/MaxLeton/15594054.java +++ /dev/null @@ -1,17 +0,0 @@ -/** - * 冒泡排序函数 - * aa bb cc - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - for(int i = 0; i < n - 1; i++) { - for(int j = 0; j< n - i - 1; j++) { - if (a[j] > a[j + 1]) { - int temp = a[j]; - a[j] = a[j + 1]; - a[j + 1] = temp; - } - } - } -} //end diff --git a/codes/MaxLeton/15594056.java b/codes/MaxLeton/15594056.java deleted file mode 100644 index 4fe168de370c66365f5713fe8aa4aad2854eb4c7..0000000000000000000000000000000000000000 --- a/codes/MaxLeton/15594056.java +++ /dev/null @@ -1,17 +0,0 @@ -/** - * 冒泡排序函数 - * aa bb cc - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - for(int i = 0; i < n - 1; i++) { - for(int j = 0; j< n - i - 1; j++) { - if (a[j] > a[j + 1]) { - int temp = a[j]; - a[j] = a[j + 1]; - a[j + 1] = temp; - } - } - } -} //end diff --git a/codes/MaxLeton/15594059.java b/codes/MaxLeton/15594059.java deleted file mode 100644 index 4fe168de370c66365f5713fe8aa4aad2854eb4c7..0000000000000000000000000000000000000000 --- a/codes/MaxLeton/15594059.java +++ /dev/null @@ -1,17 +0,0 @@ -/** - * 冒泡排序函数 - * aa bb cc - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - for(int i = 0; i < n - 1; i++) { - for(int j = 0; j< n - i - 1; j++) { - if (a[j] > a[j + 1]) { - int temp = a[j]; - a[j] = a[j + 1]; - a[j + 1] = temp; - } - } - } -} //end diff --git a/codes/MaxLeton/15594060.java b/codes/MaxLeton/15594060.java deleted file mode 100644 index 4fe168de370c66365f5713fe8aa4aad2854eb4c7..0000000000000000000000000000000000000000 --- a/codes/MaxLeton/15594060.java +++ /dev/null @@ -1,17 +0,0 @@ -/** - * 冒泡排序函数 - * aa bb cc - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - for(int i = 0; i < n - 1; i++) { - for(int j = 0; j< n - i - 1; j++) { - if (a[j] > a[j + 1]) { - int temp = a[j]; - a[j] = a[j + 1]; - a[j + 1] = temp; - } - } - } -} //end diff --git a/codes/MaxLeton/15608880.java b/codes/MaxLeton/15608880.java deleted file mode 100644 index 4fe168de370c66365f5713fe8aa4aad2854eb4c7..0000000000000000000000000000000000000000 --- a/codes/MaxLeton/15608880.java +++ /dev/null @@ -1,17 +0,0 @@ -/** - * 冒泡排序函数 - * aa bb cc - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - for(int i = 0; i < n - 1; i++) { - for(int j = 0; j< n - i - 1; j++) { - if (a[j] > a[j + 1]) { - int temp = a[j]; - a[j] = a[j + 1]; - a[j + 1] = temp; - } - } - } -} //end diff --git a/codes/MaxLeton/15608883.java b/codes/MaxLeton/15608883.java deleted file mode 100644 index 4fe168de370c66365f5713fe8aa4aad2854eb4c7..0000000000000000000000000000000000000000 --- a/codes/MaxLeton/15608883.java +++ /dev/null @@ -1,17 +0,0 @@ -/** - * 冒泡排序函数 - * aa bb cc - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - for(int i = 0; i < n - 1; i++) { - for(int j = 0; j< n - i - 1; j++) { - if (a[j] > a[j + 1]) { - int temp = a[j]; - a[j] = a[j + 1]; - a[j + 1] = temp; - } - } - } -} //end diff --git a/codes/MaxLeton/15608887.java b/codes/MaxLeton/15608887.java deleted file mode 100644 index 4fe168de370c66365f5713fe8aa4aad2854eb4c7..0000000000000000000000000000000000000000 --- a/codes/MaxLeton/15608887.java +++ /dev/null @@ -1,17 +0,0 @@ -/** - * 冒泡排序函数 - * aa bb cc - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - for(int i = 0; i < n - 1; i++) { - for(int j = 0; j< n - i - 1; j++) { - if (a[j] > a[j + 1]) { - int temp = a[j]; - a[j] = a[j + 1]; - a[j + 1] = temp; - } - } - } -} //end diff --git a/codes/MaxLeton/15608889.java b/codes/MaxLeton/15608889.java deleted file mode 100644 index 4fe168de370c66365f5713fe8aa4aad2854eb4c7..0000000000000000000000000000000000000000 --- a/codes/MaxLeton/15608889.java +++ /dev/null @@ -1,17 +0,0 @@ -/** - * 冒泡排序函数 - * aa bb cc - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - for(int i = 0; i < n - 1; i++) { - for(int j = 0; j< n - i - 1; j++) { - if (a[j] > a[j + 1]) { - int temp = a[j]; - a[j] = a[j + 1]; - a[j + 1] = temp; - } - } - } -} //end diff --git a/codes/MaxLeton/15608891.java b/codes/MaxLeton/15608891.java deleted file mode 100644 index 4fe168de370c66365f5713fe8aa4aad2854eb4c7..0000000000000000000000000000000000000000 --- a/codes/MaxLeton/15608891.java +++ /dev/null @@ -1,17 +0,0 @@ -/** - * 冒泡排序函数 - * aa bb cc - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - for(int i = 0; i < n - 1; i++) { - for(int j = 0; j< n - i - 1; j++) { - if (a[j] > a[j + 1]) { - int temp = a[j]; - a[j] = a[j + 1]; - a[j + 1] = temp; - } - } - } -} //end diff --git a/codes/MaxLeton/15626095.java b/codes/MaxLeton/15626095.java deleted file mode 100644 index 4fe168de370c66365f5713fe8aa4aad2854eb4c7..0000000000000000000000000000000000000000 --- a/codes/MaxLeton/15626095.java +++ /dev/null @@ -1,17 +0,0 @@ -/** - * 冒泡排序函数 - * aa bb cc - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - for(int i = 0; i < n - 1; i++) { - for(int j = 0; j< n - i - 1; j++) { - if (a[j] > a[j + 1]) { - int temp = a[j]; - a[j] = a[j + 1]; - a[j + 1] = temp; - } - } - } -} //end diff --git a/codes/MaxLeton/15626097.java b/codes/MaxLeton/15626097.java deleted file mode 100644 index 4fe168de370c66365f5713fe8aa4aad2854eb4c7..0000000000000000000000000000000000000000 --- a/codes/MaxLeton/15626097.java +++ /dev/null @@ -1,17 +0,0 @@ -/** - * 冒泡排序函数 - * aa bb cc - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - for(int i = 0; i < n - 1; i++) { - for(int j = 0; j< n - i - 1; j++) { - if (a[j] > a[j + 1]) { - int temp = a[j]; - a[j] = a[j + 1]; - a[j + 1] = temp; - } - } - } -} //end diff --git a/codes/MaxLeton/15626100.java b/codes/MaxLeton/15626100.java deleted file mode 100644 index 4fe168de370c66365f5713fe8aa4aad2854eb4c7..0000000000000000000000000000000000000000 --- a/codes/MaxLeton/15626100.java +++ /dev/null @@ -1,17 +0,0 @@ -/** - * 冒泡排序函数 - * aa bb cc - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - for(int i = 0; i < n - 1; i++) { - for(int j = 0; j< n - i - 1; j++) { - if (a[j] > a[j + 1]) { - int temp = a[j]; - a[j] = a[j + 1]; - a[j + 1] = temp; - } - } - } -} //end diff --git a/codes/MaxLeton/15626101.java b/codes/MaxLeton/15626101.java deleted file mode 100644 index 4fe168de370c66365f5713fe8aa4aad2854eb4c7..0000000000000000000000000000000000000000 --- a/codes/MaxLeton/15626101.java +++ /dev/null @@ -1,17 +0,0 @@ -/** - * 冒泡排序函数 - * aa bb cc - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - for(int i = 0; i < n - 1; i++) { - for(int j = 0; j< n - i - 1; j++) { - if (a[j] > a[j + 1]) { - int temp = a[j]; - a[j] = a[j + 1]; - a[j + 1] = temp; - } - } - } -} //end diff --git a/codes/MaxLeton/15626102.java b/codes/MaxLeton/15626102.java deleted file mode 100644 index 4fe168de370c66365f5713fe8aa4aad2854eb4c7..0000000000000000000000000000000000000000 --- a/codes/MaxLeton/15626102.java +++ /dev/null @@ -1,17 +0,0 @@ -/** - * 冒泡排序函数 - * aa bb cc - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - for(int i = 0; i < n - 1; i++) { - for(int j = 0; j< n - i - 1; j++) { - if (a[j] > a[j + 1]) { - int temp = a[j]; - a[j] = a[j + 1]; - a[j + 1] = temp; - } - } - } -} //end diff --git a/codes/MaxLeton/15655523.java b/codes/MaxLeton/15655523.java deleted file mode 100644 index 4fe168de370c66365f5713fe8aa4aad2854eb4c7..0000000000000000000000000000000000000000 --- a/codes/MaxLeton/15655523.java +++ /dev/null @@ -1,17 +0,0 @@ -/** - * 冒泡排序函数 - * aa bb cc - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - for(int i = 0; i < n - 1; i++) { - for(int j = 0; j< n - i - 1; j++) { - if (a[j] > a[j + 1]) { - int temp = a[j]; - a[j] = a[j + 1]; - a[j + 1] = temp; - } - } - } -} //end diff --git a/codes/MaxLeton/15655527.java b/codes/MaxLeton/15655527.java deleted file mode 100644 index 4fe168de370c66365f5713fe8aa4aad2854eb4c7..0000000000000000000000000000000000000000 --- a/codes/MaxLeton/15655527.java +++ /dev/null @@ -1,17 +0,0 @@ -/** - * 冒泡排序函数 - * aa bb cc - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - for(int i = 0; i < n - 1; i++) { - for(int j = 0; j< n - i - 1; j++) { - if (a[j] > a[j + 1]) { - int temp = a[j]; - a[j] = a[j + 1]; - a[j + 1] = temp; - } - } - } -} //end diff --git a/codes/MaxLeton/15655529.java b/codes/MaxLeton/15655529.java deleted file mode 100644 index 4fe168de370c66365f5713fe8aa4aad2854eb4c7..0000000000000000000000000000000000000000 --- a/codes/MaxLeton/15655529.java +++ /dev/null @@ -1,17 +0,0 @@ -/** - * 冒泡排序函数 - * aa bb cc - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - for(int i = 0; i < n - 1; i++) { - for(int j = 0; j< n - i - 1; j++) { - if (a[j] > a[j + 1]) { - int temp = a[j]; - a[j] = a[j + 1]; - a[j + 1] = temp; - } - } - } -} //end diff --git a/codes/MaxLeton/15655530.java b/codes/MaxLeton/15655530.java deleted file mode 100644 index 4fe168de370c66365f5713fe8aa4aad2854eb4c7..0000000000000000000000000000000000000000 --- a/codes/MaxLeton/15655530.java +++ /dev/null @@ -1,17 +0,0 @@ -/** - * 冒泡排序函数 - * aa bb cc - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - for(int i = 0; i < n - 1; i++) { - for(int j = 0; j< n - i - 1; j++) { - if (a[j] > a[j + 1]) { - int temp = a[j]; - a[j] = a[j + 1]; - a[j + 1] = temp; - } - } - } -} //end diff --git a/codes/MaxLeton/15655532.java b/codes/MaxLeton/15655532.java deleted file mode 100644 index 4fe168de370c66365f5713fe8aa4aad2854eb4c7..0000000000000000000000000000000000000000 --- a/codes/MaxLeton/15655532.java +++ /dev/null @@ -1,17 +0,0 @@ -/** - * 冒泡排序函数 - * aa bb cc - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - for(int i = 0; i < n - 1; i++) { - for(int j = 0; j< n - i - 1; j++) { - if (a[j] > a[j + 1]) { - int temp = a[j]; - a[j] = a[j + 1]; - a[j + 1] = temp; - } - } - } -} //end diff --git a/codes/MaxLeton/15670770.java b/codes/MaxLeton/15670770.java deleted file mode 100644 index 4fe168de370c66365f5713fe8aa4aad2854eb4c7..0000000000000000000000000000000000000000 --- a/codes/MaxLeton/15670770.java +++ /dev/null @@ -1,17 +0,0 @@ -/** - * 冒泡排序函数 - * aa bb cc - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - for(int i = 0; i < n - 1; i++) { - for(int j = 0; j< n - i - 1; j++) { - if (a[j] > a[j + 1]) { - int temp = a[j]; - a[j] = a[j + 1]; - a[j + 1] = temp; - } - } - } -} //end diff --git a/codes/MaxLeton/15670771.java b/codes/MaxLeton/15670771.java deleted file mode 100644 index 4fe168de370c66365f5713fe8aa4aad2854eb4c7..0000000000000000000000000000000000000000 --- a/codes/MaxLeton/15670771.java +++ /dev/null @@ -1,17 +0,0 @@ -/** - * 冒泡排序函数 - * aa bb cc - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - for(int i = 0; i < n - 1; i++) { - for(int j = 0; j< n - i - 1; j++) { - if (a[j] > a[j + 1]) { - int temp = a[j]; - a[j] = a[j + 1]; - a[j + 1] = temp; - } - } - } -} //end diff --git a/codes/MaxLeton/15670774.java b/codes/MaxLeton/15670774.java deleted file mode 100644 index 4fe168de370c66365f5713fe8aa4aad2854eb4c7..0000000000000000000000000000000000000000 --- a/codes/MaxLeton/15670774.java +++ /dev/null @@ -1,17 +0,0 @@ -/** - * 冒泡排序函数 - * aa bb cc - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - for(int i = 0; i < n - 1; i++) { - for(int j = 0; j< n - i - 1; j++) { - if (a[j] > a[j + 1]) { - int temp = a[j]; - a[j] = a[j + 1]; - a[j + 1] = temp; - } - } - } -} //end diff --git a/codes/MaxLeton/15670778.java b/codes/MaxLeton/15670778.java deleted file mode 100644 index 4fe168de370c66365f5713fe8aa4aad2854eb4c7..0000000000000000000000000000000000000000 --- a/codes/MaxLeton/15670778.java +++ /dev/null @@ -1,17 +0,0 @@ -/** - * 冒泡排序函数 - * aa bb cc - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - for(int i = 0; i < n - 1; i++) { - for(int j = 0; j< n - i - 1; j++) { - if (a[j] > a[j + 1]) { - int temp = a[j]; - a[j] = a[j + 1]; - a[j + 1] = temp; - } - } - } -} //end diff --git a/codes/MaxLeton/15670781.java b/codes/MaxLeton/15670781.java deleted file mode 100644 index 4fe168de370c66365f5713fe8aa4aad2854eb4c7..0000000000000000000000000000000000000000 --- a/codes/MaxLeton/15670781.java +++ /dev/null @@ -1,17 +0,0 @@ -/** - * 冒泡排序函数 - * aa bb cc - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - for(int i = 0; i < n - 1; i++) { - for(int j = 0; j< n - i - 1; j++) { - if (a[j] > a[j + 1]) { - int temp = a[j]; - a[j] = a[j + 1]; - a[j + 1] = temp; - } - } - } -} //end diff --git a/codes/MaxLeton/15689390.java b/codes/MaxLeton/15689390.java deleted file mode 100644 index 4fe168de370c66365f5713fe8aa4aad2854eb4c7..0000000000000000000000000000000000000000 --- a/codes/MaxLeton/15689390.java +++ /dev/null @@ -1,17 +0,0 @@ -/** - * 冒泡排序函数 - * aa bb cc - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - for(int i = 0; i < n - 1; i++) { - for(int j = 0; j< n - i - 1; j++) { - if (a[j] > a[j + 1]) { - int temp = a[j]; - a[j] = a[j + 1]; - a[j + 1] = temp; - } - } - } -} //end diff --git a/codes/MaxLeton/15689391.java b/codes/MaxLeton/15689391.java deleted file mode 100644 index 4fe168de370c66365f5713fe8aa4aad2854eb4c7..0000000000000000000000000000000000000000 --- a/codes/MaxLeton/15689391.java +++ /dev/null @@ -1,17 +0,0 @@ -/** - * 冒泡排序函数 - * aa bb cc - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - for(int i = 0; i < n - 1; i++) { - for(int j = 0; j< n - i - 1; j++) { - if (a[j] > a[j + 1]) { - int temp = a[j]; - a[j] = a[j + 1]; - a[j + 1] = temp; - } - } - } -} //end diff --git a/codes/MaxLeton/15689394.java b/codes/MaxLeton/15689394.java deleted file mode 100644 index 4fe168de370c66365f5713fe8aa4aad2854eb4c7..0000000000000000000000000000000000000000 --- a/codes/MaxLeton/15689394.java +++ /dev/null @@ -1,17 +0,0 @@ -/** - * 冒泡排序函数 - * aa bb cc - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - for(int i = 0; i < n - 1; i++) { - for(int j = 0; j< n - i - 1; j++) { - if (a[j] > a[j + 1]) { - int temp = a[j]; - a[j] = a[j + 1]; - a[j + 1] = temp; - } - } - } -} //end diff --git a/codes/MaxLeton/15689395.java b/codes/MaxLeton/15689395.java deleted file mode 100644 index 4fe168de370c66365f5713fe8aa4aad2854eb4c7..0000000000000000000000000000000000000000 --- a/codes/MaxLeton/15689395.java +++ /dev/null @@ -1,17 +0,0 @@ -/** - * 冒泡排序函数 - * aa bb cc - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - for(int i = 0; i < n - 1; i++) { - for(int j = 0; j< n - i - 1; j++) { - if (a[j] > a[j + 1]) { - int temp = a[j]; - a[j] = a[j + 1]; - a[j + 1] = temp; - } - } - } -} //end diff --git a/codes/MaxLeton/15689399.java b/codes/MaxLeton/15689399.java deleted file mode 100644 index 4fe168de370c66365f5713fe8aa4aad2854eb4c7..0000000000000000000000000000000000000000 --- a/codes/MaxLeton/15689399.java +++ /dev/null @@ -1,17 +0,0 @@ -/** - * 冒泡排序函数 - * aa bb cc - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - for(int i = 0; i < n - 1; i++) { - for(int j = 0; j< n - i - 1; j++) { - if (a[j] > a[j + 1]) { - int temp = a[j]; - a[j] = a[j + 1]; - a[j + 1] = temp; - } - } - } -} //end diff --git a/codes/MaxLeton/15701706.java b/codes/MaxLeton/15701706.java deleted file mode 100644 index 4fe168de370c66365f5713fe8aa4aad2854eb4c7..0000000000000000000000000000000000000000 --- a/codes/MaxLeton/15701706.java +++ /dev/null @@ -1,17 +0,0 @@ -/** - * 冒泡排序函数 - * aa bb cc - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - for(int i = 0; i < n - 1; i++) { - for(int j = 0; j< n - i - 1; j++) { - if (a[j] > a[j + 1]) { - int temp = a[j]; - a[j] = a[j + 1]; - a[j + 1] = temp; - } - } - } -} //end diff --git a/codes/MaxLeton/15701711.java b/codes/MaxLeton/15701711.java deleted file mode 100644 index 4fe168de370c66365f5713fe8aa4aad2854eb4c7..0000000000000000000000000000000000000000 --- a/codes/MaxLeton/15701711.java +++ /dev/null @@ -1,17 +0,0 @@ -/** - * 冒泡排序函数 - * aa bb cc - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - for(int i = 0; i < n - 1; i++) { - for(int j = 0; j< n - i - 1; j++) { - if (a[j] > a[j + 1]) { - int temp = a[j]; - a[j] = a[j + 1]; - a[j + 1] = temp; - } - } - } -} //end diff --git a/codes/MaxLeton/15701714.java b/codes/MaxLeton/15701714.java deleted file mode 100644 index 4fe168de370c66365f5713fe8aa4aad2854eb4c7..0000000000000000000000000000000000000000 --- a/codes/MaxLeton/15701714.java +++ /dev/null @@ -1,17 +0,0 @@ -/** - * 冒泡排序函数 - * aa bb cc - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - for(int i = 0; i < n - 1; i++) { - for(int j = 0; j< n - i - 1; j++) { - if (a[j] > a[j + 1]) { - int temp = a[j]; - a[j] = a[j + 1]; - a[j + 1] = temp; - } - } - } -} //end diff --git a/codes/MaxLeton/15701718.java b/codes/MaxLeton/15701718.java deleted file mode 100644 index 4fe168de370c66365f5713fe8aa4aad2854eb4c7..0000000000000000000000000000000000000000 --- a/codes/MaxLeton/15701718.java +++ /dev/null @@ -1,17 +0,0 @@ -/** - * 冒泡排序函数 - * aa bb cc - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - for(int i = 0; i < n - 1; i++) { - for(int j = 0; j< n - i - 1; j++) { - if (a[j] > a[j + 1]) { - int temp = a[j]; - a[j] = a[j + 1]; - a[j + 1] = temp; - } - } - } -} //end diff --git a/codes/MaxLeton/15701720.java b/codes/MaxLeton/15701720.java deleted file mode 100644 index 4fe168de370c66365f5713fe8aa4aad2854eb4c7..0000000000000000000000000000000000000000 --- a/codes/MaxLeton/15701720.java +++ /dev/null @@ -1,17 +0,0 @@ -/** - * 冒泡排序函数 - * aa bb cc - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - for(int i = 0; i < n - 1; i++) { - for(int j = 0; j< n - i - 1; j++) { - if (a[j] > a[j + 1]) { - int temp = a[j]; - a[j] = a[j + 1]; - a[j + 1] = temp; - } - } - } -} //end diff --git a/codes/MaxLeton/15716047.java b/codes/MaxLeton/15716047.java deleted file mode 100644 index 4fe168de370c66365f5713fe8aa4aad2854eb4c7..0000000000000000000000000000000000000000 --- a/codes/MaxLeton/15716047.java +++ /dev/null @@ -1,17 +0,0 @@ -/** - * 冒泡排序函数 - * aa bb cc - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - for(int i = 0; i < n - 1; i++) { - for(int j = 0; j< n - i - 1; j++) { - if (a[j] > a[j + 1]) { - int temp = a[j]; - a[j] = a[j + 1]; - a[j + 1] = temp; - } - } - } -} //end diff --git a/codes/MaxLeton/15716048.java b/codes/MaxLeton/15716048.java deleted file mode 100644 index 4fe168de370c66365f5713fe8aa4aad2854eb4c7..0000000000000000000000000000000000000000 --- a/codes/MaxLeton/15716048.java +++ /dev/null @@ -1,17 +0,0 @@ -/** - * 冒泡排序函数 - * aa bb cc - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - for(int i = 0; i < n - 1; i++) { - for(int j = 0; j< n - i - 1; j++) { - if (a[j] > a[j + 1]) { - int temp = a[j]; - a[j] = a[j + 1]; - a[j + 1] = temp; - } - } - } -} //end diff --git a/codes/MaxLeton/15716049.java b/codes/MaxLeton/15716049.java deleted file mode 100644 index 4fe168de370c66365f5713fe8aa4aad2854eb4c7..0000000000000000000000000000000000000000 --- a/codes/MaxLeton/15716049.java +++ /dev/null @@ -1,17 +0,0 @@ -/** - * 冒泡排序函数 - * aa bb cc - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - for(int i = 0; i < n - 1; i++) { - for(int j = 0; j< n - i - 1; j++) { - if (a[j] > a[j + 1]) { - int temp = a[j]; - a[j] = a[j + 1]; - a[j + 1] = temp; - } - } - } -} //end diff --git a/codes/MaxLeton/15716050.java b/codes/MaxLeton/15716050.java deleted file mode 100644 index 4fe168de370c66365f5713fe8aa4aad2854eb4c7..0000000000000000000000000000000000000000 --- a/codes/MaxLeton/15716050.java +++ /dev/null @@ -1,17 +0,0 @@ -/** - * 冒泡排序函数 - * aa bb cc - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - for(int i = 0; i < n - 1; i++) { - for(int j = 0; j< n - i - 1; j++) { - if (a[j] > a[j + 1]) { - int temp = a[j]; - a[j] = a[j + 1]; - a[j + 1] = temp; - } - } - } -} //end diff --git a/codes/MaxLeton/15716053.java b/codes/MaxLeton/15716053.java deleted file mode 100644 index 4fe168de370c66365f5713fe8aa4aad2854eb4c7..0000000000000000000000000000000000000000 --- a/codes/MaxLeton/15716053.java +++ /dev/null @@ -1,17 +0,0 @@ -/** - * 冒泡排序函数 - * aa bb cc - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - for(int i = 0; i < n - 1; i++) { - for(int j = 0; j< n - i - 1; j++) { - if (a[j] > a[j + 1]) { - int temp = a[j]; - a[j] = a[j + 1]; - a[j + 1] = temp; - } - } - } -} //end diff --git a/codes/MaxLeton/15747350.java b/codes/MaxLeton/15747350.java deleted file mode 100644 index 4fe168de370c66365f5713fe8aa4aad2854eb4c7..0000000000000000000000000000000000000000 --- a/codes/MaxLeton/15747350.java +++ /dev/null @@ -1,17 +0,0 @@ -/** - * 冒泡排序函数 - * aa bb cc - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - for(int i = 0; i < n - 1; i++) { - for(int j = 0; j< n - i - 1; j++) { - if (a[j] > a[j + 1]) { - int temp = a[j]; - a[j] = a[j + 1]; - a[j + 1] = temp; - } - } - } -} //end diff --git a/codes/MaxLeton/15747354.java b/codes/MaxLeton/15747354.java deleted file mode 100644 index 4fe168de370c66365f5713fe8aa4aad2854eb4c7..0000000000000000000000000000000000000000 --- a/codes/MaxLeton/15747354.java +++ /dev/null @@ -1,17 +0,0 @@ -/** - * 冒泡排序函数 - * aa bb cc - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - for(int i = 0; i < n - 1; i++) { - for(int j = 0; j< n - i - 1; j++) { - if (a[j] > a[j + 1]) { - int temp = a[j]; - a[j] = a[j + 1]; - a[j + 1] = temp; - } - } - } -} //end diff --git a/codes/MaxLeton/15747356.java b/codes/MaxLeton/15747356.java deleted file mode 100644 index 4fe168de370c66365f5713fe8aa4aad2854eb4c7..0000000000000000000000000000000000000000 --- a/codes/MaxLeton/15747356.java +++ /dev/null @@ -1,17 +0,0 @@ -/** - * 冒泡排序函数 - * aa bb cc - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - for(int i = 0; i < n - 1; i++) { - for(int j = 0; j< n - i - 1; j++) { - if (a[j] > a[j + 1]) { - int temp = a[j]; - a[j] = a[j + 1]; - a[j + 1] = temp; - } - } - } -} //end diff --git a/codes/MaxLeton/15747359.java b/codes/MaxLeton/15747359.java deleted file mode 100644 index 4fe168de370c66365f5713fe8aa4aad2854eb4c7..0000000000000000000000000000000000000000 --- a/codes/MaxLeton/15747359.java +++ /dev/null @@ -1,17 +0,0 @@ -/** - * 冒泡排序函数 - * aa bb cc - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - for(int i = 0; i < n - 1; i++) { - for(int j = 0; j< n - i - 1; j++) { - if (a[j] > a[j + 1]) { - int temp = a[j]; - a[j] = a[j + 1]; - a[j + 1] = temp; - } - } - } -} //end diff --git a/codes/MaxLeton/15747361.java b/codes/MaxLeton/15747361.java deleted file mode 100644 index 4fe168de370c66365f5713fe8aa4aad2854eb4c7..0000000000000000000000000000000000000000 --- a/codes/MaxLeton/15747361.java +++ /dev/null @@ -1,17 +0,0 @@ -/** - * 冒泡排序函数 - * aa bb cc - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - for(int i = 0; i < n - 1; i++) { - for(int j = 0; j< n - i - 1; j++) { - if (a[j] > a[j + 1]) { - int temp = a[j]; - a[j] = a[j + 1]; - a[j + 1] = temp; - } - } - } -} //end diff --git a/codes/MaxLeton/16519582.java b/codes/MaxLeton/16519582.java deleted file mode 100644 index 4fe168de370c66365f5713fe8aa4aad2854eb4c7..0000000000000000000000000000000000000000 --- a/codes/MaxLeton/16519582.java +++ /dev/null @@ -1,17 +0,0 @@ -/** - * 冒泡排序函数 - * aa bb cc - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - for(int i = 0; i < n - 1; i++) { - for(int j = 0; j< n - i - 1; j++) { - if (a[j] > a[j + 1]) { - int temp = a[j]; - a[j] = a[j + 1]; - a[j + 1] = temp; - } - } - } -} //end diff --git a/codes/MaxLeton/16519586.java b/codes/MaxLeton/16519586.java deleted file mode 100644 index 4fe168de370c66365f5713fe8aa4aad2854eb4c7..0000000000000000000000000000000000000000 --- a/codes/MaxLeton/16519586.java +++ /dev/null @@ -1,17 +0,0 @@ -/** - * 冒泡排序函数 - * aa bb cc - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - for(int i = 0; i < n - 1; i++) { - for(int j = 0; j< n - i - 1; j++) { - if (a[j] > a[j + 1]) { - int temp = a[j]; - a[j] = a[j + 1]; - a[j + 1] = temp; - } - } - } -} //end diff --git a/codes/MaxLeton/16519591.java b/codes/MaxLeton/16519591.java deleted file mode 100644 index 4fe168de370c66365f5713fe8aa4aad2854eb4c7..0000000000000000000000000000000000000000 --- a/codes/MaxLeton/16519591.java +++ /dev/null @@ -1,17 +0,0 @@ -/** - * 冒泡排序函数 - * aa bb cc - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - for(int i = 0; i < n - 1; i++) { - for(int j = 0; j< n - i - 1; j++) { - if (a[j] > a[j + 1]) { - int temp = a[j]; - a[j] = a[j + 1]; - a[j + 1] = temp; - } - } - } -} //end diff --git a/codes/MaxLeton/16519593.java b/codes/MaxLeton/16519593.java deleted file mode 100644 index 4fe168de370c66365f5713fe8aa4aad2854eb4c7..0000000000000000000000000000000000000000 --- a/codes/MaxLeton/16519593.java +++ /dev/null @@ -1,17 +0,0 @@ -/** - * 冒泡排序函数 - * aa bb cc - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - for(int i = 0; i < n - 1; i++) { - for(int j = 0; j< n - i - 1; j++) { - if (a[j] > a[j + 1]) { - int temp = a[j]; - a[j] = a[j + 1]; - a[j + 1] = temp; - } - } - } -} //end diff --git a/codes/MaxLeton/16519596.java b/codes/MaxLeton/16519596.java deleted file mode 100644 index 4fe168de370c66365f5713fe8aa4aad2854eb4c7..0000000000000000000000000000000000000000 --- a/codes/MaxLeton/16519596.java +++ /dev/null @@ -1,17 +0,0 @@ -/** - * 冒泡排序函数 - * aa bb cc - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - for(int i = 0; i < n - 1; i++) { - for(int j = 0; j< n - i - 1; j++) { - if (a[j] > a[j + 1]) { - int temp = a[j]; - a[j] = a[j + 1]; - a[j + 1] = temp; - } - } - } -} //end diff --git a/codes/MaxLeton/17040714.java b/codes/MaxLeton/17040714.java deleted file mode 100644 index 4fe168de370c66365f5713fe8aa4aad2854eb4c7..0000000000000000000000000000000000000000 --- a/codes/MaxLeton/17040714.java +++ /dev/null @@ -1,17 +0,0 @@ -/** - * 冒泡排序函数 - * aa bb cc - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - for(int i = 0; i < n - 1; i++) { - for(int j = 0; j< n - i - 1; j++) { - if (a[j] > a[j + 1]) { - int temp = a[j]; - a[j] = a[j + 1]; - a[j + 1] = temp; - } - } - } -} //end diff --git a/codes/MaxLeton/17040715.java b/codes/MaxLeton/17040715.java deleted file mode 100644 index 4fe168de370c66365f5713fe8aa4aad2854eb4c7..0000000000000000000000000000000000000000 --- a/codes/MaxLeton/17040715.java +++ /dev/null @@ -1,17 +0,0 @@ -/** - * 冒泡排序函数 - * aa bb cc - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - for(int i = 0; i < n - 1; i++) { - for(int j = 0; j< n - i - 1; j++) { - if (a[j] > a[j + 1]) { - int temp = a[j]; - a[j] = a[j + 1]; - a[j + 1] = temp; - } - } - } -} //end diff --git a/codes/MaxLeton/17040721.java b/codes/MaxLeton/17040721.java deleted file mode 100644 index 4fe168de370c66365f5713fe8aa4aad2854eb4c7..0000000000000000000000000000000000000000 --- a/codes/MaxLeton/17040721.java +++ /dev/null @@ -1,17 +0,0 @@ -/** - * 冒泡排序函数 - * aa bb cc - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - for(int i = 0; i < n - 1; i++) { - for(int j = 0; j< n - i - 1; j++) { - if (a[j] > a[j + 1]) { - int temp = a[j]; - a[j] = a[j + 1]; - a[j + 1] = temp; - } - } - } -} //end diff --git a/codes/MaxLeton/17040722.java b/codes/MaxLeton/17040722.java deleted file mode 100644 index 4fe168de370c66365f5713fe8aa4aad2854eb4c7..0000000000000000000000000000000000000000 --- a/codes/MaxLeton/17040722.java +++ /dev/null @@ -1,17 +0,0 @@ -/** - * 冒泡排序函数 - * aa bb cc - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - for(int i = 0; i < n - 1; i++) { - for(int j = 0; j< n - i - 1; j++) { - if (a[j] > a[j + 1]) { - int temp = a[j]; - a[j] = a[j + 1]; - a[j + 1] = temp; - } - } - } -} //end diff --git a/codes/MaxLeton/17040725.java b/codes/MaxLeton/17040725.java deleted file mode 100644 index 4fe168de370c66365f5713fe8aa4aad2854eb4c7..0000000000000000000000000000000000000000 --- a/codes/MaxLeton/17040725.java +++ /dev/null @@ -1,17 +0,0 @@ -/** - * 冒泡排序函数 - * aa bb cc - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - for(int i = 0; i < n - 1; i++) { - for(int j = 0; j< n - i - 1; j++) { - if (a[j] > a[j + 1]) { - int temp = a[j]; - a[j] = a[j + 1]; - a[j + 1] = temp; - } - } - } -} //end diff --git a/codes/MaxLeton/17044792.java b/codes/MaxLeton/17044792.java deleted file mode 100644 index 4fe168de370c66365f5713fe8aa4aad2854eb4c7..0000000000000000000000000000000000000000 --- a/codes/MaxLeton/17044792.java +++ /dev/null @@ -1,17 +0,0 @@ -/** - * 冒泡排序函数 - * aa bb cc - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - for(int i = 0; i < n - 1; i++) { - for(int j = 0; j< n - i - 1; j++) { - if (a[j] > a[j + 1]) { - int temp = a[j]; - a[j] = a[j + 1]; - a[j + 1] = temp; - } - } - } -} //end diff --git a/codes/MaxLeton/17044794.java b/codes/MaxLeton/17044794.java deleted file mode 100644 index 4fe168de370c66365f5713fe8aa4aad2854eb4c7..0000000000000000000000000000000000000000 --- a/codes/MaxLeton/17044794.java +++ /dev/null @@ -1,17 +0,0 @@ -/** - * 冒泡排序函数 - * aa bb cc - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - for(int i = 0; i < n - 1; i++) { - for(int j = 0; j< n - i - 1; j++) { - if (a[j] > a[j + 1]) { - int temp = a[j]; - a[j] = a[j + 1]; - a[j + 1] = temp; - } - } - } -} //end diff --git a/codes/MaxLeton/17044796.java b/codes/MaxLeton/17044796.java deleted file mode 100644 index 4fe168de370c66365f5713fe8aa4aad2854eb4c7..0000000000000000000000000000000000000000 --- a/codes/MaxLeton/17044796.java +++ /dev/null @@ -1,17 +0,0 @@ -/** - * 冒泡排序函数 - * aa bb cc - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - for(int i = 0; i < n - 1; i++) { - for(int j = 0; j< n - i - 1; j++) { - if (a[j] > a[j + 1]) { - int temp = a[j]; - a[j] = a[j + 1]; - a[j + 1] = temp; - } - } - } -} //end diff --git a/codes/MaxLeton/17044797.java b/codes/MaxLeton/17044797.java deleted file mode 100644 index 4fe168de370c66365f5713fe8aa4aad2854eb4c7..0000000000000000000000000000000000000000 --- a/codes/MaxLeton/17044797.java +++ /dev/null @@ -1,17 +0,0 @@ -/** - * 冒泡排序函数 - * aa bb cc - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - for(int i = 0; i < n - 1; i++) { - for(int j = 0; j< n - i - 1; j++) { - if (a[j] > a[j + 1]) { - int temp = a[j]; - a[j] = a[j + 1]; - a[j + 1] = temp; - } - } - } -} //end diff --git a/codes/MaxLeton/17044800.java b/codes/MaxLeton/17044800.java deleted file mode 100644 index 4fe168de370c66365f5713fe8aa4aad2854eb4c7..0000000000000000000000000000000000000000 --- a/codes/MaxLeton/17044800.java +++ /dev/null @@ -1,17 +0,0 @@ -/** - * 冒泡排序函数 - * aa bb cc - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - for(int i = 0; i < n - 1; i++) { - for(int j = 0; j< n - i - 1; j++) { - if (a[j] > a[j + 1]) { - int temp = a[j]; - a[j] = a[j + 1]; - a[j + 1] = temp; - } - } - } -} //end diff --git a/codes/MaxLeton/17061868.java b/codes/MaxLeton/17061868.java deleted file mode 100644 index 4fe168de370c66365f5713fe8aa4aad2854eb4c7..0000000000000000000000000000000000000000 --- a/codes/MaxLeton/17061868.java +++ /dev/null @@ -1,17 +0,0 @@ -/** - * 冒泡排序函数 - * aa bb cc - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - for(int i = 0; i < n - 1; i++) { - for(int j = 0; j< n - i - 1; j++) { - if (a[j] > a[j + 1]) { - int temp = a[j]; - a[j] = a[j + 1]; - a[j + 1] = temp; - } - } - } -} //end diff --git a/codes/MaxLeton/17061869.java b/codes/MaxLeton/17061869.java deleted file mode 100644 index 4fe168de370c66365f5713fe8aa4aad2854eb4c7..0000000000000000000000000000000000000000 --- a/codes/MaxLeton/17061869.java +++ /dev/null @@ -1,17 +0,0 @@ -/** - * 冒泡排序函数 - * aa bb cc - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - for(int i = 0; i < n - 1; i++) { - for(int j = 0; j< n - i - 1; j++) { - if (a[j] > a[j + 1]) { - int temp = a[j]; - a[j] = a[j + 1]; - a[j + 1] = temp; - } - } - } -} //end diff --git a/codes/MaxLeton/17061870.java b/codes/MaxLeton/17061870.java deleted file mode 100644 index 4fe168de370c66365f5713fe8aa4aad2854eb4c7..0000000000000000000000000000000000000000 --- a/codes/MaxLeton/17061870.java +++ /dev/null @@ -1,17 +0,0 @@ -/** - * 冒泡排序函数 - * aa bb cc - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - for(int i = 0; i < n - 1; i++) { - for(int j = 0; j< n - i - 1; j++) { - if (a[j] > a[j + 1]) { - int temp = a[j]; - a[j] = a[j + 1]; - a[j + 1] = temp; - } - } - } -} //end diff --git a/codes/MaxLeton/17061871.java b/codes/MaxLeton/17061871.java deleted file mode 100644 index 4fe168de370c66365f5713fe8aa4aad2854eb4c7..0000000000000000000000000000000000000000 --- a/codes/MaxLeton/17061871.java +++ /dev/null @@ -1,17 +0,0 @@ -/** - * 冒泡排序函数 - * aa bb cc - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - for(int i = 0; i < n - 1; i++) { - for(int j = 0; j< n - i - 1; j++) { - if (a[j] > a[j + 1]) { - int temp = a[j]; - a[j] = a[j + 1]; - a[j + 1] = temp; - } - } - } -} //end diff --git a/codes/MaxLeton/17061873.java b/codes/MaxLeton/17061873.java deleted file mode 100644 index 4fe168de370c66365f5713fe8aa4aad2854eb4c7..0000000000000000000000000000000000000000 --- a/codes/MaxLeton/17061873.java +++ /dev/null @@ -1,17 +0,0 @@ -/** - * 冒泡排序函数 - * aa bb cc - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - for(int i = 0; i < n - 1; i++) { - for(int j = 0; j< n - i - 1; j++) { - if (a[j] > a[j + 1]) { - int temp = a[j]; - a[j] = a[j + 1]; - a[j + 1] = temp; - } - } - } -} //end diff --git a/codes/MaxLeton/17066605.java b/codes/MaxLeton/17066605.java deleted file mode 100644 index 4fe168de370c66365f5713fe8aa4aad2854eb4c7..0000000000000000000000000000000000000000 --- a/codes/MaxLeton/17066605.java +++ /dev/null @@ -1,17 +0,0 @@ -/** - * 冒泡排序函数 - * aa bb cc - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - for(int i = 0; i < n - 1; i++) { - for(int j = 0; j< n - i - 1; j++) { - if (a[j] > a[j + 1]) { - int temp = a[j]; - a[j] = a[j + 1]; - a[j + 1] = temp; - } - } - } -} //end diff --git a/codes/MaxLeton/17066607.java b/codes/MaxLeton/17066607.java deleted file mode 100644 index 4fe168de370c66365f5713fe8aa4aad2854eb4c7..0000000000000000000000000000000000000000 --- a/codes/MaxLeton/17066607.java +++ /dev/null @@ -1,17 +0,0 @@ -/** - * 冒泡排序函数 - * aa bb cc - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - for(int i = 0; i < n - 1; i++) { - for(int j = 0; j< n - i - 1; j++) { - if (a[j] > a[j + 1]) { - int temp = a[j]; - a[j] = a[j + 1]; - a[j + 1] = temp; - } - } - } -} //end diff --git a/codes/MaxLeton/17066608.java b/codes/MaxLeton/17066608.java deleted file mode 100644 index 4fe168de370c66365f5713fe8aa4aad2854eb4c7..0000000000000000000000000000000000000000 --- a/codes/MaxLeton/17066608.java +++ /dev/null @@ -1,17 +0,0 @@ -/** - * 冒泡排序函数 - * aa bb cc - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - for(int i = 0; i < n - 1; i++) { - for(int j = 0; j< n - i - 1; j++) { - if (a[j] > a[j + 1]) { - int temp = a[j]; - a[j] = a[j + 1]; - a[j + 1] = temp; - } - } - } -} //end diff --git a/codes/MaxLeton/17066609.java b/codes/MaxLeton/17066609.java deleted file mode 100644 index 4fe168de370c66365f5713fe8aa4aad2854eb4c7..0000000000000000000000000000000000000000 --- a/codes/MaxLeton/17066609.java +++ /dev/null @@ -1,17 +0,0 @@ -/** - * 冒泡排序函数 - * aa bb cc - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - for(int i = 0; i < n - 1; i++) { - for(int j = 0; j< n - i - 1; j++) { - if (a[j] > a[j + 1]) { - int temp = a[j]; - a[j] = a[j + 1]; - a[j + 1] = temp; - } - } - } -} //end diff --git a/codes/MaxLeton/17066611.java b/codes/MaxLeton/17066611.java deleted file mode 100644 index 4fe168de370c66365f5713fe8aa4aad2854eb4c7..0000000000000000000000000000000000000000 --- a/codes/MaxLeton/17066611.java +++ /dev/null @@ -1,17 +0,0 @@ -/** - * 冒泡排序函数 - * aa bb cc - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - for(int i = 0; i < n - 1; i++) { - for(int j = 0; j< n - i - 1; j++) { - if (a[j] > a[j + 1]) { - int temp = a[j]; - a[j] = a[j + 1]; - a[j + 1] = temp; - } - } - } -} //end diff --git a/codes/MaxLeton/17066615.java b/codes/MaxLeton/17066615.java deleted file mode 100644 index 4fe168de370c66365f5713fe8aa4aad2854eb4c7..0000000000000000000000000000000000000000 --- a/codes/MaxLeton/17066615.java +++ /dev/null @@ -1,17 +0,0 @@ -/** - * 冒泡排序函数 - * aa bb cc - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - for(int i = 0; i < n - 1; i++) { - for(int j = 0; j< n - i - 1; j++) { - if (a[j] > a[j + 1]) { - int temp = a[j]; - a[j] = a[j + 1]; - a[j + 1] = temp; - } - } - } -} //end diff --git a/codes/MaxLeton/17067867.java b/codes/MaxLeton/17067867.java deleted file mode 100644 index 4fe168de370c66365f5713fe8aa4aad2854eb4c7..0000000000000000000000000000000000000000 --- a/codes/MaxLeton/17067867.java +++ /dev/null @@ -1,17 +0,0 @@ -/** - * 冒泡排序函数 - * aa bb cc - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - for(int i = 0; i < n - 1; i++) { - for(int j = 0; j< n - i - 1; j++) { - if (a[j] > a[j + 1]) { - int temp = a[j]; - a[j] = a[j + 1]; - a[j + 1] = temp; - } - } - } -} //end diff --git a/codes/MaxLeton/17067870.java b/codes/MaxLeton/17067870.java deleted file mode 100644 index 4fe168de370c66365f5713fe8aa4aad2854eb4c7..0000000000000000000000000000000000000000 --- a/codes/MaxLeton/17067870.java +++ /dev/null @@ -1,17 +0,0 @@ -/** - * 冒泡排序函数 - * aa bb cc - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - for(int i = 0; i < n - 1; i++) { - for(int j = 0; j< n - i - 1; j++) { - if (a[j] > a[j + 1]) { - int temp = a[j]; - a[j] = a[j + 1]; - a[j + 1] = temp; - } - } - } -} //end diff --git a/codes/MaxLeton/17067871.java b/codes/MaxLeton/17067871.java deleted file mode 100644 index 4fe168de370c66365f5713fe8aa4aad2854eb4c7..0000000000000000000000000000000000000000 --- a/codes/MaxLeton/17067871.java +++ /dev/null @@ -1,17 +0,0 @@ -/** - * 冒泡排序函数 - * aa bb cc - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - for(int i = 0; i < n - 1; i++) { - for(int j = 0; j< n - i - 1; j++) { - if (a[j] > a[j + 1]) { - int temp = a[j]; - a[j] = a[j + 1]; - a[j + 1] = temp; - } - } - } -} //end diff --git a/codes/MaxLeton/17067872.java b/codes/MaxLeton/17067872.java deleted file mode 100644 index 4fe168de370c66365f5713fe8aa4aad2854eb4c7..0000000000000000000000000000000000000000 --- a/codes/MaxLeton/17067872.java +++ /dev/null @@ -1,17 +0,0 @@ -/** - * 冒泡排序函数 - * aa bb cc - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - for(int i = 0; i < n - 1; i++) { - for(int j = 0; j< n - i - 1; j++) { - if (a[j] > a[j + 1]) { - int temp = a[j]; - a[j] = a[j + 1]; - a[j + 1] = temp; - } - } - } -} //end diff --git a/codes/MaxLeton/17067874.java b/codes/MaxLeton/17067874.java deleted file mode 100644 index 4fe168de370c66365f5713fe8aa4aad2854eb4c7..0000000000000000000000000000000000000000 --- a/codes/MaxLeton/17067874.java +++ /dev/null @@ -1,17 +0,0 @@ -/** - * 冒泡排序函数 - * aa bb cc - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - for(int i = 0; i < n - 1; i++) { - for(int j = 0; j< n - i - 1; j++) { - if (a[j] > a[j + 1]) { - int temp = a[j]; - a[j] = a[j + 1]; - a[j + 1] = temp; - } - } - } -} //end diff --git a/codes/MaxLeton/17084198.java b/codes/MaxLeton/17084198.java deleted file mode 100644 index 4fe168de370c66365f5713fe8aa4aad2854eb4c7..0000000000000000000000000000000000000000 --- a/codes/MaxLeton/17084198.java +++ /dev/null @@ -1,17 +0,0 @@ -/** - * 冒泡排序函数 - * aa bb cc - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - for(int i = 0; i < n - 1; i++) { - for(int j = 0; j< n - i - 1; j++) { - if (a[j] > a[j + 1]) { - int temp = a[j]; - a[j] = a[j + 1]; - a[j + 1] = temp; - } - } - } -} //end diff --git a/codes/MaxLeton/17084201.java b/codes/MaxLeton/17084201.java deleted file mode 100644 index 4fe168de370c66365f5713fe8aa4aad2854eb4c7..0000000000000000000000000000000000000000 --- a/codes/MaxLeton/17084201.java +++ /dev/null @@ -1,17 +0,0 @@ -/** - * 冒泡排序函数 - * aa bb cc - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - for(int i = 0; i < n - 1; i++) { - for(int j = 0; j< n - i - 1; j++) { - if (a[j] > a[j + 1]) { - int temp = a[j]; - a[j] = a[j + 1]; - a[j + 1] = temp; - } - } - } -} //end diff --git a/codes/MaxLeton/17084202.java b/codes/MaxLeton/17084202.java deleted file mode 100644 index 4fe168de370c66365f5713fe8aa4aad2854eb4c7..0000000000000000000000000000000000000000 --- a/codes/MaxLeton/17084202.java +++ /dev/null @@ -1,17 +0,0 @@ -/** - * 冒泡排序函数 - * aa bb cc - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - for(int i = 0; i < n - 1; i++) { - for(int j = 0; j< n - i - 1; j++) { - if (a[j] > a[j + 1]) { - int temp = a[j]; - a[j] = a[j + 1]; - a[j + 1] = temp; - } - } - } -} //end diff --git a/codes/MaxLeton/17084204.java b/codes/MaxLeton/17084204.java deleted file mode 100644 index 4fe168de370c66365f5713fe8aa4aad2854eb4c7..0000000000000000000000000000000000000000 --- a/codes/MaxLeton/17084204.java +++ /dev/null @@ -1,17 +0,0 @@ -/** - * 冒泡排序函数 - * aa bb cc - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - for(int i = 0; i < n - 1; i++) { - for(int j = 0; j< n - i - 1; j++) { - if (a[j] > a[j + 1]) { - int temp = a[j]; - a[j] = a[j + 1]; - a[j + 1] = temp; - } - } - } -} //end diff --git a/codes/MaxLeton/17084206.java b/codes/MaxLeton/17084206.java deleted file mode 100644 index 4fe168de370c66365f5713fe8aa4aad2854eb4c7..0000000000000000000000000000000000000000 --- a/codes/MaxLeton/17084206.java +++ /dev/null @@ -1,17 +0,0 @@ -/** - * 冒泡排序函数 - * aa bb cc - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - for(int i = 0; i < n - 1; i++) { - for(int j = 0; j< n - i - 1; j++) { - if (a[j] > a[j + 1]) { - int temp = a[j]; - a[j] = a[j + 1]; - a[j + 1] = temp; - } - } - } -} //end diff --git a/codes/MaxLeton/17104411.java b/codes/MaxLeton/17104411.java deleted file mode 100644 index 4fe168de370c66365f5713fe8aa4aad2854eb4c7..0000000000000000000000000000000000000000 --- a/codes/MaxLeton/17104411.java +++ /dev/null @@ -1,17 +0,0 @@ -/** - * 冒泡排序函数 - * aa bb cc - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - for(int i = 0; i < n - 1; i++) { - for(int j = 0; j< n - i - 1; j++) { - if (a[j] > a[j + 1]) { - int temp = a[j]; - a[j] = a[j + 1]; - a[j + 1] = temp; - } - } - } -} //end diff --git a/codes/MaxLeton/17104414.java b/codes/MaxLeton/17104414.java deleted file mode 100644 index 4fe168de370c66365f5713fe8aa4aad2854eb4c7..0000000000000000000000000000000000000000 --- a/codes/MaxLeton/17104414.java +++ /dev/null @@ -1,17 +0,0 @@ -/** - * 冒泡排序函数 - * aa bb cc - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - for(int i = 0; i < n - 1; i++) { - for(int j = 0; j< n - i - 1; j++) { - if (a[j] > a[j + 1]) { - int temp = a[j]; - a[j] = a[j + 1]; - a[j + 1] = temp; - } - } - } -} //end diff --git a/codes/MaxLeton/17104415.java b/codes/MaxLeton/17104415.java deleted file mode 100644 index 4fe168de370c66365f5713fe8aa4aad2854eb4c7..0000000000000000000000000000000000000000 --- a/codes/MaxLeton/17104415.java +++ /dev/null @@ -1,17 +0,0 @@ -/** - * 冒泡排序函数 - * aa bb cc - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - for(int i = 0; i < n - 1; i++) { - for(int j = 0; j< n - i - 1; j++) { - if (a[j] > a[j + 1]) { - int temp = a[j]; - a[j] = a[j + 1]; - a[j + 1] = temp; - } - } - } -} //end diff --git a/codes/MaxLeton/17104420.java b/codes/MaxLeton/17104420.java deleted file mode 100644 index 4fe168de370c66365f5713fe8aa4aad2854eb4c7..0000000000000000000000000000000000000000 --- a/codes/MaxLeton/17104420.java +++ /dev/null @@ -1,17 +0,0 @@ -/** - * 冒泡排序函数 - * aa bb cc - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - for(int i = 0; i < n - 1; i++) { - for(int j = 0; j< n - i - 1; j++) { - if (a[j] > a[j + 1]) { - int temp = a[j]; - a[j] = a[j + 1]; - a[j + 1] = temp; - } - } - } -} //end diff --git a/codes/MaxLeton/17104424.java b/codes/MaxLeton/17104424.java deleted file mode 100644 index 4fe168de370c66365f5713fe8aa4aad2854eb4c7..0000000000000000000000000000000000000000 --- a/codes/MaxLeton/17104424.java +++ /dev/null @@ -1,17 +0,0 @@ -/** - * 冒泡排序函数 - * aa bb cc - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - for(int i = 0; i < n - 1; i++) { - for(int j = 0; j< n - i - 1; j++) { - if (a[j] > a[j + 1]) { - int temp = a[j]; - a[j] = a[j + 1]; - a[j + 1] = temp; - } - } - } -} //end diff --git a/codes/MaxLeton/17118929.java b/codes/MaxLeton/17118929.java deleted file mode 100644 index 4fe168de370c66365f5713fe8aa4aad2854eb4c7..0000000000000000000000000000000000000000 --- a/codes/MaxLeton/17118929.java +++ /dev/null @@ -1,17 +0,0 @@ -/** - * 冒泡排序函数 - * aa bb cc - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - for(int i = 0; i < n - 1; i++) { - for(int j = 0; j< n - i - 1; j++) { - if (a[j] > a[j + 1]) { - int temp = a[j]; - a[j] = a[j + 1]; - a[j + 1] = temp; - } - } - } -} //end diff --git a/codes/MaxLeton/17118934.java b/codes/MaxLeton/17118934.java deleted file mode 100644 index 4fe168de370c66365f5713fe8aa4aad2854eb4c7..0000000000000000000000000000000000000000 --- a/codes/MaxLeton/17118934.java +++ /dev/null @@ -1,17 +0,0 @@ -/** - * 冒泡排序函数 - * aa bb cc - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - for(int i = 0; i < n - 1; i++) { - for(int j = 0; j< n - i - 1; j++) { - if (a[j] > a[j + 1]) { - int temp = a[j]; - a[j] = a[j + 1]; - a[j + 1] = temp; - } - } - } -} //end diff --git a/codes/MaxLeton/17118937.java b/codes/MaxLeton/17118937.java deleted file mode 100644 index 4fe168de370c66365f5713fe8aa4aad2854eb4c7..0000000000000000000000000000000000000000 --- a/codes/MaxLeton/17118937.java +++ /dev/null @@ -1,17 +0,0 @@ -/** - * 冒泡排序函数 - * aa bb cc - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - for(int i = 0; i < n - 1; i++) { - for(int j = 0; j< n - i - 1; j++) { - if (a[j] > a[j + 1]) { - int temp = a[j]; - a[j] = a[j + 1]; - a[j + 1] = temp; - } - } - } -} //end diff --git a/codes/MaxLeton/17118939.java b/codes/MaxLeton/17118939.java deleted file mode 100644 index 4fe168de370c66365f5713fe8aa4aad2854eb4c7..0000000000000000000000000000000000000000 --- a/codes/MaxLeton/17118939.java +++ /dev/null @@ -1,17 +0,0 @@ -/** - * 冒泡排序函数 - * aa bb cc - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - for(int i = 0; i < n - 1; i++) { - for(int j = 0; j< n - i - 1; j++) { - if (a[j] > a[j + 1]) { - int temp = a[j]; - a[j] = a[j + 1]; - a[j + 1] = temp; - } - } - } -} //end diff --git a/codes/MaxLeton/17118941.java b/codes/MaxLeton/17118941.java deleted file mode 100644 index 4fe168de370c66365f5713fe8aa4aad2854eb4c7..0000000000000000000000000000000000000000 --- a/codes/MaxLeton/17118941.java +++ /dev/null @@ -1,17 +0,0 @@ -/** - * 冒泡排序函数 - * aa bb cc - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - for(int i = 0; i < n - 1; i++) { - for(int j = 0; j< n - i - 1; j++) { - if (a[j] > a[j + 1]) { - int temp = a[j]; - a[j] = a[j + 1]; - a[j + 1] = temp; - } - } - } -} //end diff --git a/codes/MaxLeton/17128518.java b/codes/MaxLeton/17128518.java deleted file mode 100644 index 4fe168de370c66365f5713fe8aa4aad2854eb4c7..0000000000000000000000000000000000000000 --- a/codes/MaxLeton/17128518.java +++ /dev/null @@ -1,17 +0,0 @@ -/** - * 冒泡排序函数 - * aa bb cc - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - for(int i = 0; i < n - 1; i++) { - for(int j = 0; j< n - i - 1; j++) { - if (a[j] > a[j + 1]) { - int temp = a[j]; - a[j] = a[j + 1]; - a[j + 1] = temp; - } - } - } -} //end diff --git a/codes/MaxLeton/17128519.java b/codes/MaxLeton/17128519.java deleted file mode 100644 index 4fe168de370c66365f5713fe8aa4aad2854eb4c7..0000000000000000000000000000000000000000 --- a/codes/MaxLeton/17128519.java +++ /dev/null @@ -1,17 +0,0 @@ -/** - * 冒泡排序函数 - * aa bb cc - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - for(int i = 0; i < n - 1; i++) { - for(int j = 0; j< n - i - 1; j++) { - if (a[j] > a[j + 1]) { - int temp = a[j]; - a[j] = a[j + 1]; - a[j + 1] = temp; - } - } - } -} //end diff --git a/codes/MaxLeton/17128522.java b/codes/MaxLeton/17128522.java deleted file mode 100644 index 4fe168de370c66365f5713fe8aa4aad2854eb4c7..0000000000000000000000000000000000000000 --- a/codes/MaxLeton/17128522.java +++ /dev/null @@ -1,17 +0,0 @@ -/** - * 冒泡排序函数 - * aa bb cc - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - for(int i = 0; i < n - 1; i++) { - for(int j = 0; j< n - i - 1; j++) { - if (a[j] > a[j + 1]) { - int temp = a[j]; - a[j] = a[j + 1]; - a[j + 1] = temp; - } - } - } -} //end diff --git a/codes/MaxLeton/17128527.java b/codes/MaxLeton/17128527.java deleted file mode 100644 index 4fe168de370c66365f5713fe8aa4aad2854eb4c7..0000000000000000000000000000000000000000 --- a/codes/MaxLeton/17128527.java +++ /dev/null @@ -1,17 +0,0 @@ -/** - * 冒泡排序函数 - * aa bb cc - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - for(int i = 0; i < n - 1; i++) { - for(int j = 0; j< n - i - 1; j++) { - if (a[j] > a[j + 1]) { - int temp = a[j]; - a[j] = a[j + 1]; - a[j + 1] = temp; - } - } - } -} //end diff --git a/codes/MaxLeton/17128530.java b/codes/MaxLeton/17128530.java deleted file mode 100644 index 4fe168de370c66365f5713fe8aa4aad2854eb4c7..0000000000000000000000000000000000000000 --- a/codes/MaxLeton/17128530.java +++ /dev/null @@ -1,17 +0,0 @@ -/** - * 冒泡排序函数 - * aa bb cc - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - for(int i = 0; i < n - 1; i++) { - for(int j = 0; j< n - i - 1; j++) { - if (a[j] > a[j + 1]) { - int temp = a[j]; - a[j] = a[j + 1]; - a[j + 1] = temp; - } - } - } -} //end diff --git a/codes/MaxLeton/17142779.java b/codes/MaxLeton/17142779.java deleted file mode 100644 index 4fe168de370c66365f5713fe8aa4aad2854eb4c7..0000000000000000000000000000000000000000 --- a/codes/MaxLeton/17142779.java +++ /dev/null @@ -1,17 +0,0 @@ -/** - * 冒泡排序函数 - * aa bb cc - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - for(int i = 0; i < n - 1; i++) { - for(int j = 0; j< n - i - 1; j++) { - if (a[j] > a[j + 1]) { - int temp = a[j]; - a[j] = a[j + 1]; - a[j + 1] = temp; - } - } - } -} //end diff --git a/codes/MaxLeton/17142782.java b/codes/MaxLeton/17142782.java deleted file mode 100644 index 4fe168de370c66365f5713fe8aa4aad2854eb4c7..0000000000000000000000000000000000000000 --- a/codes/MaxLeton/17142782.java +++ /dev/null @@ -1,17 +0,0 @@ -/** - * 冒泡排序函数 - * aa bb cc - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - for(int i = 0; i < n - 1; i++) { - for(int j = 0; j< n - i - 1; j++) { - if (a[j] > a[j + 1]) { - int temp = a[j]; - a[j] = a[j + 1]; - a[j + 1] = temp; - } - } - } -} //end diff --git a/codes/MaxLeton/17142783.java b/codes/MaxLeton/17142783.java deleted file mode 100644 index 4fe168de370c66365f5713fe8aa4aad2854eb4c7..0000000000000000000000000000000000000000 --- a/codes/MaxLeton/17142783.java +++ /dev/null @@ -1,17 +0,0 @@ -/** - * 冒泡排序函数 - * aa bb cc - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - for(int i = 0; i < n - 1; i++) { - for(int j = 0; j< n - i - 1; j++) { - if (a[j] > a[j + 1]) { - int temp = a[j]; - a[j] = a[j + 1]; - a[j + 1] = temp; - } - } - } -} //end diff --git a/codes/MaxLeton/17142784.java b/codes/MaxLeton/17142784.java deleted file mode 100644 index 4fe168de370c66365f5713fe8aa4aad2854eb4c7..0000000000000000000000000000000000000000 --- a/codes/MaxLeton/17142784.java +++ /dev/null @@ -1,17 +0,0 @@ -/** - * 冒泡排序函数 - * aa bb cc - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - for(int i = 0; i < n - 1; i++) { - for(int j = 0; j< n - i - 1; j++) { - if (a[j] > a[j + 1]) { - int temp = a[j]; - a[j] = a[j + 1]; - a[j + 1] = temp; - } - } - } -} //end diff --git a/codes/MaxLeton/17142785.java b/codes/MaxLeton/17142785.java deleted file mode 100644 index 4fe168de370c66365f5713fe8aa4aad2854eb4c7..0000000000000000000000000000000000000000 --- a/codes/MaxLeton/17142785.java +++ /dev/null @@ -1,17 +0,0 @@ -/** - * 冒泡排序函数 - * aa bb cc - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - for(int i = 0; i < n - 1; i++) { - for(int j = 0; j< n - i - 1; j++) { - if (a[j] > a[j + 1]) { - int temp = a[j]; - a[j] = a[j + 1]; - a[j + 1] = temp; - } - } - } -} //end diff --git a/codes/MaxLeton/17150613.java b/codes/MaxLeton/17150613.java deleted file mode 100644 index 4fe168de370c66365f5713fe8aa4aad2854eb4c7..0000000000000000000000000000000000000000 --- a/codes/MaxLeton/17150613.java +++ /dev/null @@ -1,17 +0,0 @@ -/** - * 冒泡排序函数 - * aa bb cc - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - for(int i = 0; i < n - 1; i++) { - for(int j = 0; j< n - i - 1; j++) { - if (a[j] > a[j + 1]) { - int temp = a[j]; - a[j] = a[j + 1]; - a[j + 1] = temp; - } - } - } -} //end diff --git a/codes/MaxLeton/17150614.java b/codes/MaxLeton/17150614.java deleted file mode 100644 index 4fe168de370c66365f5713fe8aa4aad2854eb4c7..0000000000000000000000000000000000000000 --- a/codes/MaxLeton/17150614.java +++ /dev/null @@ -1,17 +0,0 @@ -/** - * 冒泡排序函数 - * aa bb cc - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - for(int i = 0; i < n - 1; i++) { - for(int j = 0; j< n - i - 1; j++) { - if (a[j] > a[j + 1]) { - int temp = a[j]; - a[j] = a[j + 1]; - a[j + 1] = temp; - } - } - } -} //end diff --git a/codes/MaxLeton/17150616.java b/codes/MaxLeton/17150616.java deleted file mode 100644 index 4fe168de370c66365f5713fe8aa4aad2854eb4c7..0000000000000000000000000000000000000000 --- a/codes/MaxLeton/17150616.java +++ /dev/null @@ -1,17 +0,0 @@ -/** - * 冒泡排序函数 - * aa bb cc - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - for(int i = 0; i < n - 1; i++) { - for(int j = 0; j< n - i - 1; j++) { - if (a[j] > a[j + 1]) { - int temp = a[j]; - a[j] = a[j + 1]; - a[j + 1] = temp; - } - } - } -} //end diff --git a/codes/MaxLeton/17150617.java b/codes/MaxLeton/17150617.java deleted file mode 100644 index 4fe168de370c66365f5713fe8aa4aad2854eb4c7..0000000000000000000000000000000000000000 --- a/codes/MaxLeton/17150617.java +++ /dev/null @@ -1,17 +0,0 @@ -/** - * 冒泡排序函数 - * aa bb cc - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - for(int i = 0; i < n - 1; i++) { - for(int j = 0; j< n - i - 1; j++) { - if (a[j] > a[j + 1]) { - int temp = a[j]; - a[j] = a[j + 1]; - a[j + 1] = temp; - } - } - } -} //end diff --git a/codes/MaxLeton/17150619.java b/codes/MaxLeton/17150619.java deleted file mode 100644 index 4fe168de370c66365f5713fe8aa4aad2854eb4c7..0000000000000000000000000000000000000000 --- a/codes/MaxLeton/17150619.java +++ /dev/null @@ -1,17 +0,0 @@ -/** - * 冒泡排序函数 - * aa bb cc - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - for(int i = 0; i < n - 1; i++) { - for(int j = 0; j< n - i - 1; j++) { - if (a[j] > a[j + 1]) { - int temp = a[j]; - a[j] = a[j + 1]; - a[j + 1] = temp; - } - } - } -} //end diff --git a/codes/MaxLeton/17168898.java b/codes/MaxLeton/17168898.java deleted file mode 100644 index 4fe168de370c66365f5713fe8aa4aad2854eb4c7..0000000000000000000000000000000000000000 --- a/codes/MaxLeton/17168898.java +++ /dev/null @@ -1,17 +0,0 @@ -/** - * 冒泡排序函数 - * aa bb cc - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - for(int i = 0; i < n - 1; i++) { - for(int j = 0; j< n - i - 1; j++) { - if (a[j] > a[j + 1]) { - int temp = a[j]; - a[j] = a[j + 1]; - a[j + 1] = temp; - } - } - } -} //end diff --git a/codes/MaxLeton/17168901.java b/codes/MaxLeton/17168901.java deleted file mode 100644 index 4fe168de370c66365f5713fe8aa4aad2854eb4c7..0000000000000000000000000000000000000000 --- a/codes/MaxLeton/17168901.java +++ /dev/null @@ -1,17 +0,0 @@ -/** - * 冒泡排序函数 - * aa bb cc - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - for(int i = 0; i < n - 1; i++) { - for(int j = 0; j< n - i - 1; j++) { - if (a[j] > a[j + 1]) { - int temp = a[j]; - a[j] = a[j + 1]; - a[j + 1] = temp; - } - } - } -} //end diff --git a/codes/MaxLeton/17168903.java b/codes/MaxLeton/17168903.java deleted file mode 100644 index 4fe168de370c66365f5713fe8aa4aad2854eb4c7..0000000000000000000000000000000000000000 --- a/codes/MaxLeton/17168903.java +++ /dev/null @@ -1,17 +0,0 @@ -/** - * 冒泡排序函数 - * aa bb cc - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - for(int i = 0; i < n - 1; i++) { - for(int j = 0; j< n - i - 1; j++) { - if (a[j] > a[j + 1]) { - int temp = a[j]; - a[j] = a[j + 1]; - a[j + 1] = temp; - } - } - } -} //end diff --git a/codes/MaxLeton/17168905.java b/codes/MaxLeton/17168905.java deleted file mode 100644 index 4fe168de370c66365f5713fe8aa4aad2854eb4c7..0000000000000000000000000000000000000000 --- a/codes/MaxLeton/17168905.java +++ /dev/null @@ -1,17 +0,0 @@ -/** - * 冒泡排序函数 - * aa bb cc - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - for(int i = 0; i < n - 1; i++) { - for(int j = 0; j< n - i - 1; j++) { - if (a[j] > a[j + 1]) { - int temp = a[j]; - a[j] = a[j + 1]; - a[j + 1] = temp; - } - } - } -} //end diff --git a/codes/MaxLeton/17168907.java b/codes/MaxLeton/17168907.java deleted file mode 100644 index 4fe168de370c66365f5713fe8aa4aad2854eb4c7..0000000000000000000000000000000000000000 --- a/codes/MaxLeton/17168907.java +++ /dev/null @@ -1,17 +0,0 @@ -/** - * 冒泡排序函数 - * aa bb cc - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - for(int i = 0; i < n - 1; i++) { - for(int j = 0; j< n - i - 1; j++) { - if (a[j] > a[j + 1]) { - int temp = a[j]; - a[j] = a[j + 1]; - a[j + 1] = temp; - } - } - } -} //end diff --git a/codes/MaxLeton/17185943.java b/codes/MaxLeton/17185943.java deleted file mode 100644 index 4fe168de370c66365f5713fe8aa4aad2854eb4c7..0000000000000000000000000000000000000000 --- a/codes/MaxLeton/17185943.java +++ /dev/null @@ -1,17 +0,0 @@ -/** - * 冒泡排序函数 - * aa bb cc - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - for(int i = 0; i < n - 1; i++) { - for(int j = 0; j< n - i - 1; j++) { - if (a[j] > a[j + 1]) { - int temp = a[j]; - a[j] = a[j + 1]; - a[j + 1] = temp; - } - } - } -} //end diff --git a/codes/MaxLeton/17185948.java b/codes/MaxLeton/17185948.java deleted file mode 100644 index 4fe168de370c66365f5713fe8aa4aad2854eb4c7..0000000000000000000000000000000000000000 --- a/codes/MaxLeton/17185948.java +++ /dev/null @@ -1,17 +0,0 @@ -/** - * 冒泡排序函数 - * aa bb cc - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - for(int i = 0; i < n - 1; i++) { - for(int j = 0; j< n - i - 1; j++) { - if (a[j] > a[j + 1]) { - int temp = a[j]; - a[j] = a[j + 1]; - a[j + 1] = temp; - } - } - } -} //end diff --git a/codes/MaxLeton/17185950.java b/codes/MaxLeton/17185950.java deleted file mode 100644 index 4fe168de370c66365f5713fe8aa4aad2854eb4c7..0000000000000000000000000000000000000000 --- a/codes/MaxLeton/17185950.java +++ /dev/null @@ -1,17 +0,0 @@ -/** - * 冒泡排序函数 - * aa bb cc - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - for(int i = 0; i < n - 1; i++) { - for(int j = 0; j< n - i - 1; j++) { - if (a[j] > a[j + 1]) { - int temp = a[j]; - a[j] = a[j + 1]; - a[j + 1] = temp; - } - } - } -} //end diff --git a/codes/MaxLeton/17185953.java b/codes/MaxLeton/17185953.java deleted file mode 100644 index 4fe168de370c66365f5713fe8aa4aad2854eb4c7..0000000000000000000000000000000000000000 --- a/codes/MaxLeton/17185953.java +++ /dev/null @@ -1,17 +0,0 @@ -/** - * 冒泡排序函数 - * aa bb cc - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - for(int i = 0; i < n - 1; i++) { - for(int j = 0; j< n - i - 1; j++) { - if (a[j] > a[j + 1]) { - int temp = a[j]; - a[j] = a[j + 1]; - a[j + 1] = temp; - } - } - } -} //end diff --git a/codes/MaxLeton/17185957.java b/codes/MaxLeton/17185957.java deleted file mode 100644 index 4fe168de370c66365f5713fe8aa4aad2854eb4c7..0000000000000000000000000000000000000000 --- a/codes/MaxLeton/17185957.java +++ /dev/null @@ -1,17 +0,0 @@ -/** - * 冒泡排序函数 - * aa bb cc - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - for(int i = 0; i < n - 1; i++) { - for(int j = 0; j< n - i - 1; j++) { - if (a[j] > a[j + 1]) { - int temp = a[j]; - a[j] = a[j + 1]; - a[j + 1] = temp; - } - } - } -} //end diff --git a/codes/MaxLeton/17199424.java b/codes/MaxLeton/17199424.java deleted file mode 100644 index 4fe168de370c66365f5713fe8aa4aad2854eb4c7..0000000000000000000000000000000000000000 --- a/codes/MaxLeton/17199424.java +++ /dev/null @@ -1,17 +0,0 @@ -/** - * 冒泡排序函数 - * aa bb cc - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - for(int i = 0; i < n - 1; i++) { - for(int j = 0; j< n - i - 1; j++) { - if (a[j] > a[j + 1]) { - int temp = a[j]; - a[j] = a[j + 1]; - a[j + 1] = temp; - } - } - } -} //end diff --git a/codes/MaxLeton/17199427.java b/codes/MaxLeton/17199427.java deleted file mode 100644 index 4fe168de370c66365f5713fe8aa4aad2854eb4c7..0000000000000000000000000000000000000000 --- a/codes/MaxLeton/17199427.java +++ /dev/null @@ -1,17 +0,0 @@ -/** - * 冒泡排序函数 - * aa bb cc - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - for(int i = 0; i < n - 1; i++) { - for(int j = 0; j< n - i - 1; j++) { - if (a[j] > a[j + 1]) { - int temp = a[j]; - a[j] = a[j + 1]; - a[j + 1] = temp; - } - } - } -} //end diff --git a/codes/MaxLeton/17199429.java b/codes/MaxLeton/17199429.java deleted file mode 100644 index 4fe168de370c66365f5713fe8aa4aad2854eb4c7..0000000000000000000000000000000000000000 --- a/codes/MaxLeton/17199429.java +++ /dev/null @@ -1,17 +0,0 @@ -/** - * 冒泡排序函数 - * aa bb cc - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - for(int i = 0; i < n - 1; i++) { - for(int j = 0; j< n - i - 1; j++) { - if (a[j] > a[j + 1]) { - int temp = a[j]; - a[j] = a[j + 1]; - a[j + 1] = temp; - } - } - } -} //end diff --git a/codes/MaxLeton/17199431.java b/codes/MaxLeton/17199431.java deleted file mode 100644 index 4fe168de370c66365f5713fe8aa4aad2854eb4c7..0000000000000000000000000000000000000000 --- a/codes/MaxLeton/17199431.java +++ /dev/null @@ -1,17 +0,0 @@ -/** - * 冒泡排序函数 - * aa bb cc - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - for(int i = 0; i < n - 1; i++) { - for(int j = 0; j< n - i - 1; j++) { - if (a[j] > a[j + 1]) { - int temp = a[j]; - a[j] = a[j + 1]; - a[j + 1] = temp; - } - } - } -} //end diff --git a/codes/MaxLeton/17199433.java b/codes/MaxLeton/17199433.java deleted file mode 100644 index 4fe168de370c66365f5713fe8aa4aad2854eb4c7..0000000000000000000000000000000000000000 --- a/codes/MaxLeton/17199433.java +++ /dev/null @@ -1,17 +0,0 @@ -/** - * 冒泡排序函数 - * aa bb cc - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - for(int i = 0; i < n - 1; i++) { - for(int j = 0; j< n - i - 1; j++) { - if (a[j] > a[j + 1]) { - int temp = a[j]; - a[j] = a[j + 1]; - a[j + 1] = temp; - } - } - } -} //end diff --git a/codes/MaxLeton/17212361.java b/codes/MaxLeton/17212361.java deleted file mode 100644 index 4fe168de370c66365f5713fe8aa4aad2854eb4c7..0000000000000000000000000000000000000000 --- a/codes/MaxLeton/17212361.java +++ /dev/null @@ -1,17 +0,0 @@ -/** - * 冒泡排序函数 - * aa bb cc - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - for(int i = 0; i < n - 1; i++) { - for(int j = 0; j< n - i - 1; j++) { - if (a[j] > a[j + 1]) { - int temp = a[j]; - a[j] = a[j + 1]; - a[j + 1] = temp; - } - } - } -} //end diff --git a/codes/MaxLeton/17212364.java b/codes/MaxLeton/17212364.java deleted file mode 100644 index 4fe168de370c66365f5713fe8aa4aad2854eb4c7..0000000000000000000000000000000000000000 --- a/codes/MaxLeton/17212364.java +++ /dev/null @@ -1,17 +0,0 @@ -/** - * 冒泡排序函数 - * aa bb cc - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - for(int i = 0; i < n - 1; i++) { - for(int j = 0; j< n - i - 1; j++) { - if (a[j] > a[j + 1]) { - int temp = a[j]; - a[j] = a[j + 1]; - a[j + 1] = temp; - } - } - } -} //end diff --git a/codes/MaxLeton/17212369.java b/codes/MaxLeton/17212369.java deleted file mode 100644 index 4fe168de370c66365f5713fe8aa4aad2854eb4c7..0000000000000000000000000000000000000000 --- a/codes/MaxLeton/17212369.java +++ /dev/null @@ -1,17 +0,0 @@ -/** - * 冒泡排序函数 - * aa bb cc - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - for(int i = 0; i < n - 1; i++) { - for(int j = 0; j< n - i - 1; j++) { - if (a[j] > a[j + 1]) { - int temp = a[j]; - a[j] = a[j + 1]; - a[j + 1] = temp; - } - } - } -} //end diff --git a/codes/MaxLeton/17212370.java b/codes/MaxLeton/17212370.java deleted file mode 100644 index 4fe168de370c66365f5713fe8aa4aad2854eb4c7..0000000000000000000000000000000000000000 --- a/codes/MaxLeton/17212370.java +++ /dev/null @@ -1,17 +0,0 @@ -/** - * 冒泡排序函数 - * aa bb cc - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - for(int i = 0; i < n - 1; i++) { - for(int j = 0; j< n - i - 1; j++) { - if (a[j] > a[j + 1]) { - int temp = a[j]; - a[j] = a[j + 1]; - a[j + 1] = temp; - } - } - } -} //end diff --git a/codes/MaxLeton/17212371.java b/codes/MaxLeton/17212371.java deleted file mode 100644 index 4fe168de370c66365f5713fe8aa4aad2854eb4c7..0000000000000000000000000000000000000000 --- a/codes/MaxLeton/17212371.java +++ /dev/null @@ -1,17 +0,0 @@ -/** - * 冒泡排序函数 - * aa bb cc - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - for(int i = 0; i < n - 1; i++) { - for(int j = 0; j< n - i - 1; j++) { - if (a[j] > a[j + 1]) { - int temp = a[j]; - a[j] = a[j + 1]; - a[j + 1] = temp; - } - } - } -} //end diff --git a/codes/Melantha/15775251.java b/codes/Melantha/15775251.java deleted file mode 100644 index 70c8383992ad7d00091df3c051f6da2f395e1aec..0000000000000000000000000000000000000000 --- a/codes/Melantha/15775251.java +++ /dev/null @@ -1,36 +0,0 @@ - /** - - * 冒泡排序函数 - - * 功能：对输入的数组进行冒泡排序 - - * @param a 待排序的数组 - - * @param n 待排序的数组长度 - - */ - - public static void bubbleSort(int [] a, int n){ - - for (int i = 0; i < n - 1; i++) { - - for (int j = 0; j < n - i - 1; j++) { - - // 如果前一个元素大于后一个元素，则交换它们的位置 - - if (a[j] > a[j + 1]) { - - int temp = a[j]; - - a[j] = a[j + 1]; - - a[j + 1] = temp; - - } - - } - - } - - } //end - diff --git a/codes/Meng527/10036105.java b/codes/Meng527/10036105.java deleted file mode 100644 index 42e67aad9e029c8f4c3b18060f793ece1a13fd52..0000000000000000000000000000000000000000 --- a/codes/Meng527/10036105.java +++ /dev/null @@ -1,19 +0,0 @@ -/** - * 冒泡 排序 函数 - * aa bb cc - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - // 你的代码，使无序数组 a 变得有序 - for (int i = 0; i < n; i++) { - for (int j = 0; j < i; j++) { - if (a[i] < a[j]) { - int t = a[i]; - a[i] = a[j]; - a[j] = t; - } - } - } -}//end - diff --git a/codes/Monorepo/11203800.java b/codes/Monorepo/11203800.java deleted file mode 100644 index 326c3a0554691a64116fdb35f3b09a4a64bac4a6..0000000000000000000000000000000000000000 --- a/codes/Monorepo/11203800.java +++ /dev/null @@ -1,21 +0,0 @@ -/** - * 冒泡排序函数 - * aa bb cc - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - // 你的代码，使无序数组 a 变得有序 - for(int i = 0; i < n - 1; i++){ - for(int j = 0; j < n - 1 - i; j++){ - if(a[j] > a[j + 1]) - { - int swap = 0; - swap = a[j]; - a[j] = a[j+1]; - a[j+1] = swap; - } - } - } - -} //end \ No newline at end of file diff --git a/codes/Mrzhao/11115789.java b/codes/Mrzhao/11115789.java deleted file mode 100644 index 24b49b4b1fd01d1f21be8b362a582158452e41d3..0000000000000000000000000000000000000000 --- a/codes/Mrzhao/11115789.java +++ /dev/null @@ -1,19 +0,0 @@ -/** - * 冒泡排序函数 - * aa bb cc - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - // 你的代码，使无序数组 a 变得有序 - for(int i = 0 ; i < n - 1 ; i++){ - for(int j = 0 ; j < n - 1 - i ; j++){ - if(a[j] > a[j + 1]){ - int tmp = a[j]; - a[j] = a[j + 1]; - a[j + 1] = tmp; - } - } - } - -} //end \ No newline at end of file diff --git a/codes/Mu2024s/.keep b/codes/Mu2024s/.keep deleted file mode 100644 index e69de29bb2d1d6434b8b29ae775ad8c2e48c5391..0000000000000000000000000000000000000000 diff --git a/codes/Mu2024s/15843378.java b/codes/Mu2024s/15843378.java deleted file mode 100644 index 6e9861fa3ec6d5a2553cdccd1bb1e977430c671b..0000000000000000000000000000000000000000 --- a/codes/Mu2024s/15843378.java +++ /dev/null @@ -1,19 +0,0 @@ -/** - * 冒泡排序函数 - * aa bb cc - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - // 你的代码，使无序数组 a 变得有序 - for (int i = 0; i < n - 1; i++) { - for (int j = 0; j < n - i - 1; j++) { - if (a[j] > a[j + 1]) { - - int temp = a[j]; - a[j] = a[j + 1]; - a[j + 1] = temp; - } - } - } -} //end \ No newline at end of file diff --git a/codes/MuZiNan/.15657839.java.swp b/codes/MuZiNan/.15657839.java.swp deleted file mode 100644 index 09374482e60ca124f6bc6c7d84df8b257de59da0..0000000000000000000000000000000000000000 Binary files a/codes/MuZiNan/.15657839.java.swp and /dev/null differ diff --git a/codes/MuZiNan/10041393.java b/codes/MuZiNan/10041393.java deleted file mode 100644 index 7259ea268cf9a8941f87f19ca379946024c29c4c..0000000000000000000000000000000000000000 --- a/codes/MuZiNan/10041393.java +++ /dev/null @@ -1,18 +0,0 @@ -/** - * 冒泡排序函数 - * aa bb cc - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a,int n){ - for(int i = 0; i < n-1 ; i++){ - for (int j = 0;j < n-1-i;j++){ - if(a[j] > a[j+1]){ - int temp = a[j]; - a[j] = a[j+1]; - a[j+1] = temp; - } - } - } -} - diff --git a/codes/MuZiNan/15657839.java b/codes/MuZiNan/15657839.java deleted file mode 100644 index 51d71b839734af55652e8a90493143d1142e9f7b..0000000000000000000000000000000000000000 --- a/codes/MuZiNan/15657839.java +++ /dev/null @@ -1,17 +0,0 @@ -/** - * 冒泡排序函数 - * aa bb cc - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a,int n){ - for(int i = 0; i < n-1 ; i++){ - for (int j = 0;j < n-1-i;j++){ - if(a[j] > a[j+1]){ - int temp = a[j]; - a[j] = a[j+1]; - a[j+1] = temp; - } - } - } -} diff --git a/codes/Muzizy/15639710.java b/codes/Muzizy/15639710.java deleted file mode 100644 index c2afaa2414da1853e4500b02c6de9068b64aeafe..0000000000000000000000000000000000000000 --- a/codes/Muzizy/15639710.java +++ /dev/null @@ -1,18 +0,0 @@ -/** - * 冒泡排序函数 - * aa bb cc - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - for(int i = 0; i < n-1 ; i++){ - for (int j = 0;j < n-1-i;j++){ - if(a[j] > a[j+1]){ - int temp = a[j]; - a[j] = a[j+1]; - a[j+1] = temp; - } - } - } - -} //end diff --git a/codes/Myron520/15614791.java b/codes/Myron520/15614791.java deleted file mode 100644 index e5ce3441552dd06706ba79382d6f2f719655d2d5..0000000000000000000000000000000000000000 --- a/codes/Myron520/15614791.java +++ /dev/null @@ -1,23 +0,0 @@ -/** - * 冒泡排序函数 - * aa bb cc - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - // 你的代码，使无序数组 a 变得有序 - int i, j; - - for (i = n - 1; i > 0; i--) { - // 将a[0...i]中最大的数据放在末尾 - for (j = 0; j < i; j++) { - - if (a[j] > a[j + 1]) { - // 交换a[j]和a[j+1] - int tmp = a[j]; - a[j] = a[j + 1]; - a[j + 1] = tmp; - } - } - } -} //end diff --git a/codes/N193560C/15816303.java b/codes/N193560C/15816303.java deleted file mode 100644 index 8a9fb77715574062dc84306babe1fe613d81637f..0000000000000000000000000000000000000000 --- a/codes/N193560C/15816303.java +++ /dev/null @@ -1,18 +0,0 @@ -/** - * 冒泡排序函数 - * 使用冒泡排序算法对数组进行升序排序 - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - for (int i = 0; i < n - 1; i++) { - for (int j = 0; j < n - i - 1; j++) { - // 如果前一个元素大于后一个元素，则交换它们的位置 - if (a[j] > a[j + 1]) { - int temp = a[j]; - a[j] = a[j + 1]; - a[j + 1] = temp; - } - } - } -} //end diff --git a/codes/NANF41/11116589.java b/codes/NANF41/11116589.java deleted file mode 100644 index 2289d8d3c812b3aecf7020370a798acfdcad1bcb..0000000000000000000000000000000000000000 --- a/codes/NANF41/11116589.java +++ /dev/null @@ -1,18 +0,0 @@ -/** - * 冒泡排序函数 - * aa bb cc - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - // 你的代码，使无序数组 a 变得有序 -for(int i = 0 ; i < n - 1 ; i++){ - for(int j = 0 ; j < n - 1 - i ; j++){ - if(a[j] > a[j + 1]){ - int tmp = a[j]; - a[j] = a[j + 1]; - a[j + 1] = tmp; - } - } - } -} //end \ No newline at end of file diff --git a/codes/NPUlhy/18473575.java b/codes/NPUlhy/18473575.java deleted file mode 100644 index 608b696218c6e24c1f4d0dcf7998660914987c08..0000000000000000000000000000000000000000 --- a/codes/NPUlhy/18473575.java +++ /dev/null @@ -1,21 +0,0 @@ -/** - * 冒泡排序函数 - * aa bb cc - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - - // 你的代码，使无序数组 a 变得有序 - int b = 0; - for(int i = 0; i < n-1;i++){ - for(int j = 0; j < n-1-i;j++){ - if(a[j] > a[j + 1]){ - b = a[j+1]; - a[j+1] = a[j]; - a[j] = b; - } - } - } - -} //end diff --git a/codes/NProgress/11324505.java b/codes/NProgress/11324505.java deleted file mode 100644 index cdabc2e0876ad629e41ff055727cf3af34be8917..0000000000000000000000000000000000000000 --- a/codes/NProgress/11324505.java +++ /dev/null @@ -1,20 +0,0 @@ -/** - * 冒泡排序函数 - * aa bb cc - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - // 你的代码，使无序数组 a 变得有序 - for (int i = 0; i < n; i++) { - for (int j = i + 1; j < n; j++) { - if (a[i] > a[j]) { - int temp = a[j]; - a[j] = a[i]; - a[i] = temp; - - } - } - } - -} //end \ No newline at end of file diff --git a/codes/NX9990/15752874.java b/codes/NX9990/15752874.java deleted file mode 100644 index c2afaa2414da1853e4500b02c6de9068b64aeafe..0000000000000000000000000000000000000000 --- a/codes/NX9990/15752874.java +++ /dev/null @@ -1,18 +0,0 @@ -/** - * 冒泡排序函数 - * aa bb cc - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - for(int i = 0; i < n-1 ; i++){ - for (int j = 0;j < n-1-i;j++){ - if(a[j] > a[j+1]){ - int temp = a[j]; - a[j] = a[j+1]; - a[j+1] = temp; - } - } - } - -} //end diff --git a/codes/NXJ19563886818/15812590.java b/codes/NXJ19563886818/15812590.java deleted file mode 100644 index 166dea5db31166b381f11f50cf27b5f36311847d..0000000000000000000000000000000000000000 --- a/codes/NXJ19563886818/15812590.java +++ /dev/null @@ -1,19 +0,0 @@ -/** - * 冒泡排序函数 - * 该函数通过冒泡排序算法对数组进行排序 - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int[] a, int n) { - for (int i = 0; i < n - 1; i++) { // 外层循环控制比较轮数 - for (int j = 0; j < n - 1 - i; j++) { // 内层循环控制每轮的比较次数 - // 如果前一个元素大于后一个元素，则交换它们的位置 - if (a[j] > a[j + 1]) { - // 交换元素 - int temp = a[j]; - a[j] = a[j + 1]; - a[j + 1] = temp; - } - } - } -} //end diff --git a/codes/Namesp4ces/.keep b/codes/Namesp4ces/.keep deleted file mode 100644 index e69de29bb2d1d6434b8b29ae775ad8c2e48c5391..0000000000000000000000000000000000000000 diff --git a/codes/Namesp4ces/15839516.java b/codes/Namesp4ces/15839516.java deleted file mode 100644 index 6e9861fa3ec6d5a2553cdccd1bb1e977430c671b..0000000000000000000000000000000000000000 --- a/codes/Namesp4ces/15839516.java +++ /dev/null @@ -1,19 +0,0 @@ -/** - * 冒泡排序函数 - * aa bb cc - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - // 你的代码，使无序数组 a 变得有序 - for (int i = 0; i < n - 1; i++) { - for (int j = 0; j < n - i - 1; j++) { - if (a[j] > a[j + 1]) { - - int temp = a[j]; - a[j] = a[j + 1]; - a[j + 1] = temp; - } - } - } -} //end \ No newline at end of file diff --git a/codes/Navigation1/11130536.java b/codes/Navigation1/11130536.java deleted file mode 100644 index 24b49b4b1fd01d1f21be8b362a582158452e41d3..0000000000000000000000000000000000000000 --- a/codes/Navigation1/11130536.java +++ /dev/null @@ -1,19 +0,0 @@ -/** - * 冒泡排序函数 - * aa bb cc - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - // 你的代码，使无序数组 a 变得有序 - for(int i = 0 ; i < n - 1 ; i++){ - for(int j = 0 ; j < n - 1 - i ; j++){ - if(a[j] > a[j + 1]){ - int tmp = a[j]; - a[j] = a[j + 1]; - a[j + 1] = tmp; - } - } - } - -} //end \ No newline at end of file diff --git a/codes/NeilGCT/15827010.java b/codes/NeilGCT/15827010.java deleted file mode 100644 index b0f1eff4c06a63e01b7cdbd853110268808c8d7d..0000000000000000000000000000000000000000 --- a/codes/NeilGCT/15827010.java +++ /dev/null @@ -1,17 +0,0 @@ -/** - * 冒泡排序函数 - * 该函数使用冒泡排序算法对整数数组进行排序 - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int[] a, int n) { - for (int i = 0; i < n - 1; i++) { // 外层循环控制排序的轮数 - for (int j = 0; j < n - i - 1; j++) { // 内层循环控制每一轮的比较次数 - if (a[j] > a[j + 1]) { // 如果当前元素大于下一个元素，则交换它们的位置 - int temp = a[j]; - a[j] = a[j + 1]; - a[j + 1] = temp; - } - } - } -} // end diff --git a/codes/Ni123456/15562619.java b/codes/Ni123456/15562619.java deleted file mode 100644 index c2afaa2414da1853e4500b02c6de9068b64aeafe..0000000000000000000000000000000000000000 --- a/codes/Ni123456/15562619.java +++ /dev/null @@ -1,18 +0,0 @@ -/** - * 冒泡排序函数 - * aa bb cc - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - for(int i = 0; i < n-1 ; i++){ - for (int j = 0;j < n-1-i;j++){ - if(a[j] > a[j+1]){ - int temp = a[j]; - a[j] = a[j+1]; - a[j+1] = temp; - } - } - } - -} //end diff --git a/codes/Ni123456/15630872.java b/codes/Ni123456/15630872.java deleted file mode 100644 index c2afaa2414da1853e4500b02c6de9068b64aeafe..0000000000000000000000000000000000000000 --- a/codes/Ni123456/15630872.java +++ /dev/null @@ -1,18 +0,0 @@ -/** - * 冒泡排序函数 - * aa bb cc - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - for(int i = 0; i < n-1 ; i++){ - for (int j = 0;j < n-1-i;j++){ - if(a[j] > a[j+1]){ - int temp = a[j]; - a[j] = a[j+1]; - a[j+1] = temp; - } - } - } - -} //end diff --git a/codes/OPReno/11276365.java b/codes/OPReno/11276365.java deleted file mode 100644 index cacd12f1e4e4360dd1ffa22f3741e376110bcde4..0000000000000000000000000000000000000000 --- a/codes/OPReno/11276365.java +++ /dev/null @@ -1,18 +0,0 @@ -/** - * 冒泡排序函数 - * aa bb cc - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - // 你的代码，使无序数组 a 变得有序 - for(int i=0;ia[j+1]){ - a[j] = a[j]+a[j+1]; - a[j+1] = a[j]-a[j+1]; - a[j] = a[j]-a[j+1]; - } - } - } -} //end \ No newline at end of file diff --git a/codes/OVO16199/15832632.java b/codes/OVO16199/15832632.java deleted file mode 100644 index d0e7038df81a1dcd40ba57e5267839caad594f03..0000000000000000000000000000000000000000 --- a/codes/OVO16199/15832632.java +++ /dev/null @@ -1,19 +0,0 @@ -/** - * 冒泡排序函数 - * 冒泡排序是一种简单的排序算法，它重复地遍历要排序的数列，一次比较两个元素，如果他们的顺序错误就把他们交换过来。 - * 遍历数列的工作是重复地进行直到没有再需要交换，也就是说该数列已经排序完成。 - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - for (int i = 0; i < n - 1; i++) { // 外层循环控制比较的次数 - for (int j = 0; j < n - 1 - i; j++) { // 内层循环控制每一轮比较的次数 - // 如果前一个元素比后一个元素大，则交换它们的位置 - if (a[j] > a[j + 1]) { - int temp = a[j]; - a[j] = a[j + 1]; - a[j + 1] = temp; - } - } - } -} //end diff --git a/codes/OceanBase/11302025.java b/codes/OceanBase/11302025.java deleted file mode 100644 index 9e7534d4b41cf071c848fa4d5c08c6519526b6e3..0000000000000000000000000000000000000000 --- a/codes/OceanBase/11302025.java +++ /dev/null @@ -1,18 +0,0 @@ -/** - * 冒泡 排序 函数 - * aa bb cc - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - // 你的代码，使无序数组 a 变得有序 - for (int i = 0; i < n; i++) { - for (int j = 0; j < i; j++) { - if (a[i] < a[j]) { - int t = a[i]; - a[i] = a[j]; - a[j] = t; - } - } - } -}//end \ No newline at end of file diff --git a/codes/Ohiyo123ywj/.keep b/codes/Ohiyo123ywj/.keep deleted file mode 100644 index e69de29bb2d1d6434b8b29ae775ad8c2e48c5391..0000000000000000000000000000000000000000 diff --git a/codes/Ohiyo123ywj/15843898.java b/codes/Ohiyo123ywj/15843898.java deleted file mode 100644 index 6e9861fa3ec6d5a2553cdccd1bb1e977430c671b..0000000000000000000000000000000000000000 --- a/codes/Ohiyo123ywj/15843898.java +++ /dev/null @@ -1,19 +0,0 @@ -/** - * 冒泡排序函数 - * aa bb cc - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - // 你的代码，使无序数组 a 变得有序 - for (int i = 0; i < n - 1; i++) { - for (int j = 0; j < n - i - 1; j++) { - if (a[j] > a[j + 1]) { - - int temp = a[j]; - a[j] = a[j + 1]; - a[j + 1] = temp; - } - } - } -} //end \ No newline at end of file diff --git a/codes/OnMoreTime/10860781.java b/codes/OnMoreTime/10860781.java deleted file mode 100644 index c05a772d83b85c60bdcae220bf3d2ed176d8e54c..0000000000000000000000000000000000000000 --- a/codes/OnMoreTime/10860781.java +++ /dev/null @@ -1,24 +0,0 @@ -/** - * 冒泡排序函数 - * aa bb cc - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - // 你的代码，使无序数组 a 变得有序 - int temp; - for (int i = 0; i < n - 1; i++) { - int count = 0; - for (int j = 0; j < n - 1 - i; j++) { - if (a[j] > a[j + 1]) { - temp = a[j]; - a[j] = a[j + 1]; - a[j + 1] = temp; - count++; - } - } - if (count == 0) { - break; - } - } -} //end diff --git a/codes/OneMuMu/11370801.java b/codes/OneMuMu/11370801.java deleted file mode 100644 index 1c8889947f924214c71a3c3f202500b4780dc281..0000000000000000000000000000000000000000 --- a/codes/OneMuMu/11370801.java +++ /dev/null @@ -1,11 +0,0 @@ -public static void bubbleSort(int [] a,int n){ - for(int i = 0; i < n-1 ; i++){ - for (int j = 0;j < n-1-i;j++){ - if(a[j] > a[j+1]){ - int temp = a[j]; - a[j] = a[j+1]; - a[j+1] = temp; - } - } - } -} \ No newline at end of file diff --git a/codes/OutlEts/11343931.java b/codes/OutlEts/11343931.java deleted file mode 100644 index 8d589d7edfe50246fe5deff283186d81a64dc137..0000000000000000000000000000000000000000 --- a/codes/OutlEts/11343931.java +++ /dev/null @@ -1,21 +0,0 @@ -/** - * 冒泡排序函数 - * aa bb cc - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a,int n){ - int temp =0; - for(int i = 0;ia[j+1]){ - temp = a[j]; - a[j] = a[j+1]; - a[j+1] = temp; - } - } - } - - - -} \ No newline at end of file diff --git a/codes/P4rt01/15689858.java b/codes/P4rt01/15689858.java deleted file mode 100644 index 854beb62bfcf4ead3549d682ffca7f1b9f32d947..0000000000000000000000000000000000000000 --- a/codes/P4rt01/15689858.java +++ /dev/null @@ -1,19 +0,0 @@ -/** - * 冒泡排序函数 - * aa bb cc - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - for(int i = 0; i < n-1 ; i++){ - for (int j = 0;j < n-1-i;j++){ - if(a[j] > a[j+1]){ - int temp = a[j]; - a[j] = a[j+1]; - a[j+1] = temp; - } - } - } - -} //end - diff --git a/codes/PHPhph/11120724.java b/codes/PHPhph/11120724.java deleted file mode 100644 index b9bf7818d9ffdce1bf2bd0863a51890bffa3f951..0000000000000000000000000000000000000000 --- a/codes/PHPhph/11120724.java +++ /dev/null @@ -1,11 +0,0 @@ -public static void bubbleSort(int [] a, int n) { - for (int i=0 ; ia[j+1]) { - int temp=a[j]; - a[j]=a[j+1]; - a[j+1]=temp; - } - } - } -} \ No newline at end of file diff --git a/codes/PUAdewo/11303488.java b/codes/PUAdewo/11303488.java deleted file mode 100644 index 4d7083fe05ce3e6d3fadd59d6d55e2cbc50d546d..0000000000000000000000000000000000000000 --- a/codes/PUAdewo/11303488.java +++ /dev/null @@ -1,22 +0,0 @@ -/** - * 冒泡排序函数 - * aa bb cc - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - // 你的代码，使无序数组 a 变得有序 - int i, j; - - for(i=0; ia[j]){ - int temp; - temp = a[j-1]; - a[j-1] = a[j]; - a[j] = temp; - } - } - } - -} //end \ No newline at end of file diff --git a/codes/Pengyouyou/15805929.java b/codes/Pengyouyou/15805929.java deleted file mode 100644 index 24f513b3219ac31ac3dcffe774647aa7bfdac254..0000000000000000000000000000000000000000 --- a/codes/Pengyouyou/15805929.java +++ /dev/null @@ -1,11 +0,0 @@ -public static void bubbleSort(int [] a, int n){ - for (int i = 0; i < n - 1; i++) { - for (int j = 0; j < n - 1 - i; j++) { - if (a[j] > a[j + 1]) { - int temp = a[j]; - a[j] = a[j + 1]; - a[j + 1] = temp; - } - } - } -} diff --git a/codes/PexoPexo/11116939.java b/codes/PexoPexo/11116939.java deleted file mode 100644 index 9e7534d4b41cf071c848fa4d5c08c6519526b6e3..0000000000000000000000000000000000000000 --- a/codes/PexoPexo/11116939.java +++ /dev/null @@ -1,18 +0,0 @@ -/** - * 冒泡 排序 函数 - * aa bb cc - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - // 你的代码，使无序数组 a 变得有序 - for (int i = 0; i < n; i++) { - for (int j = 0; j < i; j++) { - if (a[i] < a[j]) { - int t = a[i]; - a[i] = a[j]; - a[j] = t; - } - } - } -}//end \ No newline at end of file diff --git a/codes/Platform/11203867.java b/codes/Platform/11203867.java deleted file mode 100644 index cdabc2e0876ad629e41ff055727cf3af34be8917..0000000000000000000000000000000000000000 --- a/codes/Platform/11203867.java +++ /dev/null @@ -1,20 +0,0 @@ -/** - * 冒泡排序函数 - * aa bb cc - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - // 你的代码，使无序数组 a 变得有序 - for (int i = 0; i < n; i++) { - for (int j = i + 1; j < n; j++) { - if (a[i] > a[j]) { - int temp = a[j]; - a[j] = a[i]; - a[i] = temp; - - } - } - } - -} //end \ No newline at end of file diff --git a/codes/PunkHeart/16456064.java b/codes/PunkHeart/16456064.java deleted file mode 100644 index e3d6f7763366639b3ef5f5aa59fd37efd7287cc3..0000000000000000000000000000000000000000 --- a/codes/PunkHeart/16456064.java +++ /dev/null @@ -1,19 +0,0 @@ -/** - * 冒泡排序函数 - * aa bb cc - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - //代码，使无序数组a变得有序 - for (int i = 0; i < n - 1;i++){ - for (int j = 0; j< n - i - 1; j++){ - if (a[j] > a[j + 1]){ - int temp = a[j]; - a[j] = a[j + 1]; - a[j + 1] = temp; - } - } - } - -} //end diff --git a/codes/Q13944328337/15841142.java b/codes/Q13944328337/15841142.java deleted file mode 100644 index 47e0d6efa8bfa49fe95c91537dccda0c09563b63..0000000000000000000000000000000000000000 --- a/codes/Q13944328337/15841142.java +++ /dev/null @@ -1,18 +0,0 @@ -/** - * 冒泡排序函数 - * 功能：对数组进行升序排序 - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int[] a, int n) { - for (int i = 0; i < n - 1; i++) { // 遍历数组，从第一个元素到倒数第二个元素 - for (int j = 0; j < n - 1 - i; j++) { // 每次比较相邻的元素，最后一个元素已经是当前轮的最大值，无需再比较 - if (a[j] > a[j + 1]) { // 如果前一个元素大于后一个元素，则交换它们的位置 - // 交换 a[j] 和 a[j+1] - int temp = a[j]; - a[j] = a[j + 1]; - a[j + 1] = temp; - } - } - } -} // end diff --git a/codes/Q18379787658/15861304.java b/codes/Q18379787658/15861304.java deleted file mode 100644 index 54c5f3869cd16ee9e7c2b77895a39fae63f05dbc..0000000000000000000000000000000000000000 --- a/codes/Q18379787658/15861304.java +++ /dev/null @@ -1,20 +0,0 @@ -/** - * 冒泡排序函数 - * aa bb cc - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - // 你的代码，使无序数组 a 变得有序 - for(int i = 0; i < n; i++) { - for(int liuy = 0; liuy < n - i - 1; liuy++) { - if(a[liuy] > a[liuy + 1]) { - int temp = a[liuy]; - a [liuy] = a[liuy + 1]; - a[liuy + 1] = temp; - } - } - } - - -} //end,liuy \ No newline at end of file diff --git a/codes/Q2529807676/15563540.java b/codes/Q2529807676/15563540.java deleted file mode 100644 index ae82e695cbfd360050241c3f1f592658c8c1d4e7..0000000000000000000000000000000000000000 --- a/codes/Q2529807676/15563540.java +++ /dev/null @@ -1,35 +0,0 @@ -/** - - * 冒泡排序函数 - - * aa bb cc - - * @param a 待排序的数组 - - * @param n 待排序的数组长度 - - */ - -public static void bubbleSort(int [] a, int n){ - - for(int i = 0; i < n-1 ; i++){ - - for (int j = 0;j < n-1-i;j++){ - - if(a[j] > a[j+1]){ - - int temp = a[j]; - - a[j] = a[j+1]; - - a[j+1] = temp; - - } - - } - - } - - - -} //end diff --git a/codes/Q8888688888/11213062.java b/codes/Q8888688888/11213062.java deleted file mode 100644 index cacd12f1e4e4360dd1ffa22f3741e376110bcde4..0000000000000000000000000000000000000000 --- a/codes/Q8888688888/11213062.java +++ /dev/null @@ -1,18 +0,0 @@ -/** - * 冒泡排序函数 - * aa bb cc - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - // 你的代码，使无序数组 a 变得有序 - for(int i=0;ia[j+1]){ - a[j] = a[j]+a[j+1]; - a[j+1] = a[j]-a[j+1]; - a[j] = a[j]-a[j+1]; - } - } - } -} //end \ No newline at end of file diff --git a/codes/QQ504113939/15788225.java b/codes/QQ504113939/15788225.java deleted file mode 100644 index 33be1b95e65b4aac0ebce48bfeb09323f568c4f7..0000000000000000000000000000000000000000 --- a/codes/QQ504113939/15788225.java +++ /dev/null @@ -1,19 +0,0 @@ -/** -* 冒泡排序函数 -* aa bb cc -* @param a 待排序的数组 -* @param n 待排序的数组长度 -*/ -public static void bubbleSort(int [] a, int n){ -// 你的代码，使无序数组 a 变得有序 -for (int i = 0; i < n - 1; i++) { -for (int j = 0; j < n - i - 1; j++) { -if (a[j] > a[j + 1]) { -// 交换元素 -int temp = a[j]; -a[j] = a[j + 1]; -a[j + 1] = temp; -} -} -} -} //end diff --git a/codes/QiQi77/15719621.java b/codes/QiQi77/15719621.java deleted file mode 100644 index 5b72062d2b1ddce9651234f7c8f7a161c1fda294..0000000000000000000000000000000000000000 --- a/codes/QiQi77/15719621.java +++ /dev/null @@ -1,27 +0,0 @@ -/** - * 冒泡排序函数 - * 通过相邻元素之间的比较和交换，将最大的元素“冒泡”到数组的末尾 - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - for (int i = 0; i < n - 1; i++) { - // 标记是否有交换发生，用于优化，如果这一趟没有交换，说明已经有序 - boolean swapped = false; - for (int j = 0; j < n - i - 1; j++) { - // 如果当前元素大于下一个元素，则交换它们 - if (a[j] > a[j + 1]) { - // 交换元素 - int temp = a[j]; - a[j] = a[j + 1]; - a[j + 1] = temp; - // 标记发生了交换 - swapped = true; - } - } - // 如果没有发生交换，说明数组已经有序，可以提前结束排序 - if (!swapped) { - break; - } - } -} //end diff --git a/codes/Qking123/.15572198.java.swp b/codes/Qking123/.15572198.java.swp deleted file mode 100644 index 17a500efb8338413057a3263ea6b3bd86e91a689..0000000000000000000000000000000000000000 Binary files a/codes/Qking123/.15572198.java.swp and /dev/null differ diff --git a/codes/Qking123/15572198.java b/codes/Qking123/15572198.java deleted file mode 100644 index 13964cf88a3816898961bf686295ad15ef199de5..0000000000000000000000000000000000000000 --- a/codes/Qking123/15572198.java +++ /dev/null @@ -1,39 +0,0 @@ -/** - * 冒泡排序函数 - * aa bb cc - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -/*pulick static void bubbleSort(int []a, int n) { - boolean flag = false; - for (int i = 0; i < n; i++) { - // 每轮遍历将最大的数移到末尾 - for (int j = 0; j < n - i - 1; j++) { - if (a[j] > a[j+1]) { - int temp = a[j]; - a[j] = a[j+1]; - a[j+1] = temp; - } - } - if (flag == false){ - break; - }else { - flag = false; - } - } -} //end -*/ -public static void bubbleSort(int [] a, int n){ - // 你的代码，使无序数组 a 变得有序 - for (int i = 0; i < n; i++) { - for (int j = i + 1; j < n; j++) { - if (a[i] > a[j]) { - int temp = a[j]; - a[j] = a[i]; - a[i] = temp; - - } - } - } - -} //end diff --git a/codes/Qw2229188799/11089611.java b/codes/Qw2229188799/11089611.java deleted file mode 100644 index 9e7534d4b41cf071c848fa4d5c08c6519526b6e3..0000000000000000000000000000000000000000 --- a/codes/Qw2229188799/11089611.java +++ /dev/null @@ -1,18 +0,0 @@ -/** - * 冒泡 排序 函数 - * aa bb cc - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - // 你的代码，使无序数组 a 变得有序 - for (int i = 0; i < n; i++) { - for (int j = 0; j < i; j++) { - if (a[i] < a[j]) { - int t = a[i]; - a[i] = a[j]; - a[j] = t; - } - } - } -}//end \ No newline at end of file diff --git a/codes/Qw25526/11118523.java b/codes/Qw25526/11118523.java deleted file mode 100644 index 2289d8d3c812b3aecf7020370a798acfdcad1bcb..0000000000000000000000000000000000000000 --- a/codes/Qw25526/11118523.java +++ /dev/null @@ -1,18 +0,0 @@ -/** - * 冒泡排序函数 - * aa bb cc - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - // 你的代码，使无序数组 a 变得有序 -for(int i = 0 ; i < n - 1 ; i++){ - for(int j = 0 ; j < n - 1 - i ; j++){ - if(a[j] > a[j + 1]){ - int tmp = a[j]; - a[j] = a[j + 1]; - a[j + 1] = tmp; - } - } - } -} //end \ No newline at end of file diff --git a/codes/Renswc/15592706.java b/codes/Renswc/15592706.java deleted file mode 100644 index ae82e695cbfd360050241c3f1f592658c8c1d4e7..0000000000000000000000000000000000000000 --- a/codes/Renswc/15592706.java +++ /dev/null @@ -1,35 +0,0 @@ -/** - - * 冒泡排序函数 - - * aa bb cc - - * @param a 待排序的数组 - - * @param n 待排序的数组长度 - - */ - -public static void bubbleSort(int [] a, int n){ - - for(int i = 0; i < n-1 ; i++){ - - for (int j = 0;j < n-1-i;j++){ - - if(a[j] > a[j+1]){ - - int temp = a[j]; - - a[j] = a[j+1]; - - a[j+1] = temp; - - } - - } - - } - - - -} //end diff --git a/codes/Rudy1113693166/15803796.java b/codes/Rudy1113693166/15803796.java deleted file mode 100644 index ce4123f36198ecb034f9ba60dd9025622afaf314..0000000000000000000000000000000000000000 --- a/codes/Rudy1113693166/15803796.java +++ /dev/null @@ -1,18 +0,0 @@ -/** - * 冒泡排序函数 - * 通过相邻元素两两比较和交换，使得每一轮过后最大（或最小）的元素被交换到序列末尾 - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - for (int i = 0; i < n - 1; i++) { // 外层循环控制排序的轮数 - for (int j = 0; j < n - 1 - i; j++) { // 内层循环控制每轮的比较次数 - if (a[j] > a[j + 1]) { // 如果前一个元素大于后一个元素，则交换它们 - // 交换 a[j] 和 a[j+1] - int temp = a[j]; - a[j] = a[j + 1]; - a[j + 1] = temp; - } - } - } -} //end diff --git a/codes/S17673074125/15793739.java b/codes/S17673074125/15793739.java deleted file mode 100644 index cf9befa49e98ccbe1d988b8a5353d8a6936cd135..0000000000000000000000000000000000000000 --- a/codes/S17673074125/15793739.java +++ /dev/null @@ -1,21 +0,0 @@ -/** - * 冒泡排序函数 - * 该函数对输入的数组进行升序排序 - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int[] a, int n) { - // 遍历所有数组元素 - for (int i = 0; i < n - 1; i++) { - // Last i elements are already in place - for (int j = 0; j < n - i - 1; j++) { - // 如果当前元素大于下一个元素，则交换它们 - if (a[j] > a[j + 1]) { - // 交换 a[j] 和 a[j+1] - int temp = a[j]; - a[j] = a[j + 1]; - a[j + 1] = temp; - } - } - } -} // end diff --git a/codes/S19353041250/15722104.java b/codes/S19353041250/15722104.java deleted file mode 100644 index f9a5325479d5d92111254a6775f3a8ad89cd6c83..0000000000000000000000000000000000000000 --- a/codes/S19353041250/15722104.java +++ /dev/null @@ -1,26 +0,0 @@ -/** - * 冒泡排序函数 - * 遍历数组，比较相邻元素，如果顺序错误则交换它们，重复这个过程直到没有需要交换的元素为止。 - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - for (int i = 0; i < n - 1; i++) { - // 标志位，用于标记本趟是否有交换，如果没有交换则已经有序，无需再继续比较 - boolean swapped = false; - for (int j = 0; j < n - i - 1; j++) { - // 如果前一个元素大于后一个元素，则交换它们 - if (a[j] > a[j + 1]) { - int temp = a[j]; - a[j] = a[j + 1]; - a[j + 1] = temp; - // 发生了交换，标志位设为true - swapped = true; - } - } - // 如果没有交换，则说明数组已经有序，无需继续后面的趟 - if (!swapped) { - break; - } - } -} //end diff --git a/codes/SHALRU/15632282.java b/codes/SHALRU/15632282.java deleted file mode 100644 index c2afaa2414da1853e4500b02c6de9068b64aeafe..0000000000000000000000000000000000000000 --- a/codes/SHALRU/15632282.java +++ /dev/null @@ -1,18 +0,0 @@ -/** - * 冒泡排序函数 - * aa bb cc - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - for(int i = 0; i < n-1 ; i++){ - for (int j = 0;j < n-1-i;j++){ - if(a[j] > a[j+1]){ - int temp = a[j]; - a[j] = a[j+1]; - a[j+1] = temp; - } - } - } - -} //end diff --git a/codes/SJq123456/.keep b/codes/SJq123456/.keep deleted file mode 100644 index e69de29bb2d1d6434b8b29ae775ad8c2e48c5391..0000000000000000000000000000000000000000 diff --git a/codes/SJq123456/15846703.java b/codes/SJq123456/15846703.java deleted file mode 100644 index 6e9861fa3ec6d5a2553cdccd1bb1e977430c671b..0000000000000000000000000000000000000000 --- a/codes/SJq123456/15846703.java +++ /dev/null @@ -1,19 +0,0 @@ -/** - * 冒泡排序函数 - * aa bb cc - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - // 你的代码，使无序数组 a 变得有序 - for (int i = 0; i < n - 1; i++) { - for (int j = 0; j < n - i - 1; j++) { - if (a[j] > a[j + 1]) { - - int temp = a[j]; - a[j] = a[j + 1]; - a[j + 1] = temp; - } - } - } -} //end \ No newline at end of file diff --git a/codes/Sakura125809/15297826.java b/codes/Sakura125809/15297826.java deleted file mode 100644 index ada5cf3647b2fbe0a37eed18ae5227ed027ed4de..0000000000000000000000000000000000000000 --- a/codes/Sakura125809/15297826.java +++ /dev/null @@ -1,18 +0,0 @@ -/** - * 冒泡排序函数 - * aa bb cc - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - // 你的代码，使无序数组 a 变得有序 - for (int i = 0; i < n - 1; i++) { - for (int j = 0; j < n - i - 1; j++) { - if (a[j] > a[j + 1]) { - int temp = a[j]; - a[j] = a[j + 1]; - a[j + 1] = temp; - } - } - } -} //end diff --git a/codes/Setinsung/.java b/codes/Setinsung/.java deleted file mode 100644 index e69de29bb2d1d6434b8b29ae775ad8c2e48c5391..0000000000000000000000000000000000000000 diff --git a/codes/Setinsung/9697451.java b/codes/Setinsung/9697451.java deleted file mode 100644 index 7368d1f00c14d7407bad5e0d7a4bf4509df0e0cc..0000000000000000000000000000000000000000 --- a/codes/Setinsung/9697451.java +++ /dev/null @@ -1,19 +0,0 @@ - -/** - * 冒泡排序函数 - * aa bb cc - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - // 你的代码，使无序数组 a 变得有序 - for(int i=0;ia[j+1]){ - a[j] = a[j]+a[j+1]; - a[j+1] = a[j]-a[j+1]; - a[j] = a[j]-a[j+1]; - } - } - } -} //end diff --git a/codes/ShaoXuan/12173130.java b/codes/ShaoXuan/12173130.java deleted file mode 100644 index 689a8ca697591e6912972a93b43f62701255e690..0000000000000000000000000000000000000000 --- a/codes/ShaoXuan/12173130.java +++ /dev/null @@ -1,20 +0,0 @@ -/** - * 冒泡排序函数 - * aa bb cc - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - //你的代码，使无序数组 a 变得有序 - int temp = 0; - - for(int i=0; i a[j+1]){ - temp = a[j]; - a[j] = a[j+1]; - a[j+1] = temp; - } - } - } -} diff --git a/codes/Sharpery/15562912.java b/codes/Sharpery/15562912.java deleted file mode 100644 index c2afaa2414da1853e4500b02c6de9068b64aeafe..0000000000000000000000000000000000000000 --- a/codes/Sharpery/15562912.java +++ /dev/null @@ -1,18 +0,0 @@ -/** - * 冒泡排序函数 - * aa bb cc - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - for(int i = 0; i < n-1 ; i++){ - for (int j = 0;j < n-1-i;j++){ - if(a[j] > a[j+1]){ - int temp = a[j]; - a[j] = a[j+1]; - a[j+1] = temp; - } - } - } - -} //end diff --git a/codes/Shephatiah/18693174.java b/codes/Shephatiah/18693174.java deleted file mode 100644 index 9c9fea7e5a6f112ef881921d767eabc005fa9092..0000000000000000000000000000000000000000 --- a/codes/Shephatiah/18693174.java +++ /dev/null @@ -1,18 +0,0 @@ - /** - * 冒泡排序函数 - * aa bb cc - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ - public static void bubbleSort(int [] arr, int n){ - // 你的代码，使无序数组 a 变得有序 - for (int i = 0; i < n; i++) { - for (int j = (i + 1); j < n; j++) { - if (arr[i] > arr[j]) { - int temp = arr[i]; - arr[i] = arr[j]; - arr[j] = temp; - } - } - } - } //end diff --git a/codes/SherlockZ/10666019.java b/codes/SherlockZ/10666019.java deleted file mode 100644 index ab3d8f390cfa4cee1947d39872e75bac48b3058a..0000000000000000000000000000000000000000 --- a/codes/SherlockZ/10666019.java +++ /dev/null @@ -1,11 +0,0 @@ -public static void bubbleSort(int [] a, int n) { - for (int i=0 ; ia[j+1]) { - int temp=a[j]; - a[j]=a[j+1]; - a[j+1]=temp; - } - } - } -} diff --git a/codes/Shirley1/11532521.java b/codes/Shirley1/11532521.java deleted file mode 100644 index 9e7534d4b41cf071c848fa4d5c08c6519526b6e3..0000000000000000000000000000000000000000 --- a/codes/Shirley1/11532521.java +++ /dev/null @@ -1,18 +0,0 @@ -/** - * 冒泡 排序 函数 - * aa bb cc - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - // 你的代码，使无序数组 a 变得有序 - for (int i = 0; i < n; i++) { - for (int j = 0; j < i; j++) { - if (a[i] < a[j]) { - int t = a[i]; - a[i] = a[j]; - a[j] = t; - } - } - } -}//end \ No newline at end of file diff --git a/codes/Shirley1/15780774.java b/codes/Shirley1/15780774.java deleted file mode 100644 index 5edd6bf0e38372fd1654da46aeafd4941c42ddb7..0000000000000000000000000000000000000000 --- a/codes/Shirley1/15780774.java +++ /dev/null @@ -1,20 +0,0 @@ -/** - * 冒泡排序函数 - * aa bb cc - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - // 你的代码，使无序数组 a 变得有序 - for (int i = 0; i < n; i++) { - for (int j = i + 1; j < n; j++) { - if (a[i] > a[j]) { - int temp = a[j]; - a[j] = a[i]; - a[i] = temp; - - } - } - } - -} //end \ No newline at end of file diff --git a/codes/ShowBuger/11475929.java b/codes/ShowBuger/11475929.java deleted file mode 100644 index 24b49b4b1fd01d1f21be8b362a582158452e41d3..0000000000000000000000000000000000000000 --- a/codes/ShowBuger/11475929.java +++ /dev/null @@ -1,19 +0,0 @@ -/** - * 冒泡排序函数 - * aa bb cc - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - // 你的代码，使无序数组 a 变得有序 - for(int i = 0 ; i < n - 1 ; i++){ - for(int j = 0 ; j < n - 1 - i ; j++){ - if(a[j] > a[j + 1]){ - int tmp = a[j]; - a[j] = a[j + 1]; - a[j + 1] = tmp; - } - } - } - -} //end \ No newline at end of file diff --git a/codes/SmileWen/15629004.java b/codes/SmileWen/15629004.java deleted file mode 100644 index eb07640e6f61d4fcc7a225a2235da622a7f5ca3b..0000000000000000000000000000000000000000 --- a/codes/SmileWen/15629004.java +++ /dev/null @@ -1,27 +0,0 @@ -/** - * 冒泡排序函数 - * 该函数实现了冒泡排序算法，将数组a中的元素按升序排列 - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int[] a, int n) { - // 遍历所有数组元素 - for (int i = 0; i < n - 1; i++) { - // 标记变量，用于检查是否发生了交换 - boolean swapped = false; - for (int j = 0; j < n - i - 1; j++) { - // 如果当前元素大于下一个元素，则交换它们 - if (a[j] > a[j + 1]) { - int temp = a[j]; - a[j] = a[j + 1]; - a[j + 1] = temp; - // 标记已发生交换 - swapped = true; - } - } - // 如果内层循环没有发生交换，说明数组已经有序，可以提前退出 - if (!swapped) { - break; - } - } -} //end diff --git a/codes/Snngulaf/15527734.java b/codes/Snngulaf/15527734.java deleted file mode 100644 index b9f3f205791836ed8f2cbe07ba9344f6c861b74b..0000000000000000000000000000000000000000 --- a/codes/Snngulaf/15527734.java +++ /dev/null @@ -1,18 +0,0 @@ -/** - * 冒泡排序函数 - * aa bb cc - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - for(int i = 0; i < n-1 ; i++){ - for (int j = 0;j < n-1-i;j++){ - if(a[j] > a[j+1]){ - int temp = a[j]; - a[j] = a[j+1]; - a[j+1] = temp; - } - } - } - -} //end \ No newline at end of file diff --git a/codes/Snowfalls360/.keep b/codes/Snowfalls360/.keep deleted file mode 100644 index e69de29bb2d1d6434b8b29ae775ad8c2e48c5391..0000000000000000000000000000000000000000 diff --git a/codes/Snowfalls360/15843952.java b/codes/Snowfalls360/15843952.java deleted file mode 100644 index 6e9861fa3ec6d5a2553cdccd1bb1e977430c671b..0000000000000000000000000000000000000000 --- a/codes/Snowfalls360/15843952.java +++ /dev/null @@ -1,19 +0,0 @@ -/** - * 冒泡排序函数 - * aa bb cc - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - // 你的代码，使无序数组 a 变得有序 - for (int i = 0; i < n - 1; i++) { - for (int j = 0; j < n - i - 1; j++) { - if (a[j] > a[j + 1]) { - - int temp = a[j]; - a[j] = a[j + 1]; - a[j + 1] = temp; - } - } - } -} //end \ No newline at end of file diff --git a/codes/Springboot/11121747.java b/codes/Springboot/11121747.java deleted file mode 100644 index b9bf7818d9ffdce1bf2bd0863a51890bffa3f951..0000000000000000000000000000000000000000 --- a/codes/Springboot/11121747.java +++ /dev/null @@ -1,11 +0,0 @@ -public static void bubbleSort(int [] a, int n) { - for (int i=0 ; ia[j+1]) { - int temp=a[j]; - a[j]=a[j+1]; - a[j+1]=temp; - } - } - } -} \ No newline at end of file diff --git a/codes/Stonehuara/.keep b/codes/Stonehuara/.keep deleted file mode 100644 index e69de29bb2d1d6434b8b29ae775ad8c2e48c5391..0000000000000000000000000000000000000000 diff --git a/codes/Stonehuara/15845722.java b/codes/Stonehuara/15845722.java deleted file mode 100644 index 6e9861fa3ec6d5a2553cdccd1bb1e977430c671b..0000000000000000000000000000000000000000 --- a/codes/Stonehuara/15845722.java +++ /dev/null @@ -1,19 +0,0 @@ -/** - * 冒泡排序函数 - * aa bb cc - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - // 你的代码，使无序数组 a 变得有序 - for (int i = 0; i < n - 1; i++) { - for (int j = 0; j < n - i - 1; j++) { - if (a[j] > a[j + 1]) { - - int temp = a[j]; - a[j] = a[j + 1]; - a[j + 1] = temp; - } - } - } -} //end \ No newline at end of file diff --git a/codes/StorIesc/11471295.java b/codes/StorIesc/11471295.java deleted file mode 100644 index 8c505501c812f686a9abe78a0d1191db6085134c..0000000000000000000000000000000000000000 --- a/codes/StorIesc/11471295.java +++ /dev/null @@ -1,19 +0,0 @@ -/** - * 冒泡排序函数 - * aa bb cc - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - // 你的代码，使无序数组 a 变得有序 - for(int i=0;i a[j+1]){ - int temp = a[j]; - a[j] = a[j+1]; - a[j+1] = temp; - } - } - } - -} //end \ No newline at end of file diff --git a/codes/String/11118586.java b/codes/String/11118586.java deleted file mode 100644 index cacd12f1e4e4360dd1ffa22f3741e376110bcde4..0000000000000000000000000000000000000000 --- a/codes/String/11118586.java +++ /dev/null @@ -1,18 +0,0 @@ -/** - * 冒泡排序函数 - * aa bb cc - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - // 你的代码，使无序数组 a 变得有序 - for(int i=0;ia[j+1]){ - a[j] = a[j]+a[j+1]; - a[j+1] = a[j]-a[j+1]; - a[j] = a[j]-a[j+1]; - } - } - } -} //end \ No newline at end of file diff --git a/codes/TCplcker/11207395.java b/codes/TCplcker/11207395.java deleted file mode 100644 index 1c8889947f924214c71a3c3f202500b4780dc281..0000000000000000000000000000000000000000 --- a/codes/TCplcker/11207395.java +++ /dev/null @@ -1,11 +0,0 @@ -public static void bubbleSort(int [] a,int n){ - for(int i = 0; i < n-1 ; i++){ - for (int j = 0;j < n-1-i;j++){ - if(a[j] > a[j+1]){ - int temp = a[j]; - a[j] = a[j+1]; - a[j+1] = temp; - } - } - } -} \ No newline at end of file diff --git a/codes/TIANGESEC/15563393.java b/codes/TIANGESEC/15563393.java deleted file mode 100644 index c2afaa2414da1853e4500b02c6de9068b64aeafe..0000000000000000000000000000000000000000 --- a/codes/TIANGESEC/15563393.java +++ /dev/null @@ -1,18 +0,0 @@ -/** - * 冒泡排序函数 - * aa bb cc - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - for(int i = 0; i < n-1 ; i++){ - for (int j = 0;j < n-1-i;j++){ - if(a[j] > a[j+1]){ - int temp = a[j]; - a[j] = a[j+1]; - a[j+1] = temp; - } - } - } - -} //end diff --git a/codes/TJ0000/15529221.java b/codes/TJ0000/15529221.java deleted file mode 100644 index a833d8d31b2581029ab106b60f560dd2c73ff238..0000000000000000000000000000000000000000 --- a/codes/TJ0000/15529221.java +++ /dev/null @@ -1,24 +0,0 @@ -/** - * 冒泡排序函数 - * aa bb cc - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - // 你的代码，使无序数组 a 变得有序 - for(int j=0;ja[i+1]) - { - temp=a[i]; - a[i]=a[i+1]; - a[i+1]=temp; - } - } - } - //System.out.println(a); - -} //end \ No newline at end of file diff --git a/codes/TPL666/11306800.java b/codes/TPL666/11306800.java deleted file mode 100644 index 8c505501c812f686a9abe78a0d1191db6085134c..0000000000000000000000000000000000000000 --- a/codes/TPL666/11306800.java +++ /dev/null @@ -1,19 +0,0 @@ -/** - * 冒泡排序函数 - * aa bb cc - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - // 你的代码，使无序数组 a 变得有序 - for(int i=0;i a[j+1]){ - int temp = a[j]; - a[j] = a[j+1]; - a[j+1] = temp; - } - } - } - -} //end \ No newline at end of file diff --git a/codes/TR9559559555/15866725.java b/codes/TR9559559555/15866725.java deleted file mode 100644 index 24f513b3219ac31ac3dcffe774647aa7bfdac254..0000000000000000000000000000000000000000 --- a/codes/TR9559559555/15866725.java +++ /dev/null @@ -1,11 +0,0 @@ -public static void bubbleSort(int [] a, int n){ - for (int i = 0; i < n - 1; i++) { - for (int j = 0; j < n - 1 - i; j++) { - if (a[j] > a[j + 1]) { - int temp = a[j]; - a[j] = a[j + 1]; - a[j + 1] = temp; - } - } - } -} diff --git a/codes/TV18625742058/15860990.java b/codes/TV18625742058/15860990.java deleted file mode 100644 index 54c5f3869cd16ee9e7c2b77895a39fae63f05dbc..0000000000000000000000000000000000000000 --- a/codes/TV18625742058/15860990.java +++ /dev/null @@ -1,20 +0,0 @@ -/** - * 冒泡排序函数 - * aa bb cc - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - // 你的代码，使无序数组 a 变得有序 - for(int i = 0; i < n; i++) { - for(int liuy = 0; liuy < n - i - 1; liuy++) { - if(a[liuy] > a[liuy + 1]) { - int temp = a[liuy]; - a [liuy] = a[liuy + 1]; - a[liuy + 1] = temp; - } - } - } - - -} //end,liuy \ No newline at end of file diff --git a/codes/TXMQQ4/15716488.java b/codes/TXMQQ4/15716488.java deleted file mode 100644 index 854beb62bfcf4ead3549d682ffca7f1b9f32d947..0000000000000000000000000000000000000000 --- a/codes/TXMQQ4/15716488.java +++ /dev/null @@ -1,19 +0,0 @@ -/** - * 冒泡排序函数 - * aa bb cc - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - for(int i = 0; i < n-1 ; i++){ - for (int j = 0;j < n-1-i;j++){ - if(a[j] > a[j+1]){ - int temp = a[j]; - a[j] = a[j+1]; - a[j+1] = temp; - } - } - } - -} //end - diff --git a/codes/TYboy2/11228569.java b/codes/TYboy2/11228569.java deleted file mode 100644 index cdabc2e0876ad629e41ff055727cf3af34be8917..0000000000000000000000000000000000000000 --- a/codes/TYboy2/11228569.java +++ /dev/null @@ -1,20 +0,0 @@ -/** - * 冒泡排序函数 - * aa bb cc - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - // 你的代码，使无序数组 a 变得有序 - for (int i = 0; i < n; i++) { - for (int j = i + 1; j < n; j++) { - if (a[i] > a[j]) { - int temp = a[j]; - a[j] = a[i]; - a[i] = temp; - - } - } - } - -} //end \ No newline at end of file diff --git a/codes/TheZeroSunset/15775069.java b/codes/TheZeroSunset/15775069.java deleted file mode 100644 index a73834e9835a08c8638f1d13214eacc12771f0ca..0000000000000000000000000000000000000000 --- a/codes/TheZeroSunset/15775069.java +++ /dev/null @@ -1,26 +0,0 @@ -/** - * 冒泡排序函数 - * 通过相邻元素之间的比较和交换，将无序数组变为有序数组 - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - for (int i = 0; i < n - 1; i++) { - // 标记变量，用于优化，如果在一趟排序中没有交换，则数组已经有序 - boolean swapped = false; - for (int j = 0; j < n - i - 1; j++) { - // 如果前一个元素大于后一个元素，则交换它们 - if (a[j] > a[j + 1]) { - int temp = a[j]; - a[j] = a[j + 1]; - a[j + 1] = temp; - // 发生了交换，将标记设为true - swapped = true; - } - } - // 如果在内层循环中没有发生交换，则数组已经有序，提前退出 - if (!swapped) { - break; - } - } -} //end diff --git a/codes/Tianxuan/11468972.java b/codes/Tianxuan/11468972.java deleted file mode 100644 index 8c505501c812f686a9abe78a0d1191db6085134c..0000000000000000000000000000000000000000 --- a/codes/Tianxuan/11468972.java +++ /dev/null @@ -1,19 +0,0 @@ -/** - * 冒泡排序函数 - * aa bb cc - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - // 你的代码，使无序数组 a 变得有序 - for(int i=0;i a[j+1]){ - int temp = a[j]; - a[j] = a[j+1]; - a[j+1] = temp; - } - } - } - -} //end \ No newline at end of file diff --git a/codes/Tomimi/18424592.java b/codes/Tomimi/18424592.java deleted file mode 100644 index aad8da19e310387d7e33e7969570ac629b2be356..0000000000000000000000000000000000000000 --- a/codes/Tomimi/18424592.java +++ /dev/null @@ -1,20 +0,0 @@ -/** - * 冒泡排序函数 - * 对数组进行冒泡排序，从小到大排序 - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - // 外层循环控制所有元素是否排序完成 - for (int i = 0; i < n - 1; i++) { - // 内层循环控制相邻元素两两比较 - for (int j = 0; j < n - 1 - i; j++) { - // 如果前一个元素大于后一个元素，则交换他们的位置 - if (a[j] > a[j + 1]) { - int temp = a[j]; - a[j] = a[j + 1]; - a[j + 1] = temp; - } - } - } -} diff --git a/codes/Tomorrowed/11451791.java b/codes/Tomorrowed/11451791.java deleted file mode 100644 index 1c8889947f924214c71a3c3f202500b4780dc281..0000000000000000000000000000000000000000 --- a/codes/Tomorrowed/11451791.java +++ /dev/null @@ -1,11 +0,0 @@ -public static void bubbleSort(int [] a,int n){ - for(int i = 0; i < n-1 ; i++){ - for (int j = 0;j < n-1-i;j++){ - if(a[j] > a[j+1]){ - int temp = a[j]; - a[j] = a[j+1]; - a[j+1] = temp; - } - } - } -} \ No newline at end of file diff --git a/codes/TonyStark_/15684919.java b/codes/TonyStark_/15684919.java deleted file mode 100644 index fa8593fd4989ca90711a8dbddc0367b9e453f658..0000000000000000000000000000000000000000 --- a/codes/TonyStark_/15684919.java +++ /dev/null @@ -1,20 +0,0 @@ -/** - * 冒泡排序函数 - * aa bb cc - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - // 你的代码，使无序数组 a 变得有序 - for (int i = 0; i < n - 1; i++) { - for (int j = 0; j < n - 1 - i; j++) { - if (a[j] > a[j + 1]) { - // 交换 a[j] 和 a[j + 1] - int temp = a[j]; - a[j] = a[j + 1]; - a[j + 1] = temp; - } - } - } - -} diff --git a/codes/Tory666/11472343.java b/codes/Tory666/11472343.java deleted file mode 100644 index 8c505501c812f686a9abe78a0d1191db6085134c..0000000000000000000000000000000000000000 --- a/codes/Tory666/11472343.java +++ /dev/null @@ -1,19 +0,0 @@ -/** - * 冒泡排序函数 - * aa bb cc - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - // 你的代码，使无序数组 a 变得有序 - for(int i=0;i a[j+1]){ - int temp = a[j]; - a[j] = a[j+1]; - a[j+1] = temp; - } - } - } - -} //end \ No newline at end of file diff --git a/codes/Tptogiar/10332054.java b/codes/Tptogiar/10332054.java deleted file mode 100644 index 82b73c8ff8181a822b4e5b9b4a74866761c7b1ca..0000000000000000000000000000000000000000 --- a/codes/Tptogiar/10332054.java +++ /dev/null @@ -1,20 +0,0 @@ -/** - * 冒泡排序函数 - * aa bb cc - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - // 你的代码，使无序数组 a 变得有序 - for(int i = 0 ; i < n - 1 ; i++){ - for(int j = 0 ; j < n - 1 - i ; j++){ - if(a[j] > a[j + 1]){ - int tmp = a[j]; - a[j] = a[j + 1]; - a[j + 1] = tmp; - } - } - } - -} //end - diff --git a/codes/UMide9/11292872.java b/codes/UMide9/11292872.java deleted file mode 100644 index 24b49b4b1fd01d1f21be8b362a582158452e41d3..0000000000000000000000000000000000000000 --- a/codes/UMide9/11292872.java +++ /dev/null @@ -1,19 +0,0 @@ -/** - * 冒泡排序函数 - * aa bb cc - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - // 你的代码，使无序数组 a 变得有序 - for(int i = 0 ; i < n - 1 ; i++){ - for(int j = 0 ; j < n - 1 - i ; j++){ - if(a[j] > a[j + 1]){ - int tmp = a[j]; - a[j] = a[j + 1]; - a[j + 1] = tmp; - } - } - } - -} //end \ No newline at end of file diff --git a/codes/UOAN29/15805546.java b/codes/UOAN29/15805546.java deleted file mode 100644 index ce4123f36198ecb034f9ba60dd9025622afaf314..0000000000000000000000000000000000000000 --- a/codes/UOAN29/15805546.java +++ /dev/null @@ -1,18 +0,0 @@ -/** - * 冒泡排序函数 - * 通过相邻元素两两比较和交换，使得每一轮过后最大（或最小）的元素被交换到序列末尾 - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - for (int i = 0; i < n - 1; i++) { // 外层循环控制排序的轮数 - for (int j = 0; j < n - 1 - i; j++) { // 内层循环控制每轮的比较次数 - if (a[j] > a[j + 1]) { // 如果前一个元素大于后一个元素，则交换它们 - // 交换 a[j] 和 a[j+1] - int temp = a[j]; - a[j] = a[j + 1]; - a[j + 1] = temp; - } - } - } -} //end diff --git a/codes/UsoDtst/.keep b/codes/UsoDtst/.keep deleted file mode 100644 index e69de29bb2d1d6434b8b29ae775ad8c2e48c5391..0000000000000000000000000000000000000000 diff --git a/codes/UsoDtst/11120436.java b/codes/UsoDtst/11120436.java deleted file mode 100644 index 6def3d9364e5f1bc766dcc7ae818e0e1f242e3a7..0000000000000000000000000000000000000000 --- a/codes/UsoDtst/11120436.java +++ /dev/null @@ -1,19 +0,0 @@ -/** - * 冒泡排序函数 - * aa bb cc - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - // 你的代码，使无序数组 a 变得有序 - for(int i = 0 ; i < n - 1 ; i++){ - for(int j = 0 ; j < n - 1 - i ; j++){ - if(a[j] > a[j + 1]){ - int temp = a[j]; - a[j] = a[j + 1]; - a[j + 1] = temp; - } - } - } - -} //end \ No newline at end of file diff --git a/codes/Vanish/15774749.java b/codes/Vanish/15774749.java deleted file mode 100644 index 805879bb96b942df16f10aa4bc7c2ba291d810e5..0000000000000000000000000000000000000000 --- a/codes/Vanish/15774749.java +++ /dev/null @@ -1,18 +0,0 @@ -/** - * 冒泡排序函数 - * 功能：对数组进行升序排序 - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - for (int i = 0; i < n - 1; i++) { - for (int j = 0; j < n - i - 1; j++) { - // 如果当前元素大于下一个元素，则交换位置 - if (a[j] > a[j + 1]) { - int temp = a[j]; - a[j] = a[j + 1]; - a[j + 1] = temp; - } - } - } -} //end diff --git a/codes/VincentHuang218/11469479.java b/codes/VincentHuang218/11469479.java deleted file mode 100644 index 8c505501c812f686a9abe78a0d1191db6085134c..0000000000000000000000000000000000000000 --- a/codes/VincentHuang218/11469479.java +++ /dev/null @@ -1,19 +0,0 @@ -/** - * 冒泡排序函数 - * aa bb cc - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - // 你的代码，使无序数组 a 变得有序 - for(int i=0;i a[j+1]){ - int temp = a[j]; - a[j] = a[j+1]; - a[j+1] = temp; - } - } - } - -} //end \ No newline at end of file diff --git a/codes/W2045396389/15630059.java b/codes/W2045396389/15630059.java deleted file mode 100644 index 3c660dce0323e976cb42e28f96639ba405d8349f..0000000000000000000000000000000000000000 --- a/codes/W2045396389/15630059.java +++ /dev/null @@ -1,28 +0,0 @@ -/** - * 冒泡排序函数 - * 通过比较相邻的元素并交换它们的位置，如果它们的顺序错误就把它们交换过来。 - * 遍历数列的工作是重复地进行直到没有再需要交换，也就是说该数列已经排序完成。 - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int[] a, int n) { - for (int i = 0; i < n - 1; i++) { - // 用于标记数组是否已经有序，如果某次循环中没有发生交换，则说明已经有序 - boolean isSorted = true; - for (int j = 0; j < n - i - 1; j++) { - // 如果当前元素大于下一个元素，则交换它们 - if (a[j] > a[j + 1]) { - // 交换元素 - int temp = a[j]; - a[j] = a[j + 1]; - a[j + 1] = temp; - // 标记数组在本次循环中发生了交换，因此数组还未有序 - isSorted = false; - } - } - // 如果在一次循环中没有发生任何交换，则数组已经有序，可以提前结束排序 - if (isSorted) { - break; - } - } -} //end diff --git a/codes/W2848330317/15830359.java b/codes/W2848330317/15830359.java deleted file mode 100644 index b16e04c1a308203becb3b00a301a54d6a7c8fe23..0000000000000000000000000000000000000000 --- a/codes/W2848330317/15830359.java +++ /dev/null @@ -1,20 +0,0 @@ -/** - * 冒泡排序函数 - * 功能：对输入的数组进行升序排序 - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - // 外层循环控制排序的轮数 - for (int i = 0; i < n - 1; i++) { - // 内层循环控制每轮排序的比较次数 - for (int j = 0; j < n - 1 - i; j++) { - // 如果前一个元素比后一个元素大，则交换它们的位置 - if (a[j] > a[j + 1]) { - int temp = a[j]; - a[j] = a[j + 1]; - a[j + 1] = temp; - } - } - } -} //end diff --git a/codes/W4tcherLock/.keep b/codes/W4tcherLock/.keep deleted file mode 100644 index e69de29bb2d1d6434b8b29ae775ad8c2e48c5391..0000000000000000000000000000000000000000 diff --git a/codes/W4tcherLock/15847592.java b/codes/W4tcherLock/15847592.java deleted file mode 100644 index 6e9861fa3ec6d5a2553cdccd1bb1e977430c671b..0000000000000000000000000000000000000000 --- a/codes/W4tcherLock/15847592.java +++ /dev/null @@ -1,19 +0,0 @@ -/** - * 冒泡排序函数 - * aa bb cc - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - // 你的代码，使无序数组 a 变得有序 - for (int i = 0; i < n - 1; i++) { - for (int j = 0; j < n - i - 1; j++) { - if (a[j] > a[j + 1]) { - - int temp = a[j]; - a[j] = a[j + 1]; - a[j + 1] = temp; - } - } - } -} //end \ No newline at end of file diff --git a/codes/WML321/15517626.java b/codes/WML321/15517626.java deleted file mode 100644 index e55c540a4cba34b5207c25070adaa4dfcef3ad1d..0000000000000000000000000000000000000000 --- a/codes/WML321/15517626.java +++ /dev/null @@ -1,18 +0,0 @@ - /** - * 冒泡排序函数 - * aa bb cc - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] arr, int n){ - // 你的代码，使无序数组 a 变得有序 - for (int i = 0; i < n; i++) { - for (int j = (i + 1); j < n; j++) { - if (arr[i] > arr[j]) { - int temp = arr[i]; - arr[i] = arr[j]; - arr[j] = temp; - } - } - } -} //end diff --git a/codes/WQ18355919568/15742272.java b/codes/WQ18355919568/15742272.java deleted file mode 100644 index ae82e695cbfd360050241c3f1f592658c8c1d4e7..0000000000000000000000000000000000000000 --- a/codes/WQ18355919568/15742272.java +++ /dev/null @@ -1,35 +0,0 @@ -/** - - * 冒泡排序函数 - - * aa bb cc - - * @param a 待排序的数组 - - * @param n 待排序的数组长度 - - */ - -public static void bubbleSort(int [] a, int n){ - - for(int i = 0; i < n-1 ; i++){ - - for (int j = 0;j < n-1-i;j++){ - - if(a[j] > a[j+1]){ - - int temp = a[j]; - - a[j] = a[j+1]; - - a[j+1] = temp; - - } - - } - - } - - - -} //end diff --git a/codes/W_changing/15829938.java b/codes/W_changing/15829938.java deleted file mode 100644 index 14986e4add628c172d720840c894dff03eaa065f..0000000000000000000000000000000000000000 --- a/codes/W_changing/15829938.java +++ /dev/null @@ -1,17 +0,0 @@ -/** - * 冒泡排序函数 - * 通过相邻元素两两比较，较大的元素逐渐后移，较小的元素逐渐前移，实现排序。 - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - for (int i = 0; i < n - 1; i++) { // 外层循环控制比较轮数 - for (int j = 0; j < n - i - 1; j++) { // 内层循环控制每轮比较次数 - if (a[j] > a[j + 1]) { // 如果前一个元素大于后一个元素，则交换它们的位置 - int temp = a[j]; - a[j] = a[j + 1]; - a[j + 1] = temp; - } - } - } -} //end diff --git a/codes/Weiyi888/.keep b/codes/Weiyi888/.keep deleted file mode 100644 index e69de29bb2d1d6434b8b29ae775ad8c2e48c5391..0000000000000000000000000000000000000000 diff --git a/codes/Weiyi888/15720599.java b/codes/Weiyi888/15720599.java deleted file mode 100644 index 6426772fb479b07ed3be21ef1867921d1dbb194c..0000000000000000000000000000000000000000 --- a/codes/Weiyi888/15720599.java +++ /dev/null @@ -1,20 +0,0 @@ -/** - * 冒泡排序函数 - * aa bb cc - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - // 你的代码，使无序数组 a 变得有序 - for(int i = 0; i < n; i++) { - for(int j = 0; j < n - i - 1; j++) { - if(a[j] > a[j + 1]) { - int temp = a[j]; - a [j] = a[j + 1]; - a[j + 1] = temp; - } - } - } - - -} //end \ No newline at end of file diff --git a/codes/Whk15038723546/15482712.java b/codes/Whk15038723546/15482712.java deleted file mode 100644 index f521686d96958e1e609e19ccd92a74882dd295c0..0000000000000000000000000000000000000000 --- a/codes/Whk15038723546/15482712.java +++ /dev/null @@ -1,19 +0,0 @@ -/** - * 冒泡排序函数 - * aa bb cc - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - // 你的代码，使无序数组 a 变得有序 - for(int i=0;ia[j+1]){ - int temp=a[j]; - a[j]=a[j+1]; - a[j+1]=temp; - } - } - } - -} //end diff --git a/codes/Wiarrara/.keep b/codes/Wiarrara/.keep deleted file mode 100644 index e69de29bb2d1d6434b8b29ae775ad8c2e48c5391..0000000000000000000000000000000000000000 diff --git a/codes/Wiarrara/15845136.java b/codes/Wiarrara/15845136.java deleted file mode 100644 index 6e9861fa3ec6d5a2553cdccd1bb1e977430c671b..0000000000000000000000000000000000000000 --- a/codes/Wiarrara/15845136.java +++ /dev/null @@ -1,19 +0,0 @@ -/** - * 冒泡排序函数 - * aa bb cc - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - // 你的代码，使无序数组 a 变得有序 - for (int i = 0; i < n - 1; i++) { - for (int j = 0; j < n - i - 1; j++) { - if (a[j] > a[j + 1]) { - - int temp = a[j]; - a[j] = a[j + 1]; - a[j + 1] = temp; - } - } - } -} //end \ No newline at end of file diff --git a/codes/Wilmothe/15592034.java b/codes/Wilmothe/15592034.java deleted file mode 100644 index ae82e695cbfd360050241c3f1f592658c8c1d4e7..0000000000000000000000000000000000000000 --- a/codes/Wilmothe/15592034.java +++ /dev/null @@ -1,35 +0,0 @@ -/** - - * 冒泡排序函数 - - * aa bb cc - - * @param a 待排序的数组 - - * @param n 待排序的数组长度 - - */ - -public static void bubbleSort(int [] a, int n){ - - for(int i = 0; i < n-1 ; i++){ - - for (int j = 0;j < n-1-i;j++){ - - if(a[j] > a[j+1]){ - - int temp = a[j]; - - a[j] = a[j+1]; - - a[j+1] = temp; - - } - - } - - } - - - -} //end diff --git a/codes/Winnie/.keep b/codes/Winnie/.keep deleted file mode 100644 index e69de29bb2d1d6434b8b29ae775ad8c2e48c5391..0000000000000000000000000000000000000000 diff --git a/codes/Winnie/10042948.java b/codes/Winnie/10042948.java deleted file mode 100644 index 667eee0f585ec38ce639cb36d80df080e935946d..0000000000000000000000000000000000000000 --- a/codes/Winnie/10042948.java +++ /dev/null @@ -1,11 +0,0 @@ -public static void bubbleSort(int [] a,int n){ - for(int i = 0; i < n-1 ; i++){ - for (int j = 0;j < n-1-i;j++){ - if(a[j] > a[j+1]){ - int temp = a[j]; - a[j] = a[j+1]; - a[j+1] = temp; - } - } - } -} \ No newline at end of file diff --git a/codes/Wiseung/15774607.java b/codes/Wiseung/15774607.java deleted file mode 100644 index 091707ae59ea77b0b8515b267a26921754e8e5a4..0000000000000000000000000000000000000000 --- a/codes/Wiseung/15774607.java +++ /dev/null @@ -1,21 +0,0 @@ -/** - * 冒泡排序函数 - * 该函数将给定的数组进行冒泡排序，使其从小到大有序 - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - // 外层循环控制排序的轮数 - for (int i = 0; i < n - 1; i++) { - // 内层循环控制每轮比较的次数 - for (int j = 0; j < n - 1 - i; j++) { - // 如果前一个元素大于后一个元素，则交换它们的位置 - if (a[j] > a[j + 1]) { - int temp = a[j]; - a[j] = a[j + 1]; - a[j + 1] = temp; - } - } - } - // 当所有循环结束后，数组a已经变得有序 -} //end diff --git a/codes/WpWwangpeng/.keep b/codes/WpWwangpeng/.keep deleted file mode 100644 index e69de29bb2d1d6434b8b29ae775ad8c2e48c5391..0000000000000000000000000000000000000000 diff --git a/codes/WpWwangpeng/10039890.java b/codes/WpWwangpeng/10039890.java deleted file mode 100644 index 29d27043d3c8103739e7a1d2a27e77b4cc475876..0000000000000000000000000000000000000000 --- a/codes/WpWwangpeng/10039890.java +++ /dev/null @@ -1,23 +0,0 @@ -/** - * 冒泡排序函数 - * aa bb cc - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - // 你的代码，使无序数组 a 变得有序 - for (int i = 0; i < n-1; i++) { - for (int j = 0; j < n-1-i; j++) { - if (a[j] >= a[j+1]) { - int temp = a[j]; - a[j] = a[j+1]; - a[j+1] = temp; - } - } - } - - System.out.print("冒泡排序的结果是： "); - for (int i : a) { - System.out.print(i + " "); - } -} //end \ No newline at end of file diff --git a/codes/Wu18703486053/15850317.java b/codes/Wu18703486053/15850317.java deleted file mode 100644 index 809e6c454de4e33d540c35a26f34e2679a08693a..0000000000000000000000000000000000000000 --- a/codes/Wu18703486053/15850317.java +++ /dev/null @@ -1,18 +0,0 @@ -/** - * 冒泡排序函数 - * 通过相邻元素两两比较和交换，使得每一轮循环后最大（或最小）的元素“冒泡”到数组的末尾。 - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int[] a, int n) { - for (int i = 0; i < n - 1; i++) { // 外层循环控制比较轮数 - for (int j = 0; j < n - 1 - i; j++) { // 内层循环控制每轮比较的次数 - if (a[j] > a[j + 1]) { // 如果当前元素大于下一个元素，则交换它们的位置 - // 交换 a[j] 和 a[j + 1] - int temp = a[j]; - a[j] = a[j + 1]; - a[j + 1] = temp; - } - } - } -} //end diff --git a/codes/Wybzshuai/.keep b/codes/Wybzshuai/.keep deleted file mode 100644 index e69de29bb2d1d6434b8b29ae775ad8c2e48c5391..0000000000000000000000000000000000000000 diff --git a/codes/Wybzshuai/10980502.java b/codes/Wybzshuai/10980502.java deleted file mode 100644 index 9eccfac593dd84bb4c285d230d4de6b8c72a1d65..0000000000000000000000000000000000000000 --- a/codes/Wybzshuai/10980502.java +++ /dev/null @@ -1,11 +0,0 @@ -public static void bubbleSort(int [] a, int n) { - for (int i=0 ; ia[j+1]) { - int temp=a[j]; - a[j]=a[j+1]; - a[j+1]=temp; - } - } - } -} diff --git a/codes/Wyh005116/15858691.java b/codes/Wyh005116/15858691.java deleted file mode 100644 index 271d2f1dfec9c226694fa24afe300e49f150ca51..0000000000000000000000000000000000000000 --- a/codes/Wyh005116/15858691.java +++ /dev/null @@ -1,18 +0,0 @@ -/** - * 冒泡排序函数 - * 将数组a按照从小到大的顺序排序 - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int[] a, int n) { - for (int i = 0; i < n - 1; i++) { // 外层循环，决定冒泡的趟数 - for (int j = 0; j < n - 1 - i; j++) { // 内层循环，决定每趟比较的次数 - if (a[j] > a[j + 1]) { // 如果当前元素大于下一个元素，则交换它们的位置 - // 交换a[j]和a[j + 1] - int temp = a[j]; - a[j] = a[j + 1]; - a[j + 1] = temp; - } - } - } -} // end diff --git a/codes/XHrcool/.keep b/codes/XHrcool/.keep deleted file mode 100644 index e69de29bb2d1d6434b8b29ae775ad8c2e48c5391..0000000000000000000000000000000000000000 diff --git a/codes/XHrcool/15842556.java b/codes/XHrcool/15842556.java deleted file mode 100644 index 6e9861fa3ec6d5a2553cdccd1bb1e977430c671b..0000000000000000000000000000000000000000 --- a/codes/XHrcool/15842556.java +++ /dev/null @@ -1,19 +0,0 @@ -/** - * 冒泡排序函数 - * aa bb cc - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - // 你的代码，使无序数组 a 变得有序 - for (int i = 0; i < n - 1; i++) { - for (int j = 0; j < n - i - 1; j++) { - if (a[j] > a[j + 1]) { - - int temp = a[j]; - a[j] = a[j + 1]; - a[j + 1] = temp; - } - } - } -} //end \ No newline at end of file diff --git a/codes/XUANAIQ/15635606.java b/codes/XUANAIQ/15635606.java deleted file mode 100644 index c2afaa2414da1853e4500b02c6de9068b64aeafe..0000000000000000000000000000000000000000 --- a/codes/XUANAIQ/15635606.java +++ /dev/null @@ -1,18 +0,0 @@ -/** - * 冒泡排序函数 - * aa bb cc - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - for(int i = 0; i < n-1 ; i++){ - for (int j = 0;j < n-1-i;j++){ - if(a[j] > a[j+1]){ - int temp = a[j]; - a[j] = a[j+1]; - a[j+1] = temp; - } - } - } - -} //end diff --git a/codes/XUEMAO/15513347.java b/codes/XUEMAO/15513347.java deleted file mode 100644 index e8795f9ac9fc69d87b876b78fd64eba70f441a4a..0000000000000000000000000000000000000000 --- a/codes/XUEMAO/15513347.java +++ /dev/null @@ -1,29 +0,0 @@ -/** - * 冒泡排序函数 - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - if (a == null || n <= 1) { - return; // 如果数组为空或只有一个元素，不需要排序 - } - boolean swapped; - for (int i = 0; i < n - 1; i++) { - swapped = false; - for (int j = 0; j < n - 1 - i; j++) { - if (a[j] > a[j + 1]) { - // 交换元素 - int temp = a[j]; - a[j] = a[j + 1]; - a[j + 1] = temp; - swapped = true; - } - } - // 如果这一轮没有发生任何交换，说明数组已经排序完毕，可以直接退出 - if (!swapped) { - break; - } - } -} //end - - diff --git a/codes/XXOPQQ/11202216.java b/codes/XXOPQQ/11202216.java deleted file mode 100644 index 4d7083fe05ce3e6d3fadd59d6d55e2cbc50d546d..0000000000000000000000000000000000000000 --- a/codes/XXOPQQ/11202216.java +++ /dev/null @@ -1,22 +0,0 @@ -/** - * 冒泡排序函数 - * aa bb cc - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - // 你的代码，使无序数组 a 变得有序 - int i, j; - - for(i=0; ia[j]){ - int temp; - temp = a[j-1]; - a[j-1] = a[j]; - a[j] = temp; - } - } - } - -} //end \ No newline at end of file diff --git a/codes/XiaoBoBo/15528811.java b/codes/XiaoBoBo/15528811.java deleted file mode 100644 index c2afaa2414da1853e4500b02c6de9068b64aeafe..0000000000000000000000000000000000000000 --- a/codes/XiaoBoBo/15528811.java +++ /dev/null @@ -1,18 +0,0 @@ -/** - * 冒泡排序函数 - * aa bb cc - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - for(int i = 0; i < n-1 ; i++){ - for (int j = 0;j < n-1-i;j++){ - if(a[j] > a[j+1]){ - int temp = a[j]; - a[j] = a[j+1]; - a[j+1] = temp; - } - } - } - -} //end diff --git a/codes/XiaoYu/15641195.java b/codes/XiaoYu/15641195.java deleted file mode 100644 index 2a7f382c5dc5e28c56c6dd4422b8cc406318849f..0000000000000000000000000000000000000000 --- a/codes/XiaoYu/15641195.java +++ /dev/null @@ -1,25 +0,0 @@ -/** - * 冒泡排序函数 - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int[] a, int n) { - for (int i = 0; i < n - 1; i++) { - // 标志位，表示这一趟是否有交换，优化冒泡排序的关键 - boolean swapped = false; - for (int j = 0; j < n - i - 1; j++) { - // 如果前一个元素大于后一个元素，则交换它们 - if (a[j] > a[j + 1]) { - int temp = a[j]; - a[j] = a[j + 1]; - a[j + 1] = temp; - // 发生了交换，将标志位设为true - swapped = true; - } - } - // 如果这一趟没有发生交换，说明数组已经有序，直接退出循环 - if (!swapped) { - break; - } - } -} diff --git a/codes/Y158505/.keep b/codes/Y158505/.keep deleted file mode 100644 index e69de29bb2d1d6434b8b29ae775ad8c2e48c5391..0000000000000000000000000000000000000000 diff --git a/codes/Y158505/10040580.java b/codes/Y158505/10040580.java deleted file mode 100644 index 29d27043d3c8103739e7a1d2a27e77b4cc475876..0000000000000000000000000000000000000000 --- a/codes/Y158505/10040580.java +++ /dev/null @@ -1,23 +0,0 @@ -/** - * 冒泡排序函数 - * aa bb cc - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - // 你的代码，使无序数组 a 变得有序 - for (int i = 0; i < n-1; i++) { - for (int j = 0; j < n-1-i; j++) { - if (a[j] >= a[j+1]) { - int temp = a[j]; - a[j] = a[j+1]; - a[j+1] = temp; - } - } - } - - System.out.print("冒泡排序的结果是： "); - for (int i : a) { - System.out.print(i + " "); - } -} //end \ No newline at end of file diff --git a/codes/Y18379639840/15861186.java b/codes/Y18379639840/15861186.java deleted file mode 100644 index 54c5f3869cd16ee9e7c2b77895a39fae63f05dbc..0000000000000000000000000000000000000000 --- a/codes/Y18379639840/15861186.java +++ /dev/null @@ -1,20 +0,0 @@ -/** - * 冒泡排序函数 - * aa bb cc - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - // 你的代码，使无序数组 a 变得有序 - for(int i = 0; i < n; i++) { - for(int liuy = 0; liuy < n - i - 1; liuy++) { - if(a[liuy] > a[liuy + 1]) { - int temp = a[liuy]; - a [liuy] = a[liuy + 1]; - a[liuy + 1] = temp; - } - } - } - - -} //end,liuy \ No newline at end of file diff --git a/codes/Y2602388224/15856296.java b/codes/Y2602388224/15856296.java deleted file mode 100644 index db00df4317c2971d839dccd193fa0332f983ff23..0000000000000000000000000000000000000000 --- a/codes/Y2602388224/15856296.java +++ /dev/null @@ -1,22 +0,0 @@ -/** - * 冒泡排序函数 - * 对数组进行冒泡排序，使得数组中的元素按从小到大的顺序排列 - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int[] a, int n) { - // 外层循环控制排序趟数 - for (int i = 0; i < n - 1; i++) { - // 内层循环负责进行每趟排序，通过相邻元素的比较和交换来移动较大元素到数组的末尾 - for (int j = 0; j < n - i - 1; j++) { - // 如果前一个元素大于后一个元素，则交换它们的位置 - if (a[j] > a[j + 1]) { - // 交换元素 - int temp = a[j]; - a[j] = a[j + 1]; - a[j + 1] = temp; - } - } - } - // 经过 n-1 趟排序后，数组已经变为有序 -} // end diff --git a/codes/YYDS2023/11094401.java b/codes/YYDS2023/11094401.java deleted file mode 100644 index 272a12fc81d3dd0e857bba9ae001c15818fb7123..0000000000000000000000000000000000000000 --- a/codes/YYDS2023/11094401.java +++ /dev/null @@ -1,18 +0,0 @@ - /** - * 冒泡排序函数 - * aa bb cc - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ - public static void bubbleSort(int [] arr, int n){ - // 你的代码，使无序数组 a 变得有序 - for (int i = 0; i < n; i++) { - for (int j = (i + 1); j < n; j++) { - if (arr[i] > arr[j]) { - int temp = arr[i]; - arr[i] = arr[j]; - arr[j] = temp; - } - } - } - } //end \ No newline at end of file diff --git a/codes/Yanghw/16081530.java b/codes/Yanghw/16081530.java deleted file mode 100644 index dcbf3e18ff1e570dd96d46ee618e7e9c50ec84f5..0000000000000000000000000000000000000000 --- a/codes/Yanghw/16081530.java +++ /dev/null @@ -1,21 +0,0 @@ -/** - * 冒泡排序函数 - * aa bb cc - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int[] a, int n) { - // 外层循环控制所有的回合 - for (int i = 0; i < n - 1; i++) { - // 内层循环控制每一轮的冒泡处理 - for (int j = 0; j < n - 1 - i; j++) { - // 相邻元素进行比较，如果逆序则交换 - if (a[j] > a[j + 1]) { - // 交换a[j]和a[j+1] - int temp = a[j]; - a[j] = a[j + 1]; - a[j + 1] = temp; - } - } - } -} // end diff --git a/codes/Yangtzev/15774600.java b/codes/Yangtzev/15774600.java deleted file mode 100644 index e73d1592940e8cb5b8cd35c8f73c6560fe4863b4..0000000000000000000000000000000000000000 --- a/codes/Yangtzev/15774600.java +++ /dev/null @@ -1,18 +0,0 @@ -/** - * 冒泡排序函数 - * 通过比较相邻元素的大小，并互换位置，从而达到排序的目的 - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - for (int i = 0; i < n - 1; i++) { - for (int j = 0; j < n - 1 - i; j++) { - // 如果前一个元素大于后一个元素，则交换它们的位置 - if (a[j] > a[j + 1]) { - int temp = a[j]; - a[j] = a[j + 1]; - a[j + 1] = temp; - } - } - } -} //end diff --git a/codes/Yefori/15536426.java b/codes/Yefori/15536426.java deleted file mode 100644 index 008f3f82dae78c0f948172175e08fed7bf68f066..0000000000000000000000000000000000000000 --- a/codes/Yefori/15536426.java +++ /dev/null @@ -1,29 +0,0 @@ -/** - * 冒泡排序函数 - * aa bb cc - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - // 你的代码，使无序数组 a 变得有序 - // 遍历数组 - for (int i = 0; i < n; i++) { - // 设置一个标志，用于优化（如果在一次遍历中没有发生交换，说明数组已经有序，可以提前结束排序） - boolean flag = false; - // 内层循环，从第一个元素到第 n-i-1 个元素 - for (int j = 0; j < n - i - 1; j++) { - // 如果前一个元素比后一个元素大，交换它们的位置 - if (a[j] > a[j + 1]) { - int temp = a[j]; - a[j] = a[j + 1]; - a[j + 1] = temp; - // 发生了交换，标志设为 true - flag = true; - } - } - // 如果在一次遍历中没有发生交换，说明数组已经有序，可以提前结束排序 - if (!flag) { - break; - } - } -} //end diff --git a/codes/Yefori/15536527.java b/codes/Yefori/15536527.java deleted file mode 100644 index 008f3f82dae78c0f948172175e08fed7bf68f066..0000000000000000000000000000000000000000 --- a/codes/Yefori/15536527.java +++ /dev/null @@ -1,29 +0,0 @@ -/** - * 冒泡排序函数 - * aa bb cc - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - // 你的代码，使无序数组 a 变得有序 - // 遍历数组 - for (int i = 0; i < n; i++) { - // 设置一个标志，用于优化（如果在一次遍历中没有发生交换，说明数组已经有序，可以提前结束排序） - boolean flag = false; - // 内层循环，从第一个元素到第 n-i-1 个元素 - for (int j = 0; j < n - i - 1; j++) { - // 如果前一个元素比后一个元素大，交换它们的位置 - if (a[j] > a[j + 1]) { - int temp = a[j]; - a[j] = a[j + 1]; - a[j + 1] = temp; - // 发生了交换，标志设为 true - flag = true; - } - } - // 如果在一次遍历中没有发生交换，说明数组已经有序，可以提前结束排序 - if (!flag) { - break; - } - } -} //end diff --git a/codes/YixinTian/11315888.java b/codes/YixinTian/11315888.java deleted file mode 100644 index c1e52c76eddf689b2b4af7ce618e0e9f0bb0dcd5..0000000000000000000000000000000000000000 --- a/codes/YixinTian/11315888.java +++ /dev/null @@ -1,18 +0,0 @@ -/** - * 冒泡排序函数 - * aa bb cc - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - // 你的代码，使无序数组 a 变得有序 - for (int i = 0; i < n; i++) { - for (int j = 0; j < n - i - 1; j++) { - if (a[j] > a[j + 1]) { - int temp = a[j]; - a[j] = a[j + 1]; - a[j + 1] = temp; - } - } - } -} //end diff --git a/codes/Ys888888/.keep b/codes/Ys888888/.keep deleted file mode 100644 index e69de29bb2d1d6434b8b29ae775ad8c2e48c5391..0000000000000000000000000000000000000000 diff --git a/codes/Ys888888/15780625.java b/codes/Ys888888/15780625.java deleted file mode 100644 index 667eee0f585ec38ce639cb36d80df080e935946d..0000000000000000000000000000000000000000 --- a/codes/Ys888888/15780625.java +++ /dev/null @@ -1,11 +0,0 @@ -public static void bubbleSort(int [] a,int n){ - for(int i = 0; i < n-1 ; i++){ - for (int j = 0;j < n-1-i;j++){ - if(a[j] > a[j+1]){ - int temp = a[j]; - a[j] = a[j+1]; - a[j+1] = temp; - } - } - } -} \ No newline at end of file diff --git a/codes/Yuan10001/15307047.java b/codes/Yuan10001/15307047.java deleted file mode 100644 index c005e4d174be10ec48d144f45ef63db8e394ce90..0000000000000000000000000000000000000000 --- a/codes/Yuan10001/15307047.java +++ /dev/null @@ -1,23 +0,0 @@ -/** - * 冒泡排序函数 - * aa bb cc - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - // 你的代码，使无序数组 a 变得有序 - //外部循环控制排序的趟数。冒泡排序的每一趟会将最大的元素"冒泡"到数组的末尾，因此需要执行 n-1 趟，其中 n 是元素的总数 - for (int i = 0; i < n - 1; i++) { - //内循环控制每趟比较的次数。由于每一趟都会将一个最大的元素沉到数组末尾，所以内循环次数逐渐减小。 - for (int j = 0; j < n - i - 1; j++) { - if (a[j] > a[j + 1]) { - // 交换arr[j]和arr[j+1] - int temp = a[j]; - a[j] = a[j + 1]; - a[j + 1] = temp; - } - } - } - - -} //end diff --git a/codes/Yuan_559/10716235.java b/codes/Yuan_559/10716235.java deleted file mode 100644 index 84cdc57023f796e010fc6b03591953ec3d021c7f..0000000000000000000000000000000000000000 --- a/codes/Yuan_559/10716235.java +++ /dev/null @@ -1,18 +0,0 @@ -/** - * 冒泡排序函数 - * aa bb cc - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - // 你的代码，使无序数组 a 变得有序 - for(int aa=0; aaa[bb+1]) { - int cc = a[bb]; - a[bb] = a[bb+1]; - a[bb+1] = cc; - } - } - } -} //end diff --git a/codes/Yy7110829/15834374.java b/codes/Yy7110829/15834374.java deleted file mode 100644 index d0e7038df81a1dcd40ba57e5267839caad594f03..0000000000000000000000000000000000000000 --- a/codes/Yy7110829/15834374.java +++ /dev/null @@ -1,19 +0,0 @@ -/** - * 冒泡排序函数 - * 冒泡排序是一种简单的排序算法，它重复地遍历要排序的数列，一次比较两个元素，如果他们的顺序错误就把他们交换过来。 - * 遍历数列的工作是重复地进行直到没有再需要交换，也就是说该数列已经排序完成。 - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - for (int i = 0; i < n - 1; i++) { // 外层循环控制比较的次数 - for (int j = 0; j < n - 1 - i; j++) { // 内层循环控制每一轮比较的次数 - // 如果前一个元素比后一个元素大，则交换它们的位置 - if (a[j] > a[j + 1]) { - int temp = a[j]; - a[j] = a[j + 1]; - a[j + 1] = temp; - } - } - } -} //end diff --git a/codes/Z18182089257/15541298.java b/codes/Z18182089257/15541298.java deleted file mode 100644 index c2afaa2414da1853e4500b02c6de9068b64aeafe..0000000000000000000000000000000000000000 --- a/codes/Z18182089257/15541298.java +++ /dev/null @@ -1,18 +0,0 @@ -/** - * 冒泡排序函数 - * aa bb cc - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - for(int i = 0; i < n-1 ; i++){ - for (int j = 0;j < n-1-i;j++){ - if(a[j] > a[j+1]){ - int temp = a[j]; - a[j] = a[j+1]; - a[j+1] = temp; - } - } - } - -} //end diff --git a/codes/Z1831847001/.keep b/codes/Z1831847001/.keep deleted file mode 100644 index e69de29bb2d1d6434b8b29ae775ad8c2e48c5391..0000000000000000000000000000000000000000 diff --git a/codes/Z1831847001/10985387.java b/codes/Z1831847001/10985387.java deleted file mode 100644 index 9eccfac593dd84bb4c285d230d4de6b8c72a1d65..0000000000000000000000000000000000000000 --- a/codes/Z1831847001/10985387.java +++ /dev/null @@ -1,11 +0,0 @@ -public static void bubbleSort(int [] a, int n) { - for (int i=0 ; ia[j+1]) { - int temp=a[j]; - a[j]=a[j+1]; - a[j+1]=temp; - } - } - } -} diff --git a/codes/Z19849217092/15835445.java b/codes/Z19849217092/15835445.java deleted file mode 100644 index d0e7038df81a1dcd40ba57e5267839caad594f03..0000000000000000000000000000000000000000 --- a/codes/Z19849217092/15835445.java +++ /dev/null @@ -1,19 +0,0 @@ -/** - * 冒泡排序函数 - * 冒泡排序是一种简单的排序算法，它重复地遍历要排序的数列，一次比较两个元素，如果他们的顺序错误就把他们交换过来。 - * 遍历数列的工作是重复地进行直到没有再需要交换，也就是说该数列已经排序完成。 - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - for (int i = 0; i < n - 1; i++) { // 外层循环控制比较的次数 - for (int j = 0; j < n - 1 - i; j++) { // 内层循环控制每一轮比较的次数 - // 如果前一个元素比后一个元素大，则交换它们的位置 - if (a[j] > a[j + 1]) { - int temp = a[j]; - a[j] = a[j + 1]; - a[j + 1] = temp; - } - } - } -} //end diff --git a/codes/Z3608759124/.keep b/codes/Z3608759124/.keep deleted file mode 100644 index e69de29bb2d1d6434b8b29ae775ad8c2e48c5391..0000000000000000000000000000000000000000 diff --git a/codes/Z3608759124/10979186.java b/codes/Z3608759124/10979186.java deleted file mode 100644 index 5edd6bf0e38372fd1654da46aeafd4941c42ddb7..0000000000000000000000000000000000000000 --- a/codes/Z3608759124/10979186.java +++ /dev/null @@ -1,20 +0,0 @@ -/** - * 冒泡排序函数 - * aa bb cc - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - // 你的代码，使无序数组 a 变得有序 - for (int i = 0; i < n; i++) { - for (int j = i + 1; j < n; j++) { - if (a[i] > a[j]) { - int temp = a[j]; - a[j] = a[i]; - a[i] = temp; - - } - } - } - -} //end \ No newline at end of file diff --git a/codes/Z3n1th/15536338.java b/codes/Z3n1th/15536338.java deleted file mode 100644 index 854beb62bfcf4ead3549d682ffca7f1b9f32d947..0000000000000000000000000000000000000000 --- a/codes/Z3n1th/15536338.java +++ /dev/null @@ -1,19 +0,0 @@ -/** - * 冒泡排序函数 - * aa bb cc - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - for(int i = 0; i < n-1 ; i++){ - for (int j = 0;j < n-1-i;j++){ - if(a[j] > a[j+1]){ - int temp = a[j]; - a[j] = a[j+1]; - a[j+1] = temp; - } - } - } - -} //end - diff --git a/codes/ZXCV2288/.keep b/codes/ZXCV2288/.keep deleted file mode 100644 index e69de29bb2d1d6434b8b29ae775ad8c2e48c5391..0000000000000000000000000000000000000000 diff --git a/codes/ZXCV2288/15820903.java b/codes/ZXCV2288/15820903.java deleted file mode 100644 index 6e9861fa3ec6d5a2553cdccd1bb1e977430c671b..0000000000000000000000000000000000000000 --- a/codes/ZXCV2288/15820903.java +++ /dev/null @@ -1,19 +0,0 @@ -/** - * 冒泡排序函数 - * aa bb cc - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - // 你的代码，使无序数组 a 变得有序 - for (int i = 0; i < n - 1; i++) { - for (int j = 0; j < n - i - 1; j++) { - if (a[j] > a[j + 1]) { - - int temp = a[j]; - a[j] = a[j + 1]; - a[j + 1] = temp; - } - } - } -} //end \ No newline at end of file diff --git a/codes/ZYwj4399/.keep b/codes/ZYwj4399/.keep deleted file mode 100644 index e69de29bb2d1d6434b8b29ae775ad8c2e48c5391..0000000000000000000000000000000000000000 diff --git a/codes/ZYwj4399/15846689.java b/codes/ZYwj4399/15846689.java deleted file mode 100644 index 6e9861fa3ec6d5a2553cdccd1bb1e977430c671b..0000000000000000000000000000000000000000 --- a/codes/ZYwj4399/15846689.java +++ /dev/null @@ -1,19 +0,0 @@ -/** - * 冒泡排序函数 - * aa bb cc - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - // 你的代码，使无序数组 a 变得有序 - for (int i = 0; i < n - 1; i++) { - for (int j = 0; j < n - i - 1; j++) { - if (a[j] > a[j + 1]) { - - int temp = a[j]; - a[j] = a[j + 1]; - a[j + 1] = temp; - } - } - } -} //end \ No newline at end of file diff --git a/codes/ZZH1331065/15816621.java b/codes/ZZH1331065/15816621.java deleted file mode 100644 index 2851642b69b3f2aa92e2cabe67c49773f6af4c87..0000000000000000000000000000000000000000 --- a/codes/ZZH1331065/15816621.java +++ /dev/null @@ -1,20 +0,0 @@ -/** - * 冒泡排序函数 - * 使用冒泡排序算法对数组进行升序排序 - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - // 外层循环控制排序的轮数 - for (int i = 0; i < n - 1; i++) { - // 内层循环负责两两相邻元素的比较和交换 - for (int j = 0; j < n - i - 1; j++) { - // 如果前一个元素大于后一个元素，则交换它们的位置 - if (a[j] > a[j + 1]) { - int temp = a[j]; - a[j] = a[j + 1]; - a[j + 1] = temp; - } - } - } -} //end diff --git a/codes/ZZQeducation/.keep b/codes/ZZQeducation/.keep deleted file mode 100644 index e69de29bb2d1d6434b8b29ae775ad8c2e48c5391..0000000000000000000000000000000000000000 diff --git a/codes/ZZQeducation/15846342.java b/codes/ZZQeducation/15846342.java deleted file mode 100644 index 6e9861fa3ec6d5a2553cdccd1bb1e977430c671b..0000000000000000000000000000000000000000 --- a/codes/ZZQeducation/15846342.java +++ /dev/null @@ -1,19 +0,0 @@ -/** - * 冒泡排序函数 - * aa bb cc - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - // 你的代码，使无序数组 a 变得有序 - for (int i = 0; i < n - 1; i++) { - for (int j = 0; j < n - i - 1; j++) { - if (a[j] > a[j + 1]) { - - int temp = a[j]; - a[j] = a[j + 1]; - a[j + 1] = temp; - } - } - } -} //end \ No newline at end of file diff --git a/codes/ZeroSunset/15775945.java b/codes/ZeroSunset/15775945.java deleted file mode 100644 index a73834e9835a08c8638f1d13214eacc12771f0ca..0000000000000000000000000000000000000000 --- a/codes/ZeroSunset/15775945.java +++ /dev/null @@ -1,26 +0,0 @@ -/** - * 冒泡排序函数 - * 通过相邻元素之间的比较和交换，将无序数组变为有序数组 - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - for (int i = 0; i < n - 1; i++) { - // 标记变量，用于优化，如果在一趟排序中没有交换，则数组已经有序 - boolean swapped = false; - for (int j = 0; j < n - i - 1; j++) { - // 如果前一个元素大于后一个元素，则交换它们 - if (a[j] > a[j + 1]) { - int temp = a[j]; - a[j] = a[j + 1]; - a[j + 1] = temp; - // 发生了交换，将标记设为true - swapped = true; - } - } - // 如果在内层循环中没有发生交换，则数组已经有序，提前退出 - if (!swapped) { - break; - } - } -} //end diff --git a/codes/ZhangKai/11036581.java b/codes/ZhangKai/11036581.java deleted file mode 100644 index 25d28ba464c4387da28ee5ccecb14ee67ec15321..0000000000000000000000000000000000000000 --- a/codes/ZhangKai/11036581.java +++ /dev/null @@ -1,19 +0,0 @@ -/** - * 冒泡排序函数 - * aa bb cc - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - // 你的代码，使无序数组 a 变得有序 - for(int i = 0 ; i < n - 1 ; i++){ - for(int j = 0 ; j < n - 1 - i ; j++){ - if(a[j] > a[j + 1]){ - int temp = a[j]; - a[j] = a[j + 1]; - a[j + 1] = temp; - } - } - } - -} //end \ No newline at end of file diff --git a/codes/Zhangzy/15657994.java b/codes/Zhangzy/15657994.java deleted file mode 100644 index 4d760467cc7d134525c843bfd461de5ed858843a..0000000000000000000000000000000000000000 --- a/codes/Zhangzy/15657994.java +++ /dev/null @@ -1,19 +0,0 @@ -/** - * 冒泡排序函数 - * 将数组 a 按照升序排列 - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - for (int i = 0; i < n - 1; i++) { - for (int j = 0; j < n - i - 1; j++) { - // 如果当前元素大于下一个元素，则交换它们的位置 - if (a[j] > a[j + 1]) { - // 使用临时变量交换元素 - int temp = a[j]; - a[j] = a[j + 1]; - a[j + 1] = temp; - } - } - } -} //end diff --git a/codes/Zhihua611/.keep b/codes/Zhihua611/.keep deleted file mode 100644 index e69de29bb2d1d6434b8b29ae775ad8c2e48c5391..0000000000000000000000000000000000000000 diff --git a/codes/Zhihua611/15840830.java b/codes/Zhihua611/15840830.java deleted file mode 100644 index 6e9861fa3ec6d5a2553cdccd1bb1e977430c671b..0000000000000000000000000000000000000000 --- a/codes/Zhihua611/15840830.java +++ /dev/null @@ -1,19 +0,0 @@ -/** - * 冒泡排序函数 - * aa bb cc - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - // 你的代码，使无序数组 a 变得有序 - for (int i = 0; i < n - 1; i++) { - for (int j = 0; j < n - i - 1; j++) { - if (a[j] > a[j + 1]) { - - int temp = a[j]; - a[j] = a[j + 1]; - a[j + 1] = temp; - } - } - } -} //end \ No newline at end of file diff --git a/codes/Zhongjin123/.keep b/codes/Zhongjin123/.keep deleted file mode 100644 index e69de29bb2d1d6434b8b29ae775ad8c2e48c5391..0000000000000000000000000000000000000000 diff --git a/codes/Zhongjin123/15846007.java b/codes/Zhongjin123/15846007.java deleted file mode 100644 index 6e9861fa3ec6d5a2553cdccd1bb1e977430c671b..0000000000000000000000000000000000000000 --- a/codes/Zhongjin123/15846007.java +++ /dev/null @@ -1,19 +0,0 @@ -/** - * 冒泡排序函数 - * aa bb cc - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - // 你的代码，使无序数组 a 变得有序 - for (int i = 0; i < n - 1; i++) { - for (int j = 0; j < n - i - 1; j++) { - if (a[j] > a[j + 1]) { - - int temp = a[j]; - a[j] = a[j + 1]; - a[j + 1] = temp; - } - } - } -} //end \ No newline at end of file diff --git a/codes/ZianChang/15775142.java b/codes/ZianChang/15775142.java deleted file mode 100644 index 4b73ad0d39e929c373fb51e9ee425014fde33b27..0000000000000000000000000000000000000000 --- a/codes/ZianChang/15775142.java +++ /dev/null @@ -1,19 +0,0 @@ -/** - * 冒泡排序函数 - * aa bb cc - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - // 你的代码，使无序数组 a 变得有序 - for (int i = 0; i < n - 1; i++) { - for (int j = 0; j < n - i - 1; j++) { - if (a[j] > a[j+1]) { - // 交换a[j]和a[j+1]的值 - int temp = a[j]; - a[j] = a[j+1]; - a[j+1] = temp; - } - } - } -} //end diff --git a/codes/ZoeLeo010/15732573.java b/codes/ZoeLeo010/15732573.java deleted file mode 100644 index 7ec373aee12c8b4795c0d670e772620e90ee630e..0000000000000000000000000000000000000000 --- a/codes/ZoeLeo010/15732573.java +++ /dev/null @@ -1,18 +0,0 @@ -/** - * 冒泡排序函数 - * 通过对相邻的元素进行两两比较，顺序相反则进行交换，每一轮比较会将当前未排序部分的最大值“冒泡”到未排序部分的末尾。 - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int[] a, int n) { - for (int i = 0; i < n - 1; i++) { // 外层循环控制所有轮数 - for (int j = 0; j < n - i - 1; j++) { // 内层循环控制每轮比较的次数 - if (a[j] > a[j + 1]) { // 如果前一个元素大于后一个元素，则交换它们 - // 交换 a[j] 和 a[j+1] - int temp = a[j]; - a[j] = a[j + 1]; - a[j + 1] = temp; - } - } - } -} // end diff --git a/codes/Zoey12138/15846229.java b/codes/Zoey12138/15846229.java deleted file mode 100644 index 5cc1c636a63a4a96ad5c1161dade3c61f9551d9b..0000000000000000000000000000000000000000 --- a/codes/Zoey12138/15846229.java +++ /dev/null @@ -1,21 +0,0 @@ -/** - * 冒泡排序函数 - * 功能：将无序数组 a 按照从小到大的顺序进行排序 - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - // 外层循环控制所有轮数 - for (int i = 0; i < n - 1; i++) { - // 内层循环控制每一轮的比较次数 - for (int j = 0; j < n - 1 - i; j++) { - // 如果前一个元素大于后一个元素，则交换它们的位置 - if (a[j] > a[j + 1]) { - // 交换元素 - int temp = a[j]; - a[j] = a[j + 1]; - a[j + 1] = temp; - } - } - } -} //end diff --git a/codes/Ztmanners/.keep b/codes/Ztmanners/.keep deleted file mode 100644 index e69de29bb2d1d6434b8b29ae775ad8c2e48c5391..0000000000000000000000000000000000000000 diff --git a/codes/Ztmanners/15844065.java b/codes/Ztmanners/15844065.java deleted file mode 100644 index 6e9861fa3ec6d5a2553cdccd1bb1e977430c671b..0000000000000000000000000000000000000000 --- a/codes/Ztmanners/15844065.java +++ /dev/null @@ -1,19 +0,0 @@ -/** - * 冒泡排序函数 - * aa bb cc - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - // 你的代码，使无序数组 a 变得有序 - for (int i = 0; i < n - 1; i++) { - for (int j = 0; j < n - i - 1; j++) { - if (a[j] > a[j + 1]) { - - int temp = a[j]; - a[j] = a[j + 1]; - a[j + 1] = temp; - } - } - } -} //end \ No newline at end of file diff --git a/codes/ZxCvBnM321/15837924.java b/codes/ZxCvBnM321/15837924.java deleted file mode 100644 index 6beb7512cf1f30e3ec098ad8fc8a7739f1ecbb16..0000000000000000000000000000000000000000 --- a/codes/ZxCvBnM321/15837924.java +++ /dev/null @@ -1,18 +0,0 @@ -/** - * 冒泡排序函数 - * 使用冒泡排序算法对数组进行排序 - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - for (int i = 0; i < n - 1; i++) { - for (int j = 0; j < n - i - 1; j++) { - if (a[j] > a[j + 1]) { - // 交换 a[j] 和 a[j + 1] - int temp = a[j]; - a[j] = a[j + 1]; - a[j + 1] = temp; - } - } - } -} //end diff --git a/codes/a04040404/15774714.java b/codes/a04040404/15774714.java deleted file mode 100644 index 568adf0f4624729237ac79895a66f2c6d0101637..0000000000000000000000000000000000000000 --- a/codes/a04040404/15774714.java +++ /dev/null @@ -1,26 +0,0 @@ -/** - * 冒泡排序函数 - * 通过重复地遍历待排序的数组，比较每对相邻的元素，如果它们的顺序错误就把它们交换过来。 - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int[] a, int n) { - for (int i = 0; i < n - 1; i++) { - // 标记变量，用于优化，如果在一趟排序中没有发生交换，则说明已经有序 - boolean swapped = false; - for (int j = 0; j < n - i - 1; j++) { - // 如果前一个元素大于后一个元素，则交换它们 - if (a[j] > a[j + 1]) { - int temp = a[j]; - a[j] = a[j + 1]; - a[j + 1] = temp; - // 发生了交换，将标记设为true - swapped = true; - } - } - // 如果在一趟排序中没有发生交换，则数组已经有序，跳出循环 - if (!swapped) { - break; - } - } -} // end diff --git a/codes/a1034852656/.keep b/codes/a1034852656/.keep deleted file mode 100644 index e69de29bb2d1d6434b8b29ae775ad8c2e48c5391..0000000000000000000000000000000000000000 diff --git a/codes/a1034852656/10993428.java b/codes/a1034852656/10993428.java deleted file mode 100644 index 9eccfac593dd84bb4c285d230d4de6b8c72a1d65..0000000000000000000000000000000000000000 --- a/codes/a1034852656/10993428.java +++ /dev/null @@ -1,11 +0,0 @@ -public static void bubbleSort(int [] a, int n) { - for (int i=0 ; ia[j+1]) { - int temp=a[j]; - a[j]=a[j+1]; - a[j+1]=temp; - } - } - } -} diff --git a/codes/a123cwl/15774901.java b/codes/a123cwl/15774901.java deleted file mode 100644 index 987377810b5beca8eb4bf5eafeee5db45e234a87..0000000000000000000000000000000000000000 --- a/codes/a123cwl/15774901.java +++ /dev/null @@ -1,20 +0,0 @@ -/** - * 冒泡排序函数 - * aa bb cc - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - // 你的代码，使无序数组 a 变得有序 - for(int i = 0; i < n; i++) { - for(int liuy = 0; liuy < n - i - 1; liuy++) { - if(a[liuy] > a[liuy + 1]) { - int temp = a[liuy]; - a [liuy] = a[liuy + 1]; - a[liuy + 1] = temp; - } - } - } - - -} //end,liuy diff --git a/codes/a13579/15776164.java b/codes/a13579/15776164.java deleted file mode 100644 index 1746baaf03286ee69ab2a0db9f43d4461a31497d..0000000000000000000000000000000000000000 --- a/codes/a13579/15776164.java +++ /dev/null @@ -1,18 +0,0 @@ -/** - * 冒泡排序函数 - * 通过相邻元素比较和交换，使较大元素逐渐“浮”到数组的末尾 - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - for (int i = 0; i < n - 1; i++) { // 外层循环，控制排序趟数 - for (int j = 0; j < n - i - 1; j++) { // 内层循环，控制每趟排序多少次 - // 如果前一个元素大于后一个元素，则交换它们的位置 - if (a[j] > a[j + 1]) { - int temp = a[j]; - a[j] = a[j + 1]; - a[j + 1] = temp; - } - } - } -} //end diff --git a/codes/a13919519903/15854734.java b/codes/a13919519903/15854734.java deleted file mode 100644 index db00df4317c2971d839dccd193fa0332f983ff23..0000000000000000000000000000000000000000 --- a/codes/a13919519903/15854734.java +++ /dev/null @@ -1,22 +0,0 @@ -/** - * 冒泡排序函数 - * 对数组进行冒泡排序，使得数组中的元素按从小到大的顺序排列 - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int[] a, int n) { - // 外层循环控制排序趟数 - for (int i = 0; i < n - 1; i++) { - // 内层循环负责进行每趟排序，通过相邻元素的比较和交换来移动较大元素到数组的末尾 - for (int j = 0; j < n - i - 1; j++) { - // 如果前一个元素大于后一个元素，则交换它们的位置 - if (a[j] > a[j + 1]) { - // 交换元素 - int temp = a[j]; - a[j] = a[j + 1]; - a[j + 1] = temp; - } - } - } - // 经过 n-1 趟排序后，数组已经变为有序 -} // end diff --git a/codes/a17537741744/15835967.java b/codes/a17537741744/15835967.java deleted file mode 100644 index d0e7038df81a1dcd40ba57e5267839caad594f03..0000000000000000000000000000000000000000 --- a/codes/a17537741744/15835967.java +++ /dev/null @@ -1,19 +0,0 @@ -/** - * 冒泡排序函数 - * 冒泡排序是一种简单的排序算法，它重复地遍历要排序的数列，一次比较两个元素，如果他们的顺序错误就把他们交换过来。 - * 遍历数列的工作是重复地进行直到没有再需要交换，也就是说该数列已经排序完成。 - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - for (int i = 0; i < n - 1; i++) { // 外层循环控制比较的次数 - for (int j = 0; j < n - 1 - i; j++) { // 内层循环控制每一轮比较的次数 - // 如果前一个元素比后一个元素大，则交换它们的位置 - if (a[j] > a[j + 1]) { - int temp = a[j]; - a[j] = a[j + 1]; - a[j + 1] = temp; - } - } - } -} //end diff --git a/codes/a18342002424/15861602.java b/codes/a18342002424/15861602.java deleted file mode 100644 index 54c5f3869cd16ee9e7c2b77895a39fae63f05dbc..0000000000000000000000000000000000000000 --- a/codes/a18342002424/15861602.java +++ /dev/null @@ -1,20 +0,0 @@ -/** - * 冒泡排序函数 - * aa bb cc - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - // 你的代码，使无序数组 a 变得有序 - for(int i = 0; i < n; i++) { - for(int liuy = 0; liuy < n - i - 1; liuy++) { - if(a[liuy] > a[liuy + 1]) { - int temp = a[liuy]; - a [liuy] = a[liuy + 1]; - a[liuy + 1] = temp; - } - } - } - - -} //end,liuy \ No newline at end of file diff --git a/codes/a18352134184/15861238.java b/codes/a18352134184/15861238.java deleted file mode 100644 index 54c5f3869cd16ee9e7c2b77895a39fae63f05dbc..0000000000000000000000000000000000000000 --- a/codes/a18352134184/15861238.java +++ /dev/null @@ -1,20 +0,0 @@ -/** - * 冒泡排序函数 - * aa bb cc - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - // 你的代码，使无序数组 a 变得有序 - for(int i = 0; i < n; i++) { - for(int liuy = 0; liuy < n - i - 1; liuy++) { - if(a[liuy] > a[liuy + 1]) { - int temp = a[liuy]; - a [liuy] = a[liuy + 1]; - a[liuy + 1] = temp; - } - } - } - - -} //end,liuy \ No newline at end of file diff --git a/codes/a18370978367/15620229.java b/codes/a18370978367/15620229.java deleted file mode 100644 index 462bdb84d30a2b7c0d01f9f6822e460a63dd9b1d..0000000000000000000000000000000000000000 --- a/codes/a18370978367/15620229.java +++ /dev/null @@ -1,18 +0,0 @@ -/** - * 冒泡排序函数 - * aa bb cc - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int[] a, int n){ - for (int i = 0; i < n - 1; i++) { - for (int j = 0; j < n - 1 - i; j++) { - if (a[j] > a[j + 1]) { - // 交换 a[j] 和 a[j+1] - int temp = a[j]; - a[j] = a[j + 1]; - a[j + 1] = temp; - } - } - } -} //end diff --git a/codes/a18377237158/.keep b/codes/a18377237158/.keep deleted file mode 100644 index e69de29bb2d1d6434b8b29ae775ad8c2e48c5391..0000000000000000000000000000000000000000 diff --git a/codes/a18377237158/10978793.java b/codes/a18377237158/10978793.java deleted file mode 100644 index 9eccfac593dd84bb4c285d230d4de6b8c72a1d65..0000000000000000000000000000000000000000 --- a/codes/a18377237158/10978793.java +++ /dev/null @@ -1,11 +0,0 @@ -public static void bubbleSort(int [] a, int n) { - for (int i=0 ; ia[j+1]) { - int temp=a[j]; - a[j]=a[j+1]; - a[j+1]=temp; - } - } - } -} diff --git a/codes/a18573769257/15857971.java b/codes/a18573769257/15857971.java deleted file mode 100644 index 271d2f1dfec9c226694fa24afe300e49f150ca51..0000000000000000000000000000000000000000 --- a/codes/a18573769257/15857971.java +++ /dev/null @@ -1,18 +0,0 @@ -/** - * 冒泡排序函数 - * 将数组a按照从小到大的顺序排序 - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int[] a, int n) { - for (int i = 0; i < n - 1; i++) { // 外层循环，决定冒泡的趟数 - for (int j = 0; j < n - 1 - i; j++) { // 内层循环，决定每趟比较的次数 - if (a[j] > a[j + 1]) { // 如果当前元素大于下一个元素，则交换它们的位置 - // 交换a[j]和a[j + 1] - int temp = a[j]; - a[j] = a[j + 1]; - a[j + 1] = temp; - } - } - } -} // end diff --git a/codes/a19173568702/15849477.java b/codes/a19173568702/15849477.java deleted file mode 100644 index 809e6c454de4e33d540c35a26f34e2679a08693a..0000000000000000000000000000000000000000 --- a/codes/a19173568702/15849477.java +++ /dev/null @@ -1,18 +0,0 @@ -/** - * 冒泡排序函数 - * 通过相邻元素两两比较和交换，使得每一轮循环后最大（或最小）的元素“冒泡”到数组的末尾。 - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int[] a, int n) { - for (int i = 0; i < n - 1; i++) { // 外层循环控制比较轮数 - for (int j = 0; j < n - 1 - i; j++) { // 内层循环控制每轮比较的次数 - if (a[j] > a[j + 1]) { // 如果当前元素大于下一个元素，则交换它们的位置 - // 交换 a[j] 和 a[j + 1] - int temp = a[j]; - a[j] = a[j + 1]; - a[j + 1] = temp; - } - } - } -} //end diff --git a/codes/a2159028620/.keep b/codes/a2159028620/.keep deleted file mode 100644 index e69de29bb2d1d6434b8b29ae775ad8c2e48c5391..0000000000000000000000000000000000000000 diff --git a/codes/a2159028620/10980184.java b/codes/a2159028620/10980184.java deleted file mode 100644 index 9eccfac593dd84bb4c285d230d4de6b8c72a1d65..0000000000000000000000000000000000000000 --- a/codes/a2159028620/10980184.java +++ /dev/null @@ -1,11 +0,0 @@ -public static void bubbleSort(int [] a, int n) { - for (int i=0 ; ia[j+1]) { - int temp=a[j]; - a[j]=a[j+1]; - a[j+1]=temp; - } - } - } -} diff --git a/codes/a2313064922/15679065.java b/codes/a2313064922/15679065.java deleted file mode 100644 index e67491fe620b2cf2e4e6ad2265d990c0472c8a14..0000000000000000000000000000000000000000 --- a/codes/a2313064922/15679065.java +++ /dev/null @@ -1,17 +0,0 @@ -/** - * 冒泡排序函数 - * 这是一个简单的排序算法，通过重复遍历要排序的列表，比较每对相邻的项，如果它们的顺序错误就把它们交换过来。 - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int[] a, int n) { - for (int i = 0; i < n - 1; i++) { // 外层循环控制遍历次数 - for (int j = 0; j < n - i - 1; j++) { // 内层循环控制每次遍历需要比较的次数 - if (a[j] > a[j + 1]) { // 如果当前元素大于下一个元素，则交换它们的位置 - int temp = a[j]; - a[j] = a[j + 1]; - a[j + 1] = temp; - } - } - } -} // end diff --git a/codes/a2505934241/15859458.java b/codes/a2505934241/15859458.java deleted file mode 100644 index 271d2f1dfec9c226694fa24afe300e49f150ca51..0000000000000000000000000000000000000000 --- a/codes/a2505934241/15859458.java +++ /dev/null @@ -1,18 +0,0 @@ -/** - * 冒泡排序函数 - * 将数组a按照从小到大的顺序排序 - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int[] a, int n) { - for (int i = 0; i < n - 1; i++) { // 外层循环，决定冒泡的趟数 - for (int j = 0; j < n - 1 - i; j++) { // 内层循环，决定每趟比较的次数 - if (a[j] > a[j + 1]) { // 如果当前元素大于下一个元素，则交换它们的位置 - // 交换a[j]和a[j + 1] - int temp = a[j]; - a[j] = a[j + 1]; - a[j + 1] = temp; - } - } - } -} // end diff --git a/codes/a2523760784/9941105.java b/codes/a2523760784/9941105.java deleted file mode 100644 index 5220eb8d8b2c6eb8beb6c8ae9207d00e4484d77b..0000000000000000000000000000000000000000 --- a/codes/a2523760784/9941105.java +++ /dev/null @@ -1,27 +0,0 @@ -/** - * 冒泡排序函数 - * aa bb cc - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - // 你的代码，使无序数组 a 变得有序 - if(a == null || a.length == 0){ - return; - } - for(int i = 0; i< n; i++){ - boolean flag = true; - for(int j = 0; j< n - i - 1 ; j++){ - if(a[j]> a[j+1]){ - int tmp = a[j]; - a[j] = a[j+1]; - a[j+1] = tmp; - flag = false; - } - } - if(flag){ - break; - } - - } -} //end diff --git a/codes/a2554028123/.keep b/codes/a2554028123/.keep deleted file mode 100644 index e69de29bb2d1d6434b8b29ae775ad8c2e48c5391..0000000000000000000000000000000000000000 diff --git a/codes/a2554028123/10984030.java b/codes/a2554028123/10984030.java deleted file mode 100644 index 9eccfac593dd84bb4c285d230d4de6b8c72a1d65..0000000000000000000000000000000000000000 --- a/codes/a2554028123/10984030.java +++ /dev/null @@ -1,11 +0,0 @@ -public static void bubbleSort(int [] a, int n) { - for (int i=0 ; ia[j+1]) { - int temp=a[j]; - a[j]=a[j+1]; - a[j+1]=temp; - } - } - } -} diff --git a/codes/a2565345148/15777154.java b/codes/a2565345148/15777154.java deleted file mode 100644 index 9b5ae978ad5bd6ab8b8051aac036ab32ba4981bb..0000000000000000000000000000000000000000 --- a/codes/a2565345148/15777154.java +++ /dev/null @@ -1,17 +0,0 @@ -/** - * 冒泡排序函数 - * 通过相邻元素比较和交换，将无序数组变为有序数组 - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - for (int i = 0; i < n - 1; i++) { // 外层循环，控制排序趟数 - for (int j = 0; j < n - i - 1; j++) { // 内层循环，进行相邻元素比较和交换 - if (a[j] > a[j + 1]) { // 如果前一个元素比后一个元素大，则交换它们 - int temp = a[j]; // 临时变量，用于交换 - a[j] = a[j + 1]; - a[j + 1] = temp; - } - } - } -} //end diff --git a/codes/a2565345148/15831524.java b/codes/a2565345148/15831524.java deleted file mode 100644 index 9b5ae978ad5bd6ab8b8051aac036ab32ba4981bb..0000000000000000000000000000000000000000 --- a/codes/a2565345148/15831524.java +++ /dev/null @@ -1,17 +0,0 @@ -/** - * 冒泡排序函数 - * 通过相邻元素比较和交换，将无序数组变为有序数组 - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - for (int i = 0; i < n - 1; i++) { // 外层循环，控制排序趟数 - for (int j = 0; j < n - i - 1; j++) { // 内层循环，进行相邻元素比较和交换 - if (a[j] > a[j + 1]) { // 如果前一个元素比后一个元素大，则交换它们 - int temp = a[j]; // 临时变量，用于交换 - a[j] = a[j + 1]; - a[j + 1] = temp; - } - } - } -} //end diff --git a/codes/a2667860490/15858891.java b/codes/a2667860490/15858891.java deleted file mode 100644 index 271d2f1dfec9c226694fa24afe300e49f150ca51..0000000000000000000000000000000000000000 --- a/codes/a2667860490/15858891.java +++ /dev/null @@ -1,18 +0,0 @@ -/** - * 冒泡排序函数 - * 将数组a按照从小到大的顺序排序 - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int[] a, int n) { - for (int i = 0; i < n - 1; i++) { // 外层循环，决定冒泡的趟数 - for (int j = 0; j < n - 1 - i; j++) { // 内层循环，决定每趟比较的次数 - if (a[j] > a[j + 1]) { // 如果当前元素大于下一个元素，则交换它们的位置 - // 交换a[j]和a[j + 1] - int temp = a[j]; - a[j] = a[j + 1]; - a[j + 1] = temp; - } - } - } -} // end diff --git a/codes/a2942278197/15788264.java b/codes/a2942278197/15788264.java deleted file mode 100644 index 4335f75e3cc551592c45a3f4d5bda86998df8483..0000000000000000000000000000000000000000 --- a/codes/a2942278197/15788264.java +++ /dev/null @@ -1,18 +0,0 @@ -/** - * 冒泡排序函数 - * 通过相邻元素之间的比较和交换，使得每一轮循环后最大（或最小）的元素能够“冒泡”到数组的末尾。 - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int[] a, int n) { - for (int i = 0; i < n - 1; i++) { // 外层循环，控制排序的轮数 - for (int j = 0; j < n - i - 1; j++) { // 内层循环，负责每轮的比较和交换 - if (a[j] > a[j + 1]) { // 如果当前元素大于下一个元素，则交换它们 - // 交换 a[j] 和 a[j+1] - int temp = a[j]; - a[j] = a[j + 1]; - a[j + 1] = temp; - } - } - } -} // end diff --git a/codes/a3681298224/15797237.java b/codes/a3681298224/15797237.java deleted file mode 100644 index 166dea5db31166b381f11f50cf27b5f36311847d..0000000000000000000000000000000000000000 --- a/codes/a3681298224/15797237.java +++ /dev/null @@ -1,19 +0,0 @@ -/** - * 冒泡排序函数 - * 该函数通过冒泡排序算法对数组进行排序 - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int[] a, int n) { - for (int i = 0; i < n - 1; i++) { // 外层循环控制比较轮数 - for (int j = 0; j < n - 1 - i; j++) { // 内层循环控制每轮的比较次数 - // 如果前一个元素大于后一个元素，则交换它们的位置 - if (a[j] > a[j + 1]) { - // 交换元素 - int temp = a[j]; - a[j] = a[j + 1]; - a[j + 1] = temp; - } - } - } -} //end diff --git a/codes/a6765357/15866940.java b/codes/a6765357/15866940.java deleted file mode 100644 index 24f513b3219ac31ac3dcffe774647aa7bfdac254..0000000000000000000000000000000000000000 --- a/codes/a6765357/15866940.java +++ /dev/null @@ -1,11 +0,0 @@ -public static void bubbleSort(int [] a, int n){ - for (int i = 0; i < n - 1; i++) { - for (int j = 0; j < n - 1 - i; j++) { - if (a[j] > a[j + 1]) { - int temp = a[j]; - a[j] = a[j + 1]; - a[j + 1] = temp; - } - } - } -} diff --git a/codes/a857934324/15786660.java b/codes/a857934324/15786660.java deleted file mode 100644 index 4aa4260852fb833f2c1f22e86ee9b5af25f261b3..0000000000000000000000000000000000000000 --- a/codes/a857934324/15786660.java +++ /dev/null @@ -1,17 +0,0 @@ -/** - * 冒泡排序函数 - * 该函数实现了冒泡排序算法，将数组中的元素按照从小到大的顺序排列 - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - for (int i = 0; i < n - 1; i++) { // 外层循环控制排序的趟数 - for (int j = 0; j < n - i - 1; j++) { // 内层循环控制每趟的比较次数 - if (a[j] > a[j + 1]) { // 如果前一个元素比后一个元素大，则交换它们的位置 - int temp = a[j]; - a[j] = a[j + 1]; - a[j + 1] = temp; - } - } - } -} //end diff --git a/codes/a940959221/15733763.java b/codes/a940959221/15733763.java deleted file mode 100644 index ee68c90a81978415c1c6355448aab377e4cfc17b..0000000000000000000000000000000000000000 --- a/codes/a940959221/15733763.java +++ /dev/null @@ -1,19 +0,0 @@ -/** - * 冒泡排序函数 - * 对数组a进行升序排序 - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int[] a, int n) { - for (int i = 0; i < n - 1; i++) { - for (int j = 0; j < n - i - 1; j++) { - // 如果当前元素大于下一个元素，则交换它们的位置 - if (a[j] > a[j + 1]) { - // 交换a[j]和a[j+1] - int temp = a[j]; - a[j] = a[j + 1]; - a[j + 1] = temp; - } - } - } -} // end diff --git a/codes/aAuely/15714122.java b/codes/aAuely/15714122.java deleted file mode 100644 index c2afaa2414da1853e4500b02c6de9068b64aeafe..0000000000000000000000000000000000000000 --- a/codes/aAuely/15714122.java +++ /dev/null @@ -1,18 +0,0 @@ -/** - * 冒泡排序函数 - * aa bb cc - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - for(int i = 0; i < n-1 ; i++){ - for (int j = 0;j < n-1-i;j++){ - if(a[j] > a[j+1]){ - int temp = a[j]; - a[j] = a[j+1]; - a[j+1] = temp; - } - } - } - -} //end diff --git a/codes/a_0650/15775427.java b/codes/a_0650/15775427.java deleted file mode 100644 index 7ce620c3e5da73497f3bd1c48010bf1366a3fe53..0000000000000000000000000000000000000000 --- a/codes/a_0650/15775427.java +++ /dev/null @@ -1,28 +0,0 @@ -/** - * 冒泡排序函数 - * 将无序数组通过冒泡排序算法变为有序数组 - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - for (int i = 0; i < n - 1; i++) { - // 设置一个标志位，用于优化算法，减少不必要的比较 - boolean swapped = false; - for (int j = 0; j < n - i - 1; j++) { - // 如果前一个元素比后一个元素大，则交换它们的位置 - if (a[j] > a[j + 1]) { - int temp = a[j]; - a[j] = a[j + 1]; - a[j + 1] = temp; - // 如果有元素交换，则标志位设为true - swapped = true; - } - } - // 如果没有元素交换，说明数组已经有序，可以提前结束排序 - if (!swapped) { - break; - } - } -} //end - - diff --git a/codes/aa123456789/15808647.java b/codes/aa123456789/15808647.java deleted file mode 100644 index 24f513b3219ac31ac3dcffe774647aa7bfdac254..0000000000000000000000000000000000000000 --- a/codes/aa123456789/15808647.java +++ /dev/null @@ -1,11 +0,0 @@ -public static void bubbleSort(int [] a, int n){ - for (int i = 0; i < n - 1; i++) { - for (int j = 0; j < n - 1 - i; j++) { - if (a[j] > a[j + 1]) { - int temp = a[j]; - a[j] = a[j + 1]; - a[j + 1] = temp; - } - } - } -} diff --git a/codes/aaa_zzz/15684144.java b/codes/aaa_zzz/15684144.java deleted file mode 100644 index 269aafa3267f08275e184d1a0aab16a23c023158..0000000000000000000000000000000000000000 --- a/codes/aaa_zzz/15684144.java +++ /dev/null @@ -1,17 +0,0 @@ -/** - * 冒泡排序函数 - * 该函数会对数组a进行排序，使其变为有序数组 - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - for (int i = 0; i < n - 1; i++) { // 外层循环控制排序趟数 - for (int j = 0; j < n - 1 - i; j++) { // 内层循环控制每一趟排序多少次 - if (a[j] > a[j + 1]) { // 如果前一个数比后一个数大，则交换这两个数 - int temp = a[j]; - a[j] = a[j + 1]; - a[j + 1] = temp; - } - } - } -} //end diff --git a/codes/aaajiancai/15816333.java b/codes/aaajiancai/15816333.java deleted file mode 100644 index 2851642b69b3f2aa92e2cabe67c49773f6af4c87..0000000000000000000000000000000000000000 --- a/codes/aaajiancai/15816333.java +++ /dev/null @@ -1,20 +0,0 @@ -/** - * 冒泡排序函数 - * 使用冒泡排序算法对数组进行升序排序 - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - // 外层循环控制排序的轮数 - for (int i = 0; i < n - 1; i++) { - // 内层循环负责两两相邻元素的比较和交换 - for (int j = 0; j < n - i - 1; j++) { - // 如果前一个元素大于后一个元素，则交换它们的位置 - if (a[j] > a[j + 1]) { - int temp = a[j]; - a[j] = a[j + 1]; - a[j + 1] = temp; - } - } - } -} //end diff --git a/codes/aamphiprioninae/18302197.java b/codes/aamphiprioninae/18302197.java deleted file mode 100644 index b0e9171142e0c7146252980bbeb0539a9fd6326c..0000000000000000000000000000000000000000 --- a/codes/aamphiprioninae/18302197.java +++ /dev/null @@ -1,19 +0,0 @@ -/** - * 冒泡排序函数 - * aa bb cc - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - // 你的代码，使无序数组 a 变得有序 - for (int i=0;ia[j+1]){ - int t=a[j]; - a[j+1]=a[j]; - a[j]=t; - } - } - } - -} //end diff --git a/codes/aas123/15713924.java b/codes/aas123/15713924.java deleted file mode 100644 index 987377810b5beca8eb4bf5eafeee5db45e234a87..0000000000000000000000000000000000000000 --- a/codes/aas123/15713924.java +++ /dev/null @@ -1,20 +0,0 @@ -/** - * 冒泡排序函数 - * aa bb cc - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - // 你的代码，使无序数组 a 变得有序 - for(int i = 0; i < n; i++) { - for(int liuy = 0; liuy < n - i - 1; liuy++) { - if(a[liuy] > a[liuy + 1]) { - int temp = a[liuy]; - a [liuy] = a[liuy + 1]; - a[liuy + 1] = temp; - } - } - } - - -} //end,liuy diff --git a/codes/aass123/15720115.java b/codes/aass123/15720115.java deleted file mode 100644 index d29bb658b4e62d5429b6138e82644337724ef934..0000000000000000000000000000000000000000 --- a/codes/aass123/15720115.java +++ /dev/null @@ -1,20 +0,0 @@ -/** - * 冒泡排序函数 - * aa bb cc - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - // 你的代码，使无序数组 a 变得有序 - for(int i = 0; i < n; i++) { - for(int liuy = 0; liuy < n - i - 1; liuy++) { - if(a[liuy] > a[liuy + 1]) { - int temp = a[liuy]; - a [liuy] = a[liuy + 1]; - a[liuy + 1] = temp; - } - } - } - - -} //end,liuy \ No newline at end of file diff --git a/codes/aassdd/15775537.java b/codes/aassdd/15775537.java deleted file mode 100644 index 987377810b5beca8eb4bf5eafeee5db45e234a87..0000000000000000000000000000000000000000 --- a/codes/aassdd/15775537.java +++ /dev/null @@ -1,20 +0,0 @@ -/** - * 冒泡排序函数 - * aa bb cc - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - // 你的代码，使无序数组 a 变得有序 - for(int i = 0; i < n; i++) { - for(int liuy = 0; liuy < n - i - 1; liuy++) { - if(a[liuy] > a[liuy + 1]) { - int temp = a[liuy]; - a [liuy] = a[liuy + 1]; - a[liuy + 1] = temp; - } - } - } - - -} //end,liuy diff --git a/codes/abaoge/15684921.java b/codes/abaoge/15684921.java deleted file mode 100644 index 634b7859dbe3a58fbc8d6e049519ebf357b354e4..0000000000000000000000000000000000000000 --- a/codes/abaoge/15684921.java +++ /dev/null @@ -1,17 +0,0 @@ -/** - * 冒泡排序函数 - * 通过不断比较相邻元素的大小，将较大的元素逐步“浮”到数组的末尾，从而实现排序。 - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - for (int i = 0; i < n - 1; i++) { // 外层循环，控制比较轮数 - for (int j = 0; j < n - 1 - i; j++) { // 内层循环，负责相邻元素间的比较和交换 - if (a[j] > a[j + 1]) { // 如果当前元素大于下一个元素，则交换它们的位置 - int temp = a[j]; - a[j] = a[j + 1]; - a[j + 1] = temp; - } - } - } -} //end diff --git a/codes/abaper/.keep b/codes/abaper/.keep deleted file mode 100644 index e69de29bb2d1d6434b8b29ae775ad8c2e48c5391..0000000000000000000000000000000000000000 diff --git a/codes/abaper/10978249.java b/codes/abaper/10978249.java deleted file mode 100644 index 862a031b6f73aac6e6e6656df710e9caa439d4c0..0000000000000000000000000000000000000000 --- a/codes/abaper/10978249.java +++ /dev/null @@ -1,18 +0,0 @@ -/** - * 冒泡排序函数 - * aa bb cc - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - // 你的代码，使无序数组 a 变得有序 - for (int m=0 ; ma[q+1]) { - int temp=a[q]; - a[q]=a[q+1]; - a[q+1]=temp; - } - } - } -} //end \ No newline at end of file diff --git a/codes/acc8226/15757227.java b/codes/acc8226/15757227.java deleted file mode 100644 index 1c380514cd45df67d80b478bce94df566216be5f..0000000000000000000000000000000000000000 --- a/codes/acc8226/15757227.java +++ /dev/null @@ -1,19 +0,0 @@ -/** - * 冒泡排序函数 - * - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n) { - int temp; - for (int i = 1; i < n; i++) { - for (int j = 0; j < n - i; j++) { - if (a[j] > a[j + 1]) { - temp = a[j]; - a[j] = a[j + 1]; - a[j + 1] = temp; - } - } - } - // 你的代码，使无序数组 a 变得有序 -} diff --git a/codes/achun123/15779154.java b/codes/achun123/15779154.java deleted file mode 100644 index 00b60edf60aa9912e54e93b2b6a5c706b26b9a42..0000000000000000000000000000000000000000 --- a/codes/achun123/15779154.java +++ /dev/null @@ -1,18 +0,0 @@ -/** - * 冒泡排序函数 - * 该函数会对数组进行升序排序 - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - for (int i = 0; i < n - 1; i++) { - for (int j = 0; j < n - i - 1; j++) { - // 如果前一个元素比后一个元素大，则交换它们的位置 - if (a[j] > a[j + 1]) { - int temp = a[j]; - a[j] = a[j + 1]; - a[j + 1] = temp; - } - } - } -} //end diff --git a/codes/acloudio/11274672.java b/codes/acloudio/11274672.java deleted file mode 100644 index 9e7534d4b41cf071c848fa4d5c08c6519526b6e3..0000000000000000000000000000000000000000 --- a/codes/acloudio/11274672.java +++ /dev/null @@ -1,18 +0,0 @@ -/** - * 冒泡 排序 函数 - * aa bb cc - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - // 你的代码，使无序数组 a 变得有序 - for (int i = 0; i < n; i++) { - for (int j = 0; j < i; j++) { - if (a[i] < a[j]) { - int t = a[i]; - a[i] = a[j]; - a[j] = t; - } - } - } -}//end \ No newline at end of file diff --git a/codes/activemy/14206633.java b/codes/activemy/14206633.java deleted file mode 100644 index 002e3d165b2e990cda107240294f91670a872f05..0000000000000000000000000000000000000000 --- a/codes/activemy/14206633.java +++ /dev/null @@ -1,28 +0,0 @@ -/** - * 冒泡排序函数 - * aa bb cc - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - // 你的代码，使无序数组 a 变得有 - if (0 >= n) - { - return; - } - int tmp,i,j; - for (j=n-1; j>0; j--) - { - for (i=0; i a[i+1]) - { - tmp = a[i+1]; - a[i+1] = a[i]; - a[i] = tmp; - } - } - } - return; - -} //end diff --git a/codes/activity-school b/codes/activity-school deleted file mode 160000 index bd6d5bad67914025676cec7abba5ef5da497f249..0000000000000000000000000000000000000000 --- a/codes/activity-school +++ /dev/null @@ -1 +0,0 @@ -Subproject commit bd6d5bad67914025676cec7abba5ef5da497f249 diff --git a/codes/adasdas34/.keep b/codes/adasdas34/.keep deleted file mode 100644 index e69de29bb2d1d6434b8b29ae775ad8c2e48c5391..0000000000000000000000000000000000000000 diff --git a/codes/adasdas34/15827500.java b/codes/adasdas34/15827500.java deleted file mode 100644 index 6e9861fa3ec6d5a2553cdccd1bb1e977430c671b..0000000000000000000000000000000000000000 --- a/codes/adasdas34/15827500.java +++ /dev/null @@ -1,19 +0,0 @@ -/** - * 冒泡排序函数 - * aa bb cc - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - // 你的代码，使无序数组 a 变得有序 - for (int i = 0; i < n - 1; i++) { - for (int j = 0; j < n - i - 1; j++) { - if (a[j] > a[j + 1]) { - - int temp = a[j]; - a[j] = a[j + 1]; - a[j + 1] = temp; - } - } - } -} //end \ No newline at end of file diff --git a/codes/addqian/14612723.java b/codes/addqian/14612723.java deleted file mode 100644 index 3daf885d258d5c71ac1f3467e62151044f13c070..0000000000000000000000000000000000000000 --- a/codes/addqian/14612723.java +++ /dev/null @@ -1,24 +0,0 @@ -/** - * 冒泡排序函数 - * aa bb cc - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - int changeFlag; - for (int i = 0; i < n - 1; i++) { - changeFlag = 0; - for (int j = 0; j < n - i - 1; ++j) { - if (a[j] > a[j + 1]) { - a[j] ^= a[j + 1]; - a[j + 1] ^= a[j]; - a[j] ^= a[j + 1]; - changeFlag = 1; - } - } - if (changeFlag == 0) { - break; - } - } -} //end - diff --git a/codes/address/11226902.java b/codes/address/11226902.java deleted file mode 100644 index cdabc2e0876ad629e41ff055727cf3af34be8917..0000000000000000000000000000000000000000 --- a/codes/address/11226902.java +++ /dev/null @@ -1,20 +0,0 @@ -/** - * 冒泡排序函数 - * aa bb cc - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - // 你的代码，使无序数组 a 变得有序 - for (int i = 0; i < n; i++) { - for (int j = i + 1; j < n; j++) { - if (a[i] > a[j]) { - int temp = a[j]; - a[j] = a[i]; - a[i] = temp; - - } - } - } - -} //end \ No newline at end of file diff --git a/codes/admin228855/10967397.java b/codes/admin228855/10967397.java deleted file mode 100644 index deb2438785c696d09e985c35997c2f2bc5445a90..0000000000000000000000000000000000000000 --- a/codes/admin228855/10967397.java +++ /dev/null @@ -1,18 +0,0 @@ -/** - * 冒泡排序函数 - * aa bb cc - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - // 你的代码，使无序数组 a 变得有序 - for (int i=0 ; ia[k+1]) { - int temp=a[k]; - a[k]=a[k+1]; - a[k+1]=temp; - } - } - } -} //end \ No newline at end of file diff --git a/codes/adminuser/10040823.java b/codes/adminuser/10040823.java deleted file mode 100644 index 272a12fc81d3dd0e857bba9ae001c15818fb7123..0000000000000000000000000000000000000000 --- a/codes/adminuser/10040823.java +++ /dev/null @@ -1,18 +0,0 @@ - /** - * 冒泡排序函数 - * aa bb cc - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ - public static void bubbleSort(int [] arr, int n){ - // 你的代码，使无序数组 a 变得有序 - for (int i = 0; i < n; i++) { - for (int j = (i + 1); j < n; j++) { - if (arr[i] > arr[j]) { - int temp = arr[i]; - arr[i] = arr[j]; - arr[j] = temp; - } - } - } - } //end \ No newline at end of file diff --git a/codes/adsf45362/.keep b/codes/adsf45362/.keep deleted file mode 100644 index e69de29bb2d1d6434b8b29ae775ad8c2e48c5391..0000000000000000000000000000000000000000 diff --git a/codes/adsf45362/15743460.java b/codes/adsf45362/15743460.java deleted file mode 100644 index 6e9861fa3ec6d5a2553cdccd1bb1e977430c671b..0000000000000000000000000000000000000000 --- a/codes/adsf45362/15743460.java +++ /dev/null @@ -1,19 +0,0 @@ -/** - * 冒泡排序函数 - * aa bb cc - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - // 你的代码，使无序数组 a 变得有序 - for (int i = 0; i < n - 1; i++) { - for (int j = 0; j < n - i - 1; j++) { - if (a[j] > a[j + 1]) { - - int temp = a[j]; - a[j] = a[j + 1]; - a[j + 1] = temp; - } - } - } -} //end \ No newline at end of file diff --git a/codes/af345sdga/.keep b/codes/af345sdga/.keep deleted file mode 100644 index e69de29bb2d1d6434b8b29ae775ad8c2e48c5391..0000000000000000000000000000000000000000 diff --git a/codes/af345sdga/15743439.java b/codes/af345sdga/15743439.java deleted file mode 100644 index 6e9861fa3ec6d5a2553cdccd1bb1e977430c671b..0000000000000000000000000000000000000000 --- a/codes/af345sdga/15743439.java +++ /dev/null @@ -1,19 +0,0 @@ -/** - * 冒泡排序函数 - * aa bb cc - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - // 你的代码，使无序数组 a 变得有序 - for (int i = 0; i < n - 1; i++) { - for (int j = 0; j < n - i - 1; j++) { - if (a[j] > a[j + 1]) { - - int temp = a[j]; - a[j] = a[j + 1]; - a[j + 1] = temp; - } - } - } -} //end \ No newline at end of file diff --git a/codes/afasfasf24214/.keep b/codes/afasfasf24214/.keep deleted file mode 100644 index e69de29bb2d1d6434b8b29ae775ad8c2e48c5391..0000000000000000000000000000000000000000 diff --git a/codes/afasfasf24214/15743480.java b/codes/afasfasf24214/15743480.java deleted file mode 100644 index 6e9861fa3ec6d5a2553cdccd1bb1e977430c671b..0000000000000000000000000000000000000000 --- a/codes/afasfasf24214/15743480.java +++ /dev/null @@ -1,19 +0,0 @@ -/** - * 冒泡排序函数 - * aa bb cc - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - // 你的代码，使无序数组 a 变得有序 - for (int i = 0; i < n - 1; i++) { - for (int j = 0; j < n - i - 1; j++) { - if (a[j] > a[j + 1]) { - - int temp = a[j]; - a[j] = a[j + 1]; - a[j + 1] = temp; - } - } - } -} //end \ No newline at end of file diff --git a/codes/afssaffc774/.keep b/codes/afssaffc774/.keep deleted file mode 100644 index e69de29bb2d1d6434b8b29ae775ad8c2e48c5391..0000000000000000000000000000000000000000 diff --git a/codes/afssaffc774/15831351.java b/codes/afssaffc774/15831351.java deleted file mode 100644 index 6e9861fa3ec6d5a2553cdccd1bb1e977430c671b..0000000000000000000000000000000000000000 --- a/codes/afssaffc774/15831351.java +++ /dev/null @@ -1,19 +0,0 @@ -/** - * 冒泡排序函数 - * aa bb cc - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - // 你的代码，使无序数组 a 变得有序 - for (int i = 0; i < n - 1; i++) { - for (int j = 0; j < n - i - 1; j++) { - if (a[j] > a[j + 1]) { - - int temp = a[j]; - a[j] = a[j + 1]; - a[j + 1] = temp; - } - } - } -} //end \ No newline at end of file diff --git a/codes/aikun66/15577937.java b/codes/aikun66/15577937.java deleted file mode 100644 index c2afaa2414da1853e4500b02c6de9068b64aeafe..0000000000000000000000000000000000000000 --- a/codes/aikun66/15577937.java +++ /dev/null @@ -1,18 +0,0 @@ -/** - * 冒泡排序函数 - * aa bb cc - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - for(int i = 0; i < n-1 ; i++){ - for (int j = 0;j < n-1-i;j++){ - if(a[j] > a[j+1]){ - int temp = a[j]; - a[j] = a[j+1]; - a[j+1] = temp; - } - } - } - -} //end diff --git a/codes/airgege/.keep b/codes/airgege/.keep deleted file mode 100644 index e69de29bb2d1d6434b8b29ae775ad8c2e48c5391..0000000000000000000000000000000000000000 diff --git a/codes/airgege/15850162.java b/codes/airgege/15850162.java deleted file mode 100644 index 6426772fb479b07ed3be21ef1867921d1dbb194c..0000000000000000000000000000000000000000 --- a/codes/airgege/15850162.java +++ /dev/null @@ -1,20 +0,0 @@ -/** - * 冒泡排序函数 - * aa bb cc - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - // 你的代码，使无序数组 a 变得有序 - for(int i = 0; i < n; i++) { - for(int j = 0; j < n - i - 1; j++) { - if(a[j] > a[j + 1]) { - int temp = a[j]; - a [j] = a[j + 1]; - a[j + 1] = temp; - } - } - } - - -} //end \ No newline at end of file diff --git a/codes/aiyowei12366/.keep b/codes/aiyowei12366/.keep deleted file mode 100644 index e69de29bb2d1d6434b8b29ae775ad8c2e48c5391..0000000000000000000000000000000000000000 diff --git a/codes/aiyowei12366/15798748.java b/codes/aiyowei12366/15798748.java deleted file mode 100644 index 6e9861fa3ec6d5a2553cdccd1bb1e977430c671b..0000000000000000000000000000000000000000 --- a/codes/aiyowei12366/15798748.java +++ /dev/null @@ -1,19 +0,0 @@ -/** - * 冒泡排序函数 - * aa bb cc - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - // 你的代码，使无序数组 a 变得有序 - for (int i = 0; i < n - 1; i++) { - for (int j = 0; j < n - i - 1; j++) { - if (a[j] > a[j + 1]) { - - int temp = a[j]; - a[j] = a[j + 1]; - a[j + 1] = temp; - } - } - } -} //end \ No newline at end of file diff --git a/codes/alchemists/.keep b/codes/alchemists/.keep deleted file mode 100644 index e69de29bb2d1d6434b8b29ae775ad8c2e48c5391..0000000000000000000000000000000000000000 diff --git a/codes/alchemists/15772130.java b/codes/alchemists/15772130.java deleted file mode 100644 index 6426772fb479b07ed3be21ef1867921d1dbb194c..0000000000000000000000000000000000000000 --- a/codes/alchemists/15772130.java +++ /dev/null @@ -1,20 +0,0 @@ -/** - * 冒泡排序函数 - * aa bb cc - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - // 你的代码，使无序数组 a 变得有序 - for(int i = 0; i < n; i++) { - for(int j = 0; j < n - i - 1; j++) { - if(a[j] > a[j + 1]) { - int temp = a[j]; - a [j] = a[j + 1]; - a[j + 1] = temp; - } - } - } - - -} //end \ No newline at end of file diff --git a/codes/alleylyf666/.keep b/codes/alleylyf666/.keep deleted file mode 100644 index e69de29bb2d1d6434b8b29ae775ad8c2e48c5391..0000000000000000000000000000000000000000 diff --git a/codes/alleylyf666/15844554.java b/codes/alleylyf666/15844554.java deleted file mode 100644 index 6e9861fa3ec6d5a2553cdccd1bb1e977430c671b..0000000000000000000000000000000000000000 --- a/codes/alleylyf666/15844554.java +++ /dev/null @@ -1,19 +0,0 @@ -/** - * 冒泡排序函数 - * aa bb cc - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - // 你的代码，使无序数组 a 变得有序 - for (int i = 0; i < n - 1; i++) { - for (int j = 0; j < n - i - 1; j++) { - if (a[j] > a[j + 1]) { - - int temp = a[j]; - a[j] = a[j + 1]; - a[j + 1] = temp; - } - } - } -} //end \ No newline at end of file diff --git a/codes/amoxilin/15519580.java b/codes/amoxilin/15519580.java deleted file mode 100644 index c2ba699c076fe8d3236794c7d4528ef22f66bb28..0000000000000000000000000000000000000000 --- a/codes/amoxilin/15519580.java +++ /dev/null @@ -1,12 +0,0 @@ -public static void bubbleSort(int [] a, int n){ - for(int i = 0; i < n-1 ; i++){ - for (int j = 0;j < n-1-i;j++){ - if(a[j] > a[j+1]){ - int temp = a[j]; - a[j] = a[j+1]; - a[j+1] = temp; - } - } - } - -} diff --git a/codes/an629712562/.keep b/codes/an629712562/.keep deleted file mode 100644 index e69de29bb2d1d6434b8b29ae775ad8c2e48c5391..0000000000000000000000000000000000000000 diff --git a/codes/an629712562/15629207.java b/codes/an629712562/15629207.java deleted file mode 100644 index 7a18dd82cbeb41d84bf819d91c39abcbb9758f55..0000000000000000000000000000000000000000 --- a/codes/an629712562/15629207.java +++ /dev/null @@ -1,20 +0,0 @@ -/** - * 冒泡排序函数 - * aa bb cc - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - // 你的代码，使无序数组 a 变得有序 - for(int i = 0; i < n; i++) { - for(int an = 0; an < n - i - 1; an++) { - if(a[an] > a[an + 1]) { - int temp = a[an]; - a [an] = a[an + 1]; - a[an + 1] = temp; - } - } - } - - -} //end,an \ No newline at end of file diff --git a/codes/andng00/.keep b/codes/andng00/.keep deleted file mode 100644 index e69de29bb2d1d6434b8b29ae775ad8c2e48c5391..0000000000000000000000000000000000000000 diff --git a/codes/andng00/15836934.java b/codes/andng00/15836934.java deleted file mode 100644 index 6426772fb479b07ed3be21ef1867921d1dbb194c..0000000000000000000000000000000000000000 --- a/codes/andng00/15836934.java +++ /dev/null @@ -1,20 +0,0 @@ -/** - * 冒泡排序函数 - * aa bb cc - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - // 你的代码，使无序数组 a 变得有序 - for(int i = 0; i < n; i++) { - for(int j = 0; j < n - i - 1; j++) { - if(a[j] > a[j + 1]) { - int temp = a[j]; - a [j] = a[j + 1]; - a[j + 1] = temp; - } - } - } - - -} //end \ No newline at end of file diff --git a/codes/angel521/15721117.java b/codes/angel521/15721117.java deleted file mode 100644 index 20575dc4ccc75a5bf6af9ea4614fcfa2a84fdeaf..0000000000000000000000000000000000000000 --- a/codes/angel521/15721117.java +++ /dev/null @@ -1,19 +0,0 @@ -/** - * 冒泡排序函数 - * aa bb cc - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - // 你的代码，使无序数组 a 变得有序 - for (int i = 0; i < n - 1; i++) { - for (int j = 0; j < n - i - 1; j++) { - if (a[j] > a[j + 1]) { - // 交换元素 - int temp = a[j]; - a[j] = a[j + 1]; - a[j + 1] = temp; - } - } - } -} //end diff --git a/codes/anqi12301/15532075.java b/codes/anqi12301/15532075.java deleted file mode 100644 index b9f3f205791836ed8f2cbe07ba9344f6c861b74b..0000000000000000000000000000000000000000 --- a/codes/anqi12301/15532075.java +++ /dev/null @@ -1,18 +0,0 @@ -/** - * 冒泡排序函数 - * aa bb cc - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - for(int i = 0; i < n-1 ; i++){ - for (int j = 0;j < n-1-i;j++){ - if(a[j] > a[j+1]){ - int temp = a[j]; - a[j] = a[j+1]; - a[j+1] = temp; - } - } - } - -} //end \ No newline at end of file diff --git a/codes/aqbodc/15816413.java b/codes/aqbodc/15816413.java deleted file mode 100644 index 40ffda035fcbb6e061d5044b7a955abbb27000c6..0000000000000000000000000000000000000000 --- a/codes/aqbodc/15816413.java +++ /dev/null @@ -1,18 +0,0 @@ -public static void bubbleSort(int[] a,int n) -{ - for(int i =0;i a[j]) - { - int tmp = a[i]; - a[i] = a[j]; - a[j] = tmp; - } - - } - - } - return ; -} diff --git a/codes/argument/11235878.java b/codes/argument/11235878.java deleted file mode 100644 index deb2438785c696d09e985c35997c2f2bc5445a90..0000000000000000000000000000000000000000 --- a/codes/argument/11235878.java +++ /dev/null @@ -1,18 +0,0 @@ -/** - * 冒泡排序函数 - * aa bb cc - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - // 你的代码，使无序数组 a 变得有序 - for (int i=0 ; ia[k+1]) { - int temp=a[k]; - a[k]=a[k+1]; - a[k+1]=temp; - } - } - } -} //end \ No newline at end of file diff --git a/codes/aria111/.keep b/codes/aria111/.keep deleted file mode 100644 index e69de29bb2d1d6434b8b29ae775ad8c2e48c5391..0000000000000000000000000000000000000000 diff --git a/codes/aria111/10043458.java b/codes/aria111/10043458.java deleted file mode 100644 index 667eee0f585ec38ce639cb36d80df080e935946d..0000000000000000000000000000000000000000 --- a/codes/aria111/10043458.java +++ /dev/null @@ -1,11 +0,0 @@ -public static void bubbleSort(int [] a,int n){ - for(int i = 0; i < n-1 ; i++){ - for (int j = 0;j < n-1-i;j++){ - if(a[j] > a[j+1]){ - int temp = a[j]; - a[j] = a[j+1]; - a[j+1] = temp; - } - } - } -} \ No newline at end of file diff --git a/codes/arvinsblog/15525225.java b/codes/arvinsblog/15525225.java deleted file mode 100644 index 20575dc4ccc75a5bf6af9ea4614fcfa2a84fdeaf..0000000000000000000000000000000000000000 --- a/codes/arvinsblog/15525225.java +++ /dev/null @@ -1,19 +0,0 @@ -/** - * 冒泡排序函数 - * aa bb cc - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - // 你的代码，使无序数组 a 变得有序 - for (int i = 0; i < n - 1; i++) { - for (int j = 0; j < n - i - 1; j++) { - if (a[j] > a[j + 1]) { - // 交换元素 - int temp = a[j]; - a[j] = a[j + 1]; - a[j + 1] = temp; - } - } - } -} //end diff --git a/codes/as1234567890/.keep b/codes/as1234567890/.keep deleted file mode 100644 index e69de29bb2d1d6434b8b29ae775ad8c2e48c5391..0000000000000000000000000000000000000000 diff --git a/codes/as1234567890/10979740.java b/codes/as1234567890/10979740.java deleted file mode 100644 index 9eccfac593dd84bb4c285d230d4de6b8c72a1d65..0000000000000000000000000000000000000000 --- a/codes/as1234567890/10979740.java +++ /dev/null @@ -1,11 +0,0 @@ -public static void bubbleSort(int [] a, int n) { - for (int i=0 ; ia[j+1]) { - int temp=a[j]; - a[j]=a[j+1]; - a[j+1]=temp; - } - } - } -} diff --git a/codes/asdafcv22/.keep b/codes/asdafcv22/.keep deleted file mode 100644 index e69de29bb2d1d6434b8b29ae775ad8c2e48c5391..0000000000000000000000000000000000000000 diff --git a/codes/asdafcv22/15742508.java b/codes/asdafcv22/15742508.java deleted file mode 100644 index 6e9861fa3ec6d5a2553cdccd1bb1e977430c671b..0000000000000000000000000000000000000000 --- a/codes/asdafcv22/15742508.java +++ /dev/null @@ -1,19 +0,0 @@ -/** - * 冒泡排序函数 - * aa bb cc - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - // 你的代码，使无序数组 a 变得有序 - for (int i = 0; i < n - 1; i++) { - for (int j = 0; j < n - i - 1; j++) { - if (a[j] > a[j + 1]) { - - int temp = a[j]; - a[j] = a[j + 1]; - a[j + 1] = temp; - } - } - } -} //end \ No newline at end of file diff --git a/codes/asen_1898/15541357.java b/codes/asen_1898/15541357.java deleted file mode 100644 index ae82e695cbfd360050241c3f1f592658c8c1d4e7..0000000000000000000000000000000000000000 --- a/codes/asen_1898/15541357.java +++ /dev/null @@ -1,35 +0,0 @@ -/** - - * 冒泡排序函数 - - * aa bb cc - - * @param a 待排序的数组 - - * @param n 待排序的数组长度 - - */ - -public static void bubbleSort(int [] a, int n){ - - for(int i = 0; i < n-1 ; i++){ - - for (int j = 0;j < n-1-i;j++){ - - if(a[j] > a[j+1]){ - - int temp = a[j]; - - a[j] = a[j+1]; - - a[j+1] = temp; - - } - - } - - } - - - -} //end diff --git a/codes/asf1afasd4/.keep b/codes/asf1afasd4/.keep deleted file mode 100644 index e69de29bb2d1d6434b8b29ae775ad8c2e48c5391..0000000000000000000000000000000000000000 diff --git a/codes/asf1afasd4/15831471.java b/codes/asf1afasd4/15831471.java deleted file mode 100644 index 6e9861fa3ec6d5a2553cdccd1bb1e977430c671b..0000000000000000000000000000000000000000 --- a/codes/asf1afasd4/15831471.java +++ /dev/null @@ -1,19 +0,0 @@ -/** - * 冒泡排序函数 - * aa bb cc - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - // 你的代码，使无序数组 a 变得有序 - for (int i = 0; i < n - 1; i++) { - for (int j = 0; j < n - i - 1; j++) { - if (a[j] > a[j + 1]) { - - int temp = a[j]; - a[j] = a[j + 1]; - a[j + 1] = temp; - } - } - } -} //end \ No newline at end of file diff --git a/codes/asf424524sa/.keep b/codes/asf424524sa/.keep deleted file mode 100644 index e69de29bb2d1d6434b8b29ae775ad8c2e48c5391..0000000000000000000000000000000000000000 diff --git a/codes/asf424524sa/15830408.java b/codes/asf424524sa/15830408.java deleted file mode 100644 index 6e9861fa3ec6d5a2553cdccd1bb1e977430c671b..0000000000000000000000000000000000000000 --- a/codes/asf424524sa/15830408.java +++ /dev/null @@ -1,19 +0,0 @@ -/** - * 冒泡排序函数 - * aa bb cc - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - // 你的代码，使无序数组 a 变得有序 - for (int i = 0; i < n - 1; i++) { - for (int j = 0; j < n - i - 1; j++) { - if (a[j] > a[j + 1]) { - - int temp = a[j]; - a[j] = a[j + 1]; - a[j + 1] = temp; - } - } - } -} //end \ No newline at end of file diff --git a/codes/asf435adf/.keep b/codes/asf435adf/.keep deleted file mode 100644 index e69de29bb2d1d6434b8b29ae775ad8c2e48c5391..0000000000000000000000000000000000000000 diff --git a/codes/asf435adf/15743462.java b/codes/asf435adf/15743462.java deleted file mode 100644 index 6e9861fa3ec6d5a2553cdccd1bb1e977430c671b..0000000000000000000000000000000000000000 --- a/codes/asf435adf/15743462.java +++ /dev/null @@ -1,19 +0,0 @@ -/** - * 冒泡排序函数 - * aa bb cc - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - // 你的代码，使无序数组 a 变得有序 - for (int i = 0; i < n - 1; i++) { - for (int j = 0; j < n - i - 1; j++) { - if (a[j] > a[j + 1]) { - - int temp = a[j]; - a[j] = a[j + 1]; - a[j + 1] = temp; - } - } - } -} //end \ No newline at end of file diff --git a/codes/asfafas8931/.keep b/codes/asfafas8931/.keep deleted file mode 100644 index e69de29bb2d1d6434b8b29ae775ad8c2e48c5391..0000000000000000000000000000000000000000 diff --git a/codes/asfafas8931/15831378.java b/codes/asfafas8931/15831378.java deleted file mode 100644 index 6e9861fa3ec6d5a2553cdccd1bb1e977430c671b..0000000000000000000000000000000000000000 --- a/codes/asfafas8931/15831378.java +++ /dev/null @@ -1,19 +0,0 @@ -/** - * 冒泡排序函数 - * aa bb cc - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - // 你的代码，使无序数组 a 变得有序 - for (int i = 0; i < n - 1; i++) { - for (int j = 0; j < n - i - 1; j++) { - if (a[j] > a[j + 1]) { - - int temp = a[j]; - a[j] = a[j + 1]; - a[j + 1] = temp; - } - } - } -} //end \ No newline at end of file diff --git a/codes/asfasc228/.keep b/codes/asfasc228/.keep deleted file mode 100644 index e69de29bb2d1d6434b8b29ae775ad8c2e48c5391..0000000000000000000000000000000000000000 diff --git a/codes/asfasc228/15831133.java b/codes/asfasc228/15831133.java deleted file mode 100644 index 6e9861fa3ec6d5a2553cdccd1bb1e977430c671b..0000000000000000000000000000000000000000 --- a/codes/asfasc228/15831133.java +++ /dev/null @@ -1,19 +0,0 @@ -/** - * 冒泡排序函数 - * aa bb cc - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - // 你的代码，使无序数组 a 变得有序 - for (int i = 0; i < n - 1; i++) { - for (int j = 0; j < n - i - 1; j++) { - if (a[j] > a[j + 1]) { - - int temp = a[j]; - a[j] = a[j + 1]; - a[j + 1] = temp; - } - } - } -} //end \ No newline at end of file diff --git a/codes/asfasfa22/.keep b/codes/asfasfa22/.keep deleted file mode 100644 index e69de29bb2d1d6434b8b29ae775ad8c2e48c5391..0000000000000000000000000000000000000000 diff --git a/codes/asfasfa22/15742636.java b/codes/asfasfa22/15742636.java deleted file mode 100644 index 6e9861fa3ec6d5a2553cdccd1bb1e977430c671b..0000000000000000000000000000000000000000 --- a/codes/asfasfa22/15742636.java +++ /dev/null @@ -1,19 +0,0 @@ -/** - * 冒泡排序函数 - * aa bb cc - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - // 你的代码，使无序数组 a 变得有序 - for (int i = 0; i < n - 1; i++) { - for (int j = 0; j < n - i - 1; j++) { - if (a[j] > a[j + 1]) { - - int temp = a[j]; - a[j] = a[j + 1]; - a[j + 1] = temp; - } - } - } -} //end \ No newline at end of file diff --git a/codes/asfasfa22/15864908.java b/codes/asfasfa22/15864908.java deleted file mode 100644 index 6e9861fa3ec6d5a2553cdccd1bb1e977430c671b..0000000000000000000000000000000000000000 --- a/codes/asfasfa22/15864908.java +++ /dev/null @@ -1,19 +0,0 @@ -/** - * 冒泡排序函数 - * aa bb cc - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - // 你的代码，使无序数组 a 变得有序 - for (int i = 0; i < n - 1; i++) { - for (int j = 0; j < n - i - 1; j++) { - if (a[j] > a[j + 1]) { - - int temp = a[j]; - a[j] = a[j + 1]; - a[j + 1] = temp; - } - } - } -} //end \ No newline at end of file diff --git a/codes/asffasf67/.keep b/codes/asffasf67/.keep deleted file mode 100644 index e69de29bb2d1d6434b8b29ae775ad8c2e48c5391..0000000000000000000000000000000000000000 diff --git a/codes/asffasf67/15743465.java b/codes/asffasf67/15743465.java deleted file mode 100644 index 6e9861fa3ec6d5a2553cdccd1bb1e977430c671b..0000000000000000000000000000000000000000 --- a/codes/asffasf67/15743465.java +++ /dev/null @@ -1,19 +0,0 @@ -/** - * 冒泡排序函数 - * aa bb cc - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - // 你的代码，使无序数组 a 变得有序 - for (int i = 0; i < n - 1; i++) { - for (int j = 0; j < n - i - 1; j++) { - if (a[j] > a[j + 1]) { - - int temp = a[j]; - a[j] = a[j + 1]; - a[j + 1] = temp; - } - } - } -} //end \ No newline at end of file diff --git a/codes/asffsac224/.keep b/codes/asffsac224/.keep deleted file mode 100644 index e69de29bb2d1d6434b8b29ae775ad8c2e48c5391..0000000000000000000000000000000000000000 diff --git a/codes/asffsac224/15831080.java b/codes/asffsac224/15831080.java deleted file mode 100644 index 6e9861fa3ec6d5a2553cdccd1bb1e977430c671b..0000000000000000000000000000000000000000 --- a/codes/asffsac224/15831080.java +++ /dev/null @@ -1,19 +0,0 @@ -/** - * 冒泡排序函数 - * aa bb cc - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - // 你的代码，使无序数组 a 变得有序 - for (int i = 0; i < n - 1; i++) { - for (int j = 0; j < n - i - 1; j++) { - if (a[j] > a[j + 1]) { - - int temp = a[j]; - a[j] = a[j + 1]; - a[j + 1] = temp; - } - } - } -} //end \ No newline at end of file diff --git a/codes/asfsafaf223/.keep b/codes/asfsafaf223/.keep deleted file mode 100644 index e69de29bb2d1d6434b8b29ae775ad8c2e48c5391..0000000000000000000000000000000000000000 diff --git a/codes/asfsafaf223/15743410.java b/codes/asfsafaf223/15743410.java deleted file mode 100644 index 6e9861fa3ec6d5a2553cdccd1bb1e977430c671b..0000000000000000000000000000000000000000 --- a/codes/asfsafaf223/15743410.java +++ /dev/null @@ -1,19 +0,0 @@ -/** - * 冒泡排序函数 - * aa bb cc - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - // 你的代码，使无序数组 a 变得有序 - for (int i = 0; i < n - 1; i++) { - for (int j = 0; j < n - i - 1; j++) { - if (a[j] > a[j + 1]) { - - int temp = a[j]; - a[j] = a[j + 1]; - a[j + 1] = temp; - } - } - } -} //end \ No newline at end of file diff --git a/codes/asfsyw34124/.keep b/codes/asfsyw34124/.keep deleted file mode 100644 index e69de29bb2d1d6434b8b29ae775ad8c2e48c5391..0000000000000000000000000000000000000000 diff --git a/codes/asfsyw34124/15830756.java b/codes/asfsyw34124/15830756.java deleted file mode 100644 index 6e9861fa3ec6d5a2553cdccd1bb1e977430c671b..0000000000000000000000000000000000000000 --- a/codes/asfsyw34124/15830756.java +++ /dev/null @@ -1,19 +0,0 @@ -/** - * 冒泡排序函数 - * aa bb cc - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - // 你的代码，使无序数组 a 变得有序 - for (int i = 0; i < n - 1; i++) { - for (int j = 0; j < n - i - 1; j++) { - if (a[j] > a[j + 1]) { - - int temp = a[j]; - a[j] = a[j + 1]; - a[j + 1] = temp; - } - } - } -} //end \ No newline at end of file diff --git a/codes/aurorawhite/15775954.java b/codes/aurorawhite/15775954.java deleted file mode 100644 index 059b69f48a602189a8a77a7c3eee82e3bbb83729..0000000000000000000000000000000000000000 --- a/codes/aurorawhite/15775954.java +++ /dev/null @@ -1,27 +0,0 @@ -/** - * 冒泡排序函数 - * 将数组中的元素按照从小到大的顺序进行排序 - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int[] a, int n) { - for (int i = 0; i < n - 1; i++) { - // 标志位，表示这一趟是否有交换，优化冒泡排序性能 - boolean swapped = false; - for (int j = 0; j < n - i - 1; j++) { - // 如果前一个元素比后一个元素大，则交换它们的位置 - if (a[j] > a[j + 1]) { - // 交换a[j]和a[j+1] - int temp = a[j]; - a[j] = a[j + 1]; - a[j + 1] = temp; - // 发生了交换，将标志位设为true - swapped = true; - } - } - // 如果在一趟排序中未发生交换，则说明数组已经有序，可以直接退出循环 - if (!swapped) { - break; - } - } -} //e diff --git a/codes/aurorawhite03/15831384.java b/codes/aurorawhite03/15831384.java deleted file mode 100644 index 84f1613b5c5976d62dde0a0c5a2471618ddb3bd0..0000000000000000000000000000000000000000 --- a/codes/aurorawhite03/15831384.java +++ /dev/null @@ -1,27 +0,0 @@ -/** - * 冒泡排序函数 - * 将数组中的元素按照从小到大的顺序进行排序 - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int[] a, int n) { - for (int i = 0; i < n - 1; i++) { - // 标志位，表示这一趟是否有交换，优化冒泡排序性能 - boolean swapped = false; - for (int j = 0; j < n - i - 1; j++) { - // 如果前一个元素比后一个元素大，则交换它们的位置 - if (a[j] > a[j + 1]) { - // 交换a[j]和a[j+1] - int temp = a[j]; - a[j] = a[j + 1]; - a[j + 1] = temp; - // 发生了交换，将标志位设为true - swapped = true; - } - } - // 如果在一趟排序中未发生交换，则说明数组已经有序，可以直接退出循环 - if (!swapped) { - break; - } - } -} // end diff --git a/codes/aurorawhite04/15837015.java b/codes/aurorawhite04/15837015.java deleted file mode 100644 index 84f1613b5c5976d62dde0a0c5a2471618ddb3bd0..0000000000000000000000000000000000000000 --- a/codes/aurorawhite04/15837015.java +++ /dev/null @@ -1,27 +0,0 @@ -/** - * 冒泡排序函数 - * 将数组中的元素按照从小到大的顺序进行排序 - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int[] a, int n) { - for (int i = 0; i < n - 1; i++) { - // 标志位，表示这一趟是否有交换，优化冒泡排序性能 - boolean swapped = false; - for (int j = 0; j < n - i - 1; j++) { - // 如果前一个元素比后一个元素大，则交换它们的位置 - if (a[j] > a[j + 1]) { - // 交换a[j]和a[j+1] - int temp = a[j]; - a[j] = a[j + 1]; - a[j + 1] = temp; - // 发生了交换，将标志位设为true - swapped = true; - } - } - // 如果在一趟排序中未发生交换，则说明数组已经有序，可以直接退出循环 - if (!swapped) { - break; - } - } -} // end diff --git a/codes/avania/14344405.java b/codes/avania/14344405.java deleted file mode 100644 index 6115f0ce1ea819bc98cdd13856a7b2619b01db61..0000000000000000000000000000000000000000 --- a/codes/avania/14344405.java +++ /dev/null @@ -1,18 +0,0 @@ -/** - * 冒泡排序函数 - * aa bb cc - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - // 你的代码，使无序数组 a 变得有序 - for(int i = 0; i < n - 1; ++i) { - for(int j = 0; j < n - i - 1; ++j){ - if(a[j] > a[j+1]){ - int k = a[j]; - a[j] = a[j+1]; - a[j+1] = k; - } - } - } -} //end diff --git a/codes/aweige/.keep b/codes/aweige/.keep deleted file mode 100644 index e69de29bb2d1d6434b8b29ae775ad8c2e48c5391..0000000000000000000000000000000000000000 diff --git a/codes/aweige/15855036.java b/codes/aweige/15855036.java deleted file mode 100644 index 6426772fb479b07ed3be21ef1867921d1dbb194c..0000000000000000000000000000000000000000 --- a/codes/aweige/15855036.java +++ /dev/null @@ -1,20 +0,0 @@ -/** - * 冒泡排序函数 - * aa bb cc - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - // 你的代码，使无序数组 a 变得有序 - for(int i = 0; i < n; i++) { - for(int j = 0; j < n - i - 1; j++) { - if(a[j] > a[j + 1]) { - int temp = a[j]; - a [j] = a[j + 1]; - a[j + 1] = temp; - } - } - } - - -} //end \ No newline at end of file diff --git a/codes/azhen666/15569325.java b/codes/azhen666/15569325.java deleted file mode 100644 index 8fa7ad575a3fe44df4708be30eddab3ad58f6147..0000000000000000000000000000000000000000 --- a/codes/azhen666/15569325.java +++ /dev/null @@ -1,20 +0,0 @@ -/** - * 冒泡排序函数 - * 通过重复地遍历要排序的数组，比较每对相邻的元素，并在必要时交换它们的位置， - * 遍历数组的工作是重复地进行直到没有再需要交换，也就是说该数组已经排序完成。 - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int[] a, int n) { - for (int i = 0; i < n - 1; i++) { // 外层循环控制所有趟排序 - for (int j = 0; j < n - i - 1; j++) { // 内层循环控制每一趟排序的比较和交换 - // 如果当前元素大于下一个元素，则交换它们 - if (a[j] > a[j + 1]) { - // 交换 a[j] 和 a[j+1] - int temp = a[j]; - a[j] = a[j + 1]; - a[j + 1] = temp; - } - } - } -} // end diff --git a/codes/b1t333/12428176.java b/codes/b1t333/12428176.java deleted file mode 100644 index 6a52fcd0769f4ebb66b54603d5d70f944c4fe600..0000000000000000000000000000000000000000 --- a/codes/b1t333/12428176.java +++ /dev/null @@ -1,36 +0,0 @@ - -/* - * SonarQube，开源软件质量管理工具。 - * 版权所有 (C) 2008-2013 SonarSource - * mailto:contact AT sonarsource DOT com - * - * SonarQube 是免费软件；您可以重新分发它和/或 - * 根据 GNU Lesser General Public 的条款修改它 - * 由自由软件基金会发布的许可证； - * 许可证的第 3 版，或（由您选择）任何更高版本。 - * - * 分发 SonarQube 是为了希望它有用， - * 但没有任何保证；甚至没有 - * 适销性或适用于特定目的的暗示保证。有关详细信息，请参阅 GNU - * 宽松通用公共许可证。 - * - * 您应该已经收到一份 GNU 宽松通用公共许可证的副本 - * 以及此程序；如果没有，请写信给自由软件基金会， - * Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301, USA。 - */ - public static void bubbleSort(int [] a, int n) - { - for(int i = 0; i < n - 1; i ++) - { - for(int j = 0; j < n - 1 - i; j++) - { - if(a[j] > a[j+1]) - { - int temp = a[j]; - a[j] = a[j+1]; - a[j+1] = temp; - } - } - } - } - diff --git a/codes/b2247960736/15520708.java b/codes/b2247960736/15520708.java deleted file mode 100644 index 72e12e15a127c15b0f77a113cb8f811237348f7c..0000000000000000000000000000000000000000 --- a/codes/b2247960736/15520708.java +++ /dev/null @@ -1,17 +0,0 @@ -/** - * 冒泡排序函数 - * aa bb cc - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - for (int i = 0; i < n - 1; i++) { // 外层循环控制需要遍历的轮数 - for (int j = 0; j < n - i - 1; j++) { // 内层循环控制每轮中相邻元素的比较 - if (a[j] > a[j + 1]) { // 如果前一个元素大于后一个元素，则交换它们 - int temp = a[j]; - a[j] = a[j + 1]; - a[j + 1] = temp; - } - } - } -} //end diff --git a/codes/bIU999lve/.keep b/codes/bIU999lve/.keep deleted file mode 100644 index e69de29bb2d1d6434b8b29ae775ad8c2e48c5391..0000000000000000000000000000000000000000 diff --git a/codes/bIU999lve/11090549.java b/codes/bIU999lve/11090549.java deleted file mode 100644 index 29d27043d3c8103739e7a1d2a27e77b4cc475876..0000000000000000000000000000000000000000 --- a/codes/bIU999lve/11090549.java +++ /dev/null @@ -1,23 +0,0 @@ -/** - * 冒泡排序函数 - * aa bb cc - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - // 你的代码，使无序数组 a 变得有序 - for (int i = 0; i < n-1; i++) { - for (int j = 0; j < n-1-i; j++) { - if (a[j] >= a[j+1]) { - int temp = a[j]; - a[j] = a[j+1]; - a[j+1] = temp; - } - } - } - - System.out.print("冒泡排序的结果是： "); - for (int i : a) { - System.out.print(i + " "); - } -} //end \ No newline at end of file diff --git a/codes/babala/15779520.java b/codes/babala/15779520.java deleted file mode 100644 index 7cda69aef7c1b1f5d29fcdce4571135003bd79c6..0000000000000000000000000000000000000000 --- a/codes/babala/15779520.java +++ /dev/null @@ -1,27 +0,0 @@ -/** - * 冒泡排序函数 - * 对数组a进行升序排序 - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int[] a, int n) { - for (int i = 0; i < n - 1; i++) { - // 标志位，表示这一趟排序是否有数据交换 - boolean swapped = false; - for (int j = 0; j < n - i - 1; j++) { - // 如果前一个元素大于后一个元素，则交换它们 - if (a[j] > a[j + 1]) { - // 交换元素 - int temp = a[j]; - a[j] = a[j + 1]; - a[j + 1] = temp; - // 发生了交换，标志位设为true - swapped = true; - } - } - // 如果这一趟排序没有发生交换，说明数组已经有序，直接退出循环 - if (!swapped) { - break; - } - } -} // end diff --git a/codes/babale/15775745.java b/codes/babale/15775745.java deleted file mode 100644 index 987377810b5beca8eb4bf5eafeee5db45e234a87..0000000000000000000000000000000000000000 --- a/codes/babale/15775745.java +++ /dev/null @@ -1,20 +0,0 @@ -/** - * 冒泡排序函数 - * aa bb cc - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - // 你的代码，使无序数组 a 变得有序 - for(int i = 0; i < n; i++) { - for(int liuy = 0; liuy < n - i - 1; liuy++) { - if(a[liuy] > a[liuy + 1]) { - int temp = a[liuy]; - a [liuy] = a[liuy + 1]; - a[liuy + 1] = temp; - } - } - } - - -} //end,liuy diff --git a/codes/baiwenyu/.15781013.java.swp b/codes/baiwenyu/.15781013.java.swp deleted file mode 100644 index acd64f622bb827a02e69114f27e1f7a9b80b4984..0000000000000000000000000000000000000000 Binary files a/codes/baiwenyu/.15781013.java.swp and /dev/null differ diff --git a/codes/baiwenyu/15781013.java b/codes/baiwenyu/15781013.java deleted file mode 100644 index cac0dcf1e936c4d36670a0ef4f7462c7a3ed3e56..0000000000000000000000000000000000000000 --- a/codes/baiwenyu/15781013.java +++ /dev/null @@ -1,28 +0,0 @@ -/** - * 冒泡排序函数 - * aa bb cc - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - if (n <= 1) return; // 如果数组长度小于等于1，不需要排序 - - boolean swapped; - for (int i = 0; i < n - 1; i++) { - swapped = false; - for (int j = 0; j < n - 1 - i; j++) { - if (a[j] > a[j + 1]) { - // 交换a[j]和a[j + 1] - int temp = a[j]; - a[j] = a[j + 1]; - a[j + 1] = temp; - swapped = true; - } - } - // 如果这一轮没有发生交换，说明数组已经有序，退出排序 - if (!swapped) { - break; - } - } -} //end - diff --git a/codes/baixiaobai/15198492.java b/codes/baixiaobai/15198492.java deleted file mode 100644 index e9ed4eae2a9d51ed8bc197666a445432f8e44921..0000000000000000000000000000000000000000 --- a/codes/baixiaobai/15198492.java +++ /dev/null @@ -1,20 +0,0 @@ -/** - * 冒泡排序函数 - * aa bb cc - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n) { - // 你的代码，使无序数组 a 变得有序 - for (int i = 0; i < n - 1; i++) { - for (int j = 0; j < n - i - 1; j++) { - if (a[j] < a[j + 1]) { - continue; - } - // 如果前一个元素比后一个元素大，则交换两者 - int temp = a[j + 1]; - a[j + 1] = a[j]; - a[j] = temp; - } - } -} //end \ No newline at end of file diff --git a/codes/baixiaobai/15198733.java b/codes/baixiaobai/15198733.java deleted file mode 100644 index e9ed4eae2a9d51ed8bc197666a445432f8e44921..0000000000000000000000000000000000000000 --- a/codes/baixiaobai/15198733.java +++ /dev/null @@ -1,20 +0,0 @@ -/** - * 冒泡排序函数 - * aa bb cc - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n) { - // 你的代码，使无序数组 a 变得有序 - for (int i = 0; i < n - 1; i++) { - for (int j = 0; j < n - i - 1; j++) { - if (a[j] < a[j + 1]) { - continue; - } - // 如果前一个元素比后一个元素大，则交换两者 - int temp = a[j + 1]; - a[j + 1] = a[j]; - a[j] = temp; - } - } -} //end \ No newline at end of file diff --git a/codes/baixiaobai/15198745.java b/codes/baixiaobai/15198745.java deleted file mode 100644 index e9ed4eae2a9d51ed8bc197666a445432f8e44921..0000000000000000000000000000000000000000 --- a/codes/baixiaobai/15198745.java +++ /dev/null @@ -1,20 +0,0 @@ -/** - * 冒泡排序函数 - * aa bb cc - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n) { - // 你的代码，使无序数组 a 变得有序 - for (int i = 0; i < n - 1; i++) { - for (int j = 0; j < n - i - 1; j++) { - if (a[j] < a[j + 1]) { - continue; - } - // 如果前一个元素比后一个元素大，则交换两者 - int temp = a[j + 1]; - a[j + 1] = a[j]; - a[j] = temp; - } - } -} //end \ No newline at end of file diff --git a/codes/baixiaobai/15199487.java b/codes/baixiaobai/15199487.java deleted file mode 100644 index e9ed4eae2a9d51ed8bc197666a445432f8e44921..0000000000000000000000000000000000000000 --- a/codes/baixiaobai/15199487.java +++ /dev/null @@ -1,20 +0,0 @@ -/** - * 冒泡排序函数 - * aa bb cc - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n) { - // 你的代码，使无序数组 a 变得有序 - for (int i = 0; i < n - 1; i++) { - for (int j = 0; j < n - i - 1; j++) { - if (a[j] < a[j + 1]) { - continue; - } - // 如果前一个元素比后一个元素大，则交换两者 - int temp = a[j + 1]; - a[j + 1] = a[j]; - a[j] = temp; - } - } -} //end \ No newline at end of file diff --git a/codes/banlala/15846317.java b/codes/banlala/15846317.java deleted file mode 100644 index 987377810b5beca8eb4bf5eafeee5db45e234a87..0000000000000000000000000000000000000000 --- a/codes/banlala/15846317.java +++ /dev/null @@ -1,20 +0,0 @@ -/** - * 冒泡排序函数 - * aa bb cc - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - // 你的代码，使无序数组 a 变得有序 - for(int i = 0; i < n; i++) { - for(int liuy = 0; liuy < n - i - 1; liuy++) { - if(a[liuy] > a[liuy + 1]) { - int temp = a[liuy]; - a [liuy] = a[liuy + 1]; - a[liuy + 1] = temp; - } - } - } - - -} //end,liuy diff --git a/codes/baozhang/.keep b/codes/baozhang/.keep deleted file mode 100644 index e69de29bb2d1d6434b8b29ae775ad8c2e48c5391..0000000000000000000000000000000000000000 diff --git a/codes/baozhang/15860610.java b/codes/baozhang/15860610.java deleted file mode 100644 index 6426772fb479b07ed3be21ef1867921d1dbb194c..0000000000000000000000000000000000000000 --- a/codes/baozhang/15860610.java +++ /dev/null @@ -1,20 +0,0 @@ -/** - * 冒泡排序函数 - * aa bb cc - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - // 你的代码，使无序数组 a 变得有序 - for(int i = 0; i < n; i++) { - for(int j = 0; j < n - i - 1; j++) { - if(a[j] > a[j + 1]) { - int temp = a[j]; - a [j] = a[j + 1]; - a[j + 1] = temp; - } - } - } - - -} //end \ No newline at end of file diff --git a/codes/bbb222/.keep b/codes/bbb222/.keep deleted file mode 100644 index e69de29bb2d1d6434b8b29ae775ad8c2e48c5391..0000000000000000000000000000000000000000 diff --git a/codes/bbb222/15831163.java b/codes/bbb222/15831163.java deleted file mode 100644 index 6426772fb479b07ed3be21ef1867921d1dbb194c..0000000000000000000000000000000000000000 --- a/codes/bbb222/15831163.java +++ /dev/null @@ -1,20 +0,0 @@ -/** - * 冒泡排序函数 - * aa bb cc - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - // 你的代码，使无序数组 a 变得有序 - for(int i = 0; i < n; i++) { - for(int j = 0; j < n - i - 1; j++) { - if(a[j] > a[j + 1]) { - int temp = a[j]; - a [j] = a[j + 1]; - a[j + 1] = temp; - } - } - } - - -} //end \ No newline at end of file diff --git a/codes/bbswangzhs/.keep b/codes/bbswangzhs/.keep deleted file mode 100644 index e69de29bb2d1d6434b8b29ae775ad8c2e48c5391..0000000000000000000000000000000000000000 diff --git a/codes/bbswangzhs/15844812.java b/codes/bbswangzhs/15844812.java deleted file mode 100644 index 6e9861fa3ec6d5a2553cdccd1bb1e977430c671b..0000000000000000000000000000000000000000 --- a/codes/bbswangzhs/15844812.java +++ /dev/null @@ -1,19 +0,0 @@ -/** - * 冒泡排序函数 - * aa bb cc - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - // 你的代码，使无序数组 a 变得有序 - for (int i = 0; i < n - 1; i++) { - for (int j = 0; j < n - i - 1; j++) { - if (a[j] > a[j + 1]) { - - int temp = a[j]; - a[j] = a[j + 1]; - a[j + 1] = temp; - } - } - } -} //end \ No newline at end of file diff --git a/codes/bc521bc/9954342.java b/codes/bc521bc/9954342.java deleted file mode 100644 index 82b73c8ff8181a822b4e5b9b4a74866761c7b1ca..0000000000000000000000000000000000000000 --- a/codes/bc521bc/9954342.java +++ /dev/null @@ -1,20 +0,0 @@ -/** - * 冒泡排序函数 - * aa bb cc - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - // 你的代码，使无序数组 a 变得有序 - for(int i = 0 ; i < n - 1 ; i++){ - for(int j = 0 ; j < n - 1 - i ; j++){ - if(a[j] > a[j + 1]){ - int tmp = a[j]; - a[j] = a[j + 1]; - a[j + 1] = tmp; - } - } - } - -} //end - diff --git a/codes/bc99991/11118867.java b/codes/bc99991/11118867.java deleted file mode 100644 index 9e7534d4b41cf071c848fa4d5c08c6519526b6e3..0000000000000000000000000000000000000000 --- a/codes/bc99991/11118867.java +++ /dev/null @@ -1,18 +0,0 @@ -/** - * 冒泡 排序 函数 - * aa bb cc - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - // 你的代码，使无序数组 a 变得有序 - for (int i = 0; i < n; i++) { - for (int j = 0; j < i; j++) { - if (a[i] < a[j]) { - int t = a[i]; - a[i] = a[j]; - a[j] = t; - } - } - } -}//end \ No newline at end of file diff --git a/codes/beaker123/15831015.java b/codes/beaker123/15831015.java deleted file mode 100644 index ab6924546daf0bbe8b84512c601a0fa7bb67e168..0000000000000000000000000000000000000000 --- a/codes/beaker123/15831015.java +++ /dev/null @@ -1,29 +0,0 @@ -/** - * 冒泡排序函数 - * 通过重复地遍历待排序的数列，一次比较两个元素，如果他们的顺序错误就把他们交换过来。 - * 遍历数列的工作是重复地进行直到没有再需要交换，也就是说该数列已经排序完成。 - * 这个算法的名字由来是因为越小的元素会经由交换慢慢“浮”到数列的顶端。 - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int[] a, int n) { - for (int i = 0; i < n - 1; i++) { - // 标志位，表示这一趟是否有交换，优化冒泡排序性能 - boolean swapped = false; - for (int j = 0; j < n - i - 1; j++) { - // 如果前一个元素大于后一个元素，则交换它们 - if (a[j] > a[j + 1]) { - // 交换 a[j] 和 a[j+1] - int temp = a[j]; - a[j] = a[j + 1]; - a[j + 1] = temp; - // 表示有数据交换，即这一趟排序有意义 - swapped = true; - } - } - // 如果没有数据交换，说明已经有序，可以提前退出循环 - if (!swapped) { - break; - } - } -} //end diff --git a/codes/beaker1234/15831394.java b/codes/beaker1234/15831394.java deleted file mode 100644 index ab6924546daf0bbe8b84512c601a0fa7bb67e168..0000000000000000000000000000000000000000 --- a/codes/beaker1234/15831394.java +++ /dev/null @@ -1,29 +0,0 @@ -/** - * 冒泡排序函数 - * 通过重复地遍历待排序的数列，一次比较两个元素，如果他们的顺序错误就把他们交换过来。 - * 遍历数列的工作是重复地进行直到没有再需要交换，也就是说该数列已经排序完成。 - * 这个算法的名字由来是因为越小的元素会经由交换慢慢“浮”到数列的顶端。 - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int[] a, int n) { - for (int i = 0; i < n - 1; i++) { - // 标志位，表示这一趟是否有交换，优化冒泡排序性能 - boolean swapped = false; - for (int j = 0; j < n - i - 1; j++) { - // 如果前一个元素大于后一个元素，则交换它们 - if (a[j] > a[j + 1]) { - // 交换 a[j] 和 a[j+1] - int temp = a[j]; - a[j] = a[j + 1]; - a[j + 1] = temp; - // 表示有数据交换，即这一趟排序有意义 - swapped = true; - } - } - // 如果没有数据交换，说明已经有序，可以提前退出循环 - if (!swapped) { - break; - } - } -} //end diff --git a/codes/bei123/15714125.java b/codes/bei123/15714125.java deleted file mode 100644 index 987377810b5beca8eb4bf5eafeee5db45e234a87..0000000000000000000000000000000000000000 --- a/codes/bei123/15714125.java +++ /dev/null @@ -1,20 +0,0 @@ -/** - * 冒泡排序函数 - * aa bb cc - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - // 你的代码，使无序数组 a 变得有序 - for(int i = 0; i < n; i++) { - for(int liuy = 0; liuy < n - i - 1; liuy++) { - if(a[liuy] > a[liuy + 1]) { - int temp = a[liuy]; - a [liuy] = a[liuy + 1]; - a[liuy + 1] = temp; - } - } - } - - -} //end,liuy diff --git a/codes/beibeiya/15775215.java b/codes/beibeiya/15775215.java deleted file mode 100644 index 987377810b5beca8eb4bf5eafeee5db45e234a87..0000000000000000000000000000000000000000 --- a/codes/beibeiya/15775215.java +++ /dev/null @@ -1,20 +0,0 @@ -/** - * 冒泡排序函数 - * aa bb cc - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - // 你的代码，使无序数组 a 变得有序 - for(int i = 0; i < n; i++) { - for(int liuy = 0; liuy < n - i - 1; liuy++) { - if(a[liuy] > a[liuy + 1]) { - int temp = a[liuy]; - a [liuy] = a[liuy + 1]; - a[liuy + 1] = temp; - } - } - } - - -} //end,liuy diff --git a/codes/beiyang/.keep b/codes/beiyang/.keep deleted file mode 100644 index e69de29bb2d1d6434b8b29ae775ad8c2e48c5391..0000000000000000000000000000000000000000 diff --git a/codes/beiyang/15851229.java b/codes/beiyang/15851229.java deleted file mode 100644 index 6426772fb479b07ed3be21ef1867921d1dbb194c..0000000000000000000000000000000000000000 --- a/codes/beiyang/15851229.java +++ /dev/null @@ -1,20 +0,0 @@ -/** - * 冒泡排序函数 - * aa bb cc - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - // 你的代码，使无序数组 a 变得有序 - for(int i = 0; i < n; i++) { - for(int j = 0; j < n - i - 1; j++) { - if(a[j] > a[j + 1]) { - int temp = a[j]; - a [j] = a[j + 1]; - a[j + 1] = temp; - } - } - } - - -} //end \ No newline at end of file diff --git a/codes/benben/15721436.java b/codes/benben/15721436.java deleted file mode 100644 index 987377810b5beca8eb4bf5eafeee5db45e234a87..0000000000000000000000000000000000000000 --- a/codes/benben/15721436.java +++ /dev/null @@ -1,20 +0,0 @@ -/** - * 冒泡排序函数 - * aa bb cc - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - // 你的代码，使无序数组 a 变得有序 - for(int i = 0; i < n; i++) { - for(int liuy = 0; liuy < n - i - 1; liuy++) { - if(a[liuy] > a[liuy + 1]) { - int temp = a[liuy]; - a [liuy] = a[liuy + 1]; - a[liuy + 1] = temp; - } - } - } - - -} //end,liuy diff --git a/codes/bertao/11204465.java b/codes/bertao/11204465.java deleted file mode 100644 index 25d28ba464c4387da28ee5ccecb14ee67ec15321..0000000000000000000000000000000000000000 --- a/codes/bertao/11204465.java +++ /dev/null @@ -1,19 +0,0 @@ -/** - * 冒泡排序函数 - * aa bb cc - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - // 你的代码，使无序数组 a 变得有序 - for(int i = 0 ; i < n - 1 ; i++){ - for(int j = 0 ; j < n - 1 - i ; j++){ - if(a[j] > a[j + 1]){ - int temp = a[j]; - a[j] = a[j + 1]; - a[j + 1] = temp; - } - } - } - -} //end \ No newline at end of file diff --git a/codes/bic-omg/.keep b/codes/bic-omg/.keep deleted file mode 100644 index e69de29bb2d1d6434b8b29ae775ad8c2e48c5391..0000000000000000000000000000000000000000 diff --git a/codes/bic-omg/10972075.java b/codes/bic-omg/10972075.java deleted file mode 100644 index c93923d8fc4260fe1fe393c3461b1320aae87f95..0000000000000000000000000000000000000000 --- a/codes/bic-omg/10972075.java +++ /dev/null @@ -1,11 +0,0 @@ -public static void bubbleSort(int [] a, int n) { - for (int i=0 ; ia[j+1]) { - int temp=a[j]; - a[j]=a[j+1]; - a[j+1]=temp; - } - } - } -} \ No newline at end of file diff --git a/codes/biechigege/18629854.java b/codes/biechigege/18629854.java deleted file mode 100644 index a11ecc4536f1cabcbaa9b2b3b6ea0a3326ebbc6a..0000000000000000000000000000000000000000 --- a/codes/biechigege/18629854.java +++ /dev/null @@ -1,20 +0,0 @@ -/** - * 冒泡排序函数 - * aa bb cc - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - // 你的代码，使无序数组 a 变得有序 - for (int i = 0; i < n; i++) { - for (int j = 0; j < n - i - 1; j++) { - if (a[j] > a[j + 1]) { - int temp = a[j]; - a[j] = a[j + 1]; - a[j + 1] = temp; - } - - } - - } - } //end diff --git a/codes/biechigege/18653461.java b/codes/biechigege/18653461.java deleted file mode 100644 index 2b6ee3e9aa3dc404e9981f35b95755239026607d..0000000000000000000000000000000000000000 --- a/codes/biechigege/18653461.java +++ /dev/null @@ -1,19 +0,0 @@ - /** - * 冒泡排序函数 - * aa bb cc - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ - public static void bubbleSort(int [] a, int n) { - // 你的代码，使无序数组 a 变得有序 - for (int i = 0; i < n; i++) { - for (int j = 0; j < n - i - 1; j++) { - if (a[j] > a[j + 1]) { - int temp = a[j]; - a[j] = a[j + 1]; - a[j + 1] = temp; - } - - } //end - } - } diff --git a/codes/bigDog/11298506.java b/codes/bigDog/11298506.java deleted file mode 100644 index cdabc2e0876ad629e41ff055727cf3af34be8917..0000000000000000000000000000000000000000 --- a/codes/bigDog/11298506.java +++ /dev/null @@ -1,20 +0,0 @@ -/** - * 冒泡排序函数 - * aa bb cc - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - // 你的代码，使无序数组 a 变得有序 - for (int i = 0; i < n; i++) { - for (int j = i + 1; j < n; j++) { - if (a[i] > a[j]) { - int temp = a[j]; - a[j] = a[i]; - a[i] = temp; - - } - } - } - -} //end \ No newline at end of file diff --git a/codes/bitexplorers/.keep b/codes/bitexplorers/.keep deleted file mode 100644 index e69de29bb2d1d6434b8b29ae775ad8c2e48c5391..0000000000000000000000000000000000000000 diff --git a/codes/bitexplorers/15774316.java b/codes/bitexplorers/15774316.java deleted file mode 100644 index 6426772fb479b07ed3be21ef1867921d1dbb194c..0000000000000000000000000000000000000000 --- a/codes/bitexplorers/15774316.java +++ /dev/null @@ -1,20 +0,0 @@ -/** - * 冒泡排序函数 - * aa bb cc - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - // 你的代码，使无序数组 a 变得有序 - for(int i = 0; i < n; i++) { - for(int j = 0; j < n - i - 1; j++) { - if(a[j] > a[j + 1]) { - int temp = a[j]; - a [j] = a[j + 1]; - a[j + 1] = temp; - } - } - } - - -} //end \ No newline at end of file diff --git a/codes/bjfuhyk26/15775960.java b/codes/bjfuhyk26/15775960.java deleted file mode 100644 index 46da388ec87de9d26aecb462b88a19ce4a728da9..0000000000000000000000000000000000000000 --- a/codes/bjfuhyk26/15775960.java +++ /dev/null @@ -1,18 +0,0 @@ -/** - * 冒泡排序函数 - * 通过对相邻元素的比较和交换，将较大的元素逐渐“浮”到数组的末尾，从而完成排序 - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int[] a, int n) { - for (int i = 0; i < n - 1; i++) { // 外层循环控制排序趟数 - for (int j = 0; j < n - i - 1; j++) { // 内层循环控制每趟排序多少次 - // 如果前一个元素大于后一个元素，则交换它们的位置 - if (a[j] > a[j + 1]) { - int temp = a[j]; - a[j] = a[j + 1]; - a[j + 1] = temp; - } - } - } -} // end diff --git a/codes/blackgaryc/14345942.java b/codes/blackgaryc/14345942.java deleted file mode 100644 index 3db39fd1c51220854380ea76eeb72e22cd680bb5..0000000000000000000000000000000000000000 --- a/codes/blackgaryc/14345942.java +++ /dev/null @@ -1,19 +0,0 @@ -/** - * 冒泡排序函数 - * aa bb cc - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - // 你的代码，使无序数组 a 变得有序 - for (int i = 0; i < n - 1; i++) { - for (int j = 0; j < n - 1 - i; j++) { - // 如果前面的元素大于后面的元素，交换它们 - if (a[j] > a[j + 1]) { - int temp = a[j]; - a[j] = a[j + 1]; - a[j + 1] = temp; - } - } - } -} //end diff --git a/codes/bless_qian/15628082.java b/codes/bless_qian/15628082.java deleted file mode 100644 index f1b0ff6158ae2480d9a87f72d07999c5f92df1b1..0000000000000000000000000000000000000000 --- a/codes/bless_qian/15628082.java +++ /dev/null @@ -1,18 +0,0 @@ -/** - * 冒泡排序函数 - * 将数组a从小到大进行排序 - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - for (int i = 0; i < n; i++) { - for (int j = 0; j < n - i -1; j++) { - if(a[j] > a[j+1]){ - int temp = a[j]; - a[j] = a[j+1]; - a[j+1] = temp; - } - } - } -} - diff --git a/codes/blingpotato/15623762.java b/codes/blingpotato/15623762.java deleted file mode 100644 index 6bdd05fcc4de29678709e7f6b5e0ea65b586d80b..0000000000000000000000000000000000000000 --- a/codes/blingpotato/15623762.java +++ /dev/null @@ -1,18 +0,0 @@ -/** - * 冒泡排序函数 - * 通过相邻元素之间的比较和交换，将数组排序为升序 - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int[] a, int n) { - for (int i = 0; i < n - 1; i++) { // 外层循环控制排序的趟数 - for (int j = 0; j < n - 1 - i; j++) { // 内层循环控制每一趟排序多少次 - if (a[j] > a[j + 1]) { // 如果前一个元素比后一个元素大，则交换它们的位置 - // 交换 a[j] 和 a[j+1] - int temp = a[j]; - a[j] = a[j + 1]; - a[j + 1] = temp; - } - } - } -} // end diff --git a/codes/blockup/15585762.java b/codes/blockup/15585762.java deleted file mode 100644 index c2afaa2414da1853e4500b02c6de9068b64aeafe..0000000000000000000000000000000000000000 --- a/codes/blockup/15585762.java +++ /dev/null @@ -1,18 +0,0 @@ -/** - * 冒泡排序函数 - * aa bb cc - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - for(int i = 0; i < n-1 ; i++){ - for (int j = 0;j < n-1-i;j++){ - if(a[j] > a[j+1]){ - int temp = a[j]; - a[j] = a[j+1]; - a[j+1] = temp; - } - } - } - -} //end diff --git a/codes/bmyy111/15635777.java b/codes/bmyy111/15635777.java deleted file mode 100644 index 04625a494ce3da760397a3c3c648cdbe5d0bfa71..0000000000000000000000000000000000000000 --- a/codes/bmyy111/15635777.java +++ /dev/null @@ -1,19 +0,0 @@ -/** - * 冒泡排序函数 - * aa bb cc - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - // 你的代码，使无序数组 a 变得有序 - for(int i = 0; i < n-1 ; i++){ - for (int j = 0;j < n-1-i;j++){ - if(a[j] > a[j+1]){ - int temp = a[j]; - a[j] = a[j+1]; - a[j+1] = temp; - } - } - } -} //end - diff --git a/codes/book123/15699999.java b/codes/book123/15699999.java deleted file mode 100644 index 987377810b5beca8eb4bf5eafeee5db45e234a87..0000000000000000000000000000000000000000 --- a/codes/book123/15699999.java +++ /dev/null @@ -1,20 +0,0 @@ -/** - * 冒泡排序函数 - * aa bb cc - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - // 你的代码，使无序数组 a 变得有序 - for(int i = 0; i < n; i++) { - for(int liuy = 0; liuy < n - i - 1; liuy++) { - if(a[liuy] > a[liuy + 1]) { - int temp = a[liuy]; - a [liuy] = a[liuy + 1]; - a[liuy + 1] = temp; - } - } - } - - -} //end,liuy diff --git a/codes/bopiox/11219150.java b/codes/bopiox/11219150.java deleted file mode 100644 index cacd12f1e4e4360dd1ffa22f3741e376110bcde4..0000000000000000000000000000000000000000 --- a/codes/bopiox/11219150.java +++ /dev/null @@ -1,18 +0,0 @@ -/** - * 冒泡排序函数 - * aa bb cc - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - // 你的代码，使无序数组 a 变得有序 - for(int i=0;ia[j+1]){ - a[j] = a[j]+a[j+1]; - a[j+1] = a[j]-a[j+1]; - a[j] = a[j]-a[j+1]; - } - } - } -} //end \ No newline at end of file diff --git a/codes/bowen123456/.keep b/codes/bowen123456/.keep deleted file mode 100644 index e69de29bb2d1d6434b8b29ae775ad8c2e48c5391..0000000000000000000000000000000000000000 diff --git a/codes/bowen123456/15815214.java b/codes/bowen123456/15815214.java deleted file mode 100644 index 6e9861fa3ec6d5a2553cdccd1bb1e977430c671b..0000000000000000000000000000000000000000 --- a/codes/bowen123456/15815214.java +++ /dev/null @@ -1,19 +0,0 @@ -/** - * 冒泡排序函数 - * aa bb cc - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - // 你的代码，使无序数组 a 变得有序 - for (int i = 0; i < n - 1; i++) { - for (int j = 0; j < n - i - 1; j++) { - if (a[j] > a[j + 1]) { - - int temp = a[j]; - a[j] = a[j + 1]; - a[j + 1] = temp; - } - } - } -} //end \ No newline at end of file diff --git a/codes/buaa562/15843584.java b/codes/buaa562/15843584.java deleted file mode 100644 index 9b1c6dfe2319b086c48c584decd885754237e85c..0000000000000000000000000000000000000000 --- a/codes/buaa562/15843584.java +++ /dev/null @@ -1,19 +0,0 @@ -/** - * 冒泡排序函数 - * 通过重复地遍历待排序的数列，一次比较两个元素，如果他们的顺序错误就把他们交换过来。 - * 遍历数列的工作是重复地进行直到没有再需要交换，也就是说该数列已经排序完成。 - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - for (int i = 0; i < n - 1; i++) { - for (int j = 0; j < n - i - 1; j++) { - if (a[j] > a[j + 1]) { - // 如果前一个元素大于后一个元素，则交换它们的位置 - int temp = a[j]; - a[j] = a[j + 1]; - a[j + 1] = temp; - } - } - } -} //end diff --git a/codes/budasan/11121691.java b/codes/budasan/11121691.java deleted file mode 100644 index 24b49b4b1fd01d1f21be8b362a582158452e41d3..0000000000000000000000000000000000000000 --- a/codes/budasan/11121691.java +++ /dev/null @@ -1,19 +0,0 @@ -/** - * 冒泡排序函数 - * aa bb cc - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - // 你的代码，使无序数组 a 变得有序 - for(int i = 0 ; i < n - 1 ; i++){ - for(int j = 0 ; j < n - 1 - i ; j++){ - if(a[j] > a[j + 1]){ - int tmp = a[j]; - a[j] = a[j + 1]; - a[j + 1] = tmp; - } - } - } - -} //end \ No newline at end of file diff --git a/codes/buffoZipper/.keep b/codes/buffoZipper/.keep deleted file mode 100644 index e69de29bb2d1d6434b8b29ae775ad8c2e48c5391..0000000000000000000000000000000000000000 diff --git a/codes/buffoZipper/15842330.java b/codes/buffoZipper/15842330.java deleted file mode 100644 index 6e9861fa3ec6d5a2553cdccd1bb1e977430c671b..0000000000000000000000000000000000000000 --- a/codes/buffoZipper/15842330.java +++ /dev/null @@ -1,19 +0,0 @@ -/** - * 冒泡排序函数 - * aa bb cc - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - // 你的代码，使无序数组 a 变得有序 - for (int i = 0; i < n - 1; i++) { - for (int j = 0; j < n - i - 1; j++) { - if (a[j] > a[j + 1]) { - - int temp = a[j]; - a[j] = a[j + 1]; - a[j + 1] = temp; - } - } - } -} //end \ No newline at end of file diff --git a/codes/buhuiruner/.keep b/codes/buhuiruner/.keep deleted file mode 100644 index e69de29bb2d1d6434b8b29ae775ad8c2e48c5391..0000000000000000000000000000000000000000 diff --git a/codes/buhuiruner/15842260.java b/codes/buhuiruner/15842260.java deleted file mode 100644 index 6e9861fa3ec6d5a2553cdccd1bb1e977430c671b..0000000000000000000000000000000000000000 --- a/codes/buhuiruner/15842260.java +++ /dev/null @@ -1,19 +0,0 @@ -/** - * 冒泡排序函数 - * aa bb cc - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - // 你的代码，使无序数组 a 变得有序 - for (int i = 0; i < n - 1; i++) { - for (int j = 0; j < n - i - 1; j++) { - if (a[j] > a[j + 1]) { - - int temp = a[j]; - a[j] = a[j + 1]; - a[j + 1] = temp; - } - } - } -} //end \ No newline at end of file diff --git a/codes/buhuizhiyuqianduan/11245496.java b/codes/buhuizhiyuqianduan/11245496.java deleted file mode 100644 index 6da7a74fe64b09a004a6d641ea191a7fc64f6140..0000000000000000000000000000000000000000 --- a/codes/buhuizhiyuqianduan/11245496.java +++ /dev/null @@ -1,18 +0,0 @@ -/** - * 冒泡排序函数 - * aa bb cc - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] arr, int n){ - // 你的代码，使无序数组 a 变得有序 - for (int i = 0; i < n - 1; i++) { - for (int j = 0; j < n - 1 - i; j++) { - if (arr[j] > arr[j + 1]) { - int temp = arr[j]; - arr[j] = arr[j+1]; - arr[j+1] = temp; - } - } - } -} //end diff --git a/codes/bujin521/11301842.java b/codes/bujin521/11301842.java deleted file mode 100644 index 24b49b4b1fd01d1f21be8b362a582158452e41d3..0000000000000000000000000000000000000000 --- a/codes/bujin521/11301842.java +++ /dev/null @@ -1,19 +0,0 @@ -/** - * 冒泡排序函数 - * aa bb cc - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - // 你的代码，使无序数组 a 变得有序 - for(int i = 0 ; i < n - 1 ; i++){ - for(int j = 0 ; j < n - 1 - i ; j++){ - if(a[j] > a[j + 1]){ - int tmp = a[j]; - a[j] = a[j + 1]; - a[j + 1] = tmp; - } - } - } - -} //end \ No newline at end of file diff --git a/codes/bundle/11196164.java b/codes/bundle/11196164.java deleted file mode 100644 index 661499fc3a69b869708e75b839ddbc12a2776d9b..0000000000000000000000000000000000000000 --- a/codes/bundle/11196164.java +++ /dev/null @@ -1,17 +0,0 @@ -/** - * 冒泡排序函数 - * aa bb cc - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a,int n){ - for(int i = 0; i < n-1 ; i++){ - for (int j = 0;j < n-1-i;j++){ - if(a[j] > a[j+1]){ - int temp = a[j]; - a[j] = a[j+1]; - a[j+1] = temp; - } - } - } -} diff --git a/codes/bupiovm0101/11122657.java b/codes/bupiovm0101/11122657.java deleted file mode 100644 index 4d7083fe05ce3e6d3fadd59d6d55e2cbc50d546d..0000000000000000000000000000000000000000 --- a/codes/bupiovm0101/11122657.java +++ /dev/null @@ -1,22 +0,0 @@ -/** - * 冒泡排序函数 - * aa bb cc - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - // 你的代码，使无序数组 a 变得有序 - int i, j; - - for(i=0; ia[j]){ - int temp; - temp = a[j-1]; - a[j-1] = a[j]; - a[j] = temp; - } - } - } - -} //end \ No newline at end of file diff --git a/codes/bushioo/11276443.java b/codes/bushioo/11276443.java deleted file mode 100644 index 4d7083fe05ce3e6d3fadd59d6d55e2cbc50d546d..0000000000000000000000000000000000000000 --- a/codes/bushioo/11276443.java +++ /dev/null @@ -1,22 +0,0 @@ -/** - * 冒泡排序函数 - * aa bb cc - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - // 你的代码，使无序数组 a 变得有序 - int i, j; - - for(i=0; ia[j]){ - int temp; - temp = a[j-1]; - a[j-1] = a[j]; - a[j] = temp; - } - } - } - -} //end \ No newline at end of file diff --git a/codes/buzhidao/11118686.java b/codes/buzhidao/11118686.java deleted file mode 100644 index 8d589d7edfe50246fe5deff283186d81a64dc137..0000000000000000000000000000000000000000 --- a/codes/buzhidao/11118686.java +++ /dev/null @@ -1,21 +0,0 @@ -/** - * 冒泡排序函数 - * aa bb cc - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a,int n){ - int temp =0; - for(int i = 0;ia[j+1]){ - temp = a[j]; - a[j] = a[j+1]; - a[j+1] = temp; - } - } - } - - - -} \ No newline at end of file diff --git a/codes/bzy-080408/18668050.java b/codes/bzy-080408/18668050.java deleted file mode 100644 index ca63d27dc7622459ebb0d2c42fb010dda396047f..0000000000000000000000000000000000000000 --- a/codes/bzy-080408/18668050.java +++ /dev/null @@ -1,19 +0,0 @@ -/** - * 冒泡排序函数 - * aa bb cc - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ - public static void bubbleSort(int [] a, int n) { - for (int i = 0; i < n; i++) { - for (int j = 0; j < n - i - 1; j++) { - if (a[j] > a[j + 1]) { - int temp = a[j]; - a[j] = a[j + 1]; - a[j + 1] = temp; - } - - } //end - } - } - diff --git a/codes/c1444444444/15811953.java b/codes/c1444444444/15811953.java deleted file mode 100644 index 166dea5db31166b381f11f50cf27b5f36311847d..0000000000000000000000000000000000000000 --- a/codes/c1444444444/15811953.java +++ /dev/null @@ -1,19 +0,0 @@ -/** - * 冒泡排序函数 - * 该函数通过冒泡排序算法对数组进行排序 - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int[] a, int n) { - for (int i = 0; i < n - 1; i++) { // 外层循环控制比较轮数 - for (int j = 0; j < n - 1 - i; j++) { // 内层循环控制每轮的比较次数 - // 如果前一个元素大于后一个元素，则交换它们的位置 - if (a[j] > a[j + 1]) { - // 交换元素 - int temp = a[j]; - a[j] = a[j + 1]; - a[j + 1] = temp; - } - } - } -} //end diff --git a/codes/c1484941716/15859323.java b/codes/c1484941716/15859323.java deleted file mode 100644 index 271d2f1dfec9c226694fa24afe300e49f150ca51..0000000000000000000000000000000000000000 --- a/codes/c1484941716/15859323.java +++ /dev/null @@ -1,18 +0,0 @@ -/** - * 冒泡排序函数 - * 将数组a按照从小到大的顺序排序 - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int[] a, int n) { - for (int i = 0; i < n - 1; i++) { // 外层循环，决定冒泡的趟数 - for (int j = 0; j < n - 1 - i; j++) { // 内层循环，决定每趟比较的次数 - if (a[j] > a[j + 1]) { // 如果当前元素大于下一个元素，则交换它们的位置 - // 交换a[j]和a[j + 1] - int temp = a[j]; - a[j] = a[j + 1]; - a[j + 1] = temp; - } - } - } -} // end diff --git a/codes/ca3130049622/15790269.java b/codes/ca3130049622/15790269.java deleted file mode 100644 index 74623af6ae8334a2df47d3a33a37b1e829854307..0000000000000000000000000000000000000000 --- a/codes/ca3130049622/15790269.java +++ /dev/null @@ -1,17 +0,0 @@ -/** - * 冒泡排序函数 - * 通过比较相邻的元素，如果顺序错误则交换它们的位置，遍历数组的工作是重复地进行直到没有再需要交换，也就是说该数组已经排序完成。 - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - for (int i = 0; i < n - 1; i++) { // 外层循环，控制比较次数 - for (int j = 0; j < n - i - 1; j++) { // 内层循环，实际比较和交换 - if (a[j] > a[j + 1]) { // 如果前一个元素大于后一个元素，则交换它们的位置 - int temp = a[j]; - a[j] = a[j + 1]; - a[j + 1] = temp; - } - } - } -} //end diff --git a/codes/cai0002/15520914.java b/codes/cai0002/15520914.java deleted file mode 100644 index 808f5412e2ca2e79231eeedaa55d778acfeb1bee..0000000000000000000000000000000000000000 --- a/codes/cai0002/15520914.java +++ /dev/null @@ -1,18 +0,0 @@ -/** - * 冒泡排序函数 - * 遍历数组，比较相邻元素，将较大的元素交换到数组的末尾，重复直到整个数组有序 - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - for (int i = 0; i < n - 1; i++) { - for (int j = 0; j < n - i - 1; j++) { - // 如果前一个元素大于后一个元素，则交换它们的位置 - if (a[j] > a[j + 1]) { - int temp = a[j]; - a[j] = a[j + 1]; - a[j + 1] = temp; - } - } - } -} diff --git a/codes/cai001/15520883.java b/codes/cai001/15520883.java deleted file mode 100644 index 808f5412e2ca2e79231eeedaa55d778acfeb1bee..0000000000000000000000000000000000000000 --- a/codes/cai001/15520883.java +++ /dev/null @@ -1,18 +0,0 @@ -/** - * 冒泡排序函数 - * 遍历数组，比较相邻元素，将较大的元素交换到数组的末尾，重复直到整个数组有序 - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - for (int i = 0; i < n - 1; i++) { - for (int j = 0; j < n - i - 1; j++) { - // 如果前一个元素大于后一个元素，则交换它们的位置 - if (a[j] > a[j + 1]) { - int temp = a[j]; - a[j] = a[j + 1]; - a[j + 1] = temp; - } - } - } -} diff --git a/codes/caishen/.keep b/codes/caishen/.keep deleted file mode 100644 index e69de29bb2d1d6434b8b29ae775ad8c2e48c5391..0000000000000000000000000000000000000000 diff --git a/codes/caishen/15856729.java b/codes/caishen/15856729.java deleted file mode 100644 index 6426772fb479b07ed3be21ef1867921d1dbb194c..0000000000000000000000000000000000000000 --- a/codes/caishen/15856729.java +++ /dev/null @@ -1,20 +0,0 @@ -/** - * 冒泡排序函数 - * aa bb cc - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - // 你的代码，使无序数组 a 变得有序 - for(int i = 0; i < n; i++) { - for(int j = 0; j < n - i - 1; j++) { - if(a[j] > a[j + 1]) { - int temp = a[j]; - a [j] = a[j + 1]; - a[j + 1] = temp; - } - } - } - - -} //end \ No newline at end of file diff --git a/codes/caiyanghong/15835895.java b/codes/caiyanghong/15835895.java deleted file mode 100644 index ae82e695cbfd360050241c3f1f592658c8c1d4e7..0000000000000000000000000000000000000000 --- a/codes/caiyanghong/15835895.java +++ /dev/null @@ -1,35 +0,0 @@ -/** - - * 冒泡排序函数 - - * aa bb cc - - * @param a 待排序的数组 - - * @param n 待排序的数组长度 - - */ - -public static void bubbleSort(int [] a, int n){ - - for(int i = 0; i < n-1 ; i++){ - - for (int j = 0;j < n-1-i;j++){ - - if(a[j] > a[j+1]){ - - int temp = a[j]; - - a[j] = a[j+1]; - - a[j+1] = temp; - - } - - } - - } - - - -} //end diff --git a/codes/caizengming/15396209.java b/codes/caizengming/15396209.java deleted file mode 100644 index c583260da5e1b739d67776354cb6933af3646be8..0000000000000000000000000000000000000000 --- a/codes/caizengming/15396209.java +++ /dev/null @@ -1,21 +0,0 @@ -/** - * 冒泡排序函数 - * aa bb cc - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - // 你的代码，使无序数组 a 变得有序 - - for(int i = 0 ; i < n; i ++) { - for (int j = 0 ; j < n - i -1 ; j ++ ){ - - if(a[j] > a[j +1]){ - int temp = a[j]; - a[j] = a[j +1]; - a[j + 1] = temp; - } - } - } - -} //end diff --git a/codes/caozhou/10869186.java b/codes/caozhou/10869186.java deleted file mode 100644 index 0551a31e6517d6c16922f38f1aa2b9b65d7b0f03..0000000000000000000000000000000000000000 --- a/codes/caozhou/10869186.java +++ /dev/null @@ -1,11 +0,0 @@ -public static void bubbleSort(int [] a, int n){ - for(int i = 0 ; i < n - 1 ; i++){ - for(int j = 0 ; j < n - 1 - i ; j++){ - if(a[j] > a[j + 1]){ - int tmp = a[j]; - a[j] = a[j + 1]; - a[j + 1] = tmp; - } - } - } -} diff --git a/codes/captaining/15614511.java b/codes/captaining/15614511.java deleted file mode 100644 index 86d776a408de93103a7142ef74ccc031789b506d..0000000000000000000000000000000000000000 --- a/codes/captaining/15614511.java +++ /dev/null @@ -1,18 +0,0 @@ -/** - * 冒泡排序函数 - * 通过相邻元素两两比较并交换，使得每一轮循环后最大（或最小）的元素“冒泡”到数组的末尾 - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int[] a, int n) { - for (int i = 0; i < n - 1; i++) { // 外层循环控制排序的轮数 - for (int j = 0; j < n - 1 - i; j++) { // 内层循环控制每轮需要比较的次数 - if (a[j] > a[j + 1]) { // 如果当前元素大于下一个元素，则交换它们的位置 - // 交换 a[j] 和 a[j+1] - int temp = a[j]; - a[j] = a[j + 1]; - a[j + 1] = temp; - } - } - } -} //end diff --git a/codes/carino5555/15527193.java b/codes/carino5555/15527193.java deleted file mode 100644 index fe1a0c288940fc02b0983c37f7a4da8058bf89e0..0000000000000000000000000000000000000000 --- a/codes/carino5555/15527193.java +++ /dev/null @@ -1,18 +0,0 @@ -/** - * 冒泡排序函数 - * 对数组a进行冒泡排序，使其变为有序数组 - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int[] a, int n) { - for (int i = 0; i < n - 1; i++) { - for (int j = 0; j < n - i - 1; j++) { - if (a[j] > a[j + 1]) { - // 交换 a[j] 和 a[j+1] - int temp = a[j]; - a[j] = a[j + 1]; - a[j + 1] = temp; - } - } - } -} //end diff --git a/codes/caroline/15374117.java b/codes/caroline/15374117.java deleted file mode 100644 index 9c77b43d4a0b0734e87d3b4c380ad82c495693b9..0000000000000000000000000000000000000000 --- a/codes/caroline/15374117.java +++ /dev/null @@ -1,20 +0,0 @@ -/** - * 冒泡排序函数 - * aa bb cc - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - for(int i=0;ia[j+1]) - { - int temp=a[j]; - a[j]=a[j+1]; - a[j+1]=temp; - } - } - } -} diff --git a/codes/cccqqq/.keep b/codes/cccqqq/.keep deleted file mode 100644 index e69de29bb2d1d6434b8b29ae775ad8c2e48c5391..0000000000000000000000000000000000000000 diff --git a/codes/cccqqq/10039861.java b/codes/cccqqq/10039861.java deleted file mode 100644 index b18037655daf75c51c9d669c057d9a658261d6ec..0000000000000000000000000000000000000000 --- a/codes/cccqqq/10039861.java +++ /dev/null @@ -1,17 +0,0 @@ -/* 冒泡排序函数 - * aa bb cc - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - // 你的代码，使无序数组 a 变得有序 - for (int i = 0; i < n; i++) { - for (int j = 0; j < i; j++) { - if (a[i] < a[j]) { - int t = a[i]; - a[i] = a[j]; - a[j] = t; - } - } - } -} //end \ No newline at end of file diff --git a/codes/ccone123/15713748.java b/codes/ccone123/15713748.java deleted file mode 100644 index 854beb62bfcf4ead3549d682ffca7f1b9f32d947..0000000000000000000000000000000000000000 --- a/codes/ccone123/15713748.java +++ /dev/null @@ -1,19 +0,0 @@ -/** - * 冒泡排序函数 - * aa bb cc - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - for(int i = 0; i < n-1 ; i++){ - for (int j = 0;j < n-1-i;j++){ - if(a[j] > a[j+1]){ - int temp = a[j]; - a[j] = a[j+1]; - a[j+1] = temp; - } - } - } - -} //end - diff --git a/codes/ccout0/12264632.java b/codes/ccout0/12264632.java deleted file mode 100644 index 998bc63ed0ce64bdb06f97b596bde3ba47da68d9..0000000000000000000000000000000000000000 --- a/codes/ccout0/12264632.java +++ /dev/null @@ -1,22 +0,0 @@ -/** - * 冒泡排序函数 - * aa bb cc - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - for (int i = n; i > 0; i--) { - boolean isOrderly = true; - for (int j = 0; j < i - 1; j++) { - if (a[j] > a[j + 1]) { - int t = a[j]; - a[j] = a[j + 1]; - a[j + 1] = t; - isOrderly = false; - } - } - if (isOrderly) { - break; - } - } -} diff --git a/codes/cenm00/15829376.java b/codes/cenm00/15829376.java deleted file mode 100644 index b962b73e2912b8ccb6f81b6e80aaea890a1426ee..0000000000000000000000000000000000000000 --- a/codes/cenm00/15829376.java +++ /dev/null @@ -1,17 +0,0 @@ -/** - * 冒泡排序函数 - * 对数组a进行冒泡排序，将其变为有序数组 - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int[] a, int n) { - for (int i = 0; i < n - 1; i++) { // 外层循环，控制比较的轮数 - for (int j = 0; j < n - 1 - i; j++) { // 内层循环，控制每轮比较的次数 - if (a[j] > a[j + 1]) { // 如果前一个元素大于后一个元素，则交换它们的位置 - int temp = a[j]; - a[j] = a[j + 1]; - a[j + 1] = temp; - } - } - } -} // end diff --git a/codes/ceshi001/.keep b/codes/ceshi001/.keep deleted file mode 100644 index e69de29bb2d1d6434b8b29ae775ad8c2e48c5391..0000000000000000000000000000000000000000 diff --git a/codes/ceshi001/9637800.java b/codes/ceshi001/9637800.java deleted file mode 100644 index 4dbc26599d1e20a8b21ed0d6059220f57eae9762..0000000000000000000000000000000000000000 --- a/codes/ceshi001/9637800.java +++ /dev/null @@ -1,22 +0,0 @@ -/** - * 冒泡排序函数 - * 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 diff --git a/codes/cghg547546/.keep b/codes/cghg547546/.keep deleted file mode 100644 index e69de29bb2d1d6434b8b29ae775ad8c2e48c5391..0000000000000000000000000000000000000000 diff --git a/codes/cghg547546/15743428.java b/codes/cghg547546/15743428.java deleted file mode 100644 index 6e9861fa3ec6d5a2553cdccd1bb1e977430c671b..0000000000000000000000000000000000000000 --- a/codes/cghg547546/15743428.java +++ /dev/null @@ -1,19 +0,0 @@ -/** - * 冒泡排序函数 - * aa bb cc - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - // 你的代码，使无序数组 a 变得有序 - for (int i = 0; i < n - 1; i++) { - for (int j = 0; j < n - i - 1; j++) { - if (a[j] > a[j + 1]) { - - int temp = a[j]; - a[j] = a[j + 1]; - a[j + 1] = temp; - } - } - } -} //end \ No newline at end of file diff --git a/codes/changgeng/16563760.java b/codes/changgeng/16563760.java deleted file mode 100644 index 8527e1c6e49720f73cb92fa5ed1ee9ee1a2c56e1..0000000000000000000000000000000000000000 --- a/codes/changgeng/16563760.java +++ /dev/null @@ -1,18 +0,0 @@ -/** - * 冒泡排序函数 - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n) { - for (int i = 0; i < n - 1; i++) { - for (int j = 0; j < n - 1 - i; j++) { - if (a[j] > a[j + 1]) { - // 交换 a[j] 和 a[j + 1] - int temp = a[j]; - a[j] = a[j + 1]; - a[j + 1] = temp; - } - } - } -} - diff --git a/codes/chanziruu/.keep b/codes/chanziruu/.keep deleted file mode 100644 index e69de29bb2d1d6434b8b29ae775ad8c2e48c5391..0000000000000000000000000000000000000000 diff --git a/codes/chanziruu/10042211.java b/codes/chanziruu/10042211.java deleted file mode 100644 index 667eee0f585ec38ce639cb36d80df080e935946d..0000000000000000000000000000000000000000 --- a/codes/chanziruu/10042211.java +++ /dev/null @@ -1,11 +0,0 @@ -public static void bubbleSort(int [] a,int n){ - for(int i = 0; i < n-1 ; i++){ - for (int j = 0;j < n-1-i;j++){ - if(a[j] > a[j+1]){ - int temp = a[j]; - a[j] = a[j+1]; - a[j+1] = temp; - } - } - } -} \ No newline at end of file diff --git a/codes/chase11/15577508.java b/codes/chase11/15577508.java deleted file mode 100644 index c2afaa2414da1853e4500b02c6de9068b64aeafe..0000000000000000000000000000000000000000 --- a/codes/chase11/15577508.java +++ /dev/null @@ -1,18 +0,0 @@ -/** - * 冒泡排序函数 - * aa bb cc - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - for(int i = 0; i < n-1 ; i++){ - for (int j = 0;j < n-1-i;j++){ - if(a[j] > a[j+1]){ - int temp = a[j]; - a[j] = a[j+1]; - a[j+1] = temp; - } - } - } - -} //end diff --git a/codes/chenabing/15724269.java b/codes/chenabing/15724269.java deleted file mode 100644 index c8f31c95cb81565ebe135b7a324269913ba36b96..0000000000000000000000000000000000000000 --- a/codes/chenabing/15724269.java +++ /dev/null @@ -1,13 +0,0 @@ -public static void bubbleSort(int []a,int n){ - int length = n; - for(int i=0;ia[j+1]){ - int temp = a[j]; - a[j]=a[j+1]; - a[j+1]=temp; - } - - } - } -} diff --git a/codes/chenchen1234/15630722.java b/codes/chenchen1234/15630722.java deleted file mode 100644 index 0028b5a068597ec8aa7515518676f257fa6b2e0c..0000000000000000000000000000000000000000 --- a/codes/chenchen1234/15630722.java +++ /dev/null @@ -1,20 +0,0 @@ -/** - * 冒泡排序函数 - * 冒泡排序是一种简单的排序算法，它重复地遍历要排序的数列，一次比较两个元素，如果他们的顺序错误就把他们交换过来。 - * 遍历数列的工作是重复地进行直到没有再需要交换，也就是说该数列已经排序完成。 - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - for (int i = 0; i < n - 1; i++) { - for (int j = 0; j < n - i - 1; j++) { - // 如果前一个元素大于后一个元素，则交换他们的位置 - if (a[j] > a[j + 1]) { - // 交换 a[j] 和 a[j+1] - int temp = a[j]; - a[j] = a[j + 1]; - a[j + 1] = temp; - } - } - } -} //end diff --git a/codes/chency/15542287.java b/codes/chency/15542287.java deleted file mode 100644 index f186571675d133f859fc07d24a4a78ee9282ecec..0000000000000000000000000000000000000000 --- a/codes/chency/15542287.java +++ /dev/null @@ -1,17 +0,0 @@ -/** - * 冒泡排序函数 - * 通过相邻元素之间的比较和交换，使得每一轮比较后最大（或最小）的元素能够“冒泡”到数组的末尾。 - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int[] a, int n) { - for (int i = 0; i < n - 1; i++) { // 外层循环控制需要比较的次数 - for (int j = 0; j < n - 1 - i; j++) { // 内层循环控制每轮比较的次数 - if (a[j] > a[j + 1]) { // 如果前一个元素大于后一个元素，则交换它们 - int temp = a[j]; - a[j] = a[j + 1]; - a[j + 1] = temp; - } - } - } -} // end diff --git a/codes/chengchen/10039151.java b/codes/chengchen/10039151.java deleted file mode 100644 index fce1e8fc1bc51f5996c9c8695961eb465fa5ff67..0000000000000000000000000000000000000000 --- a/codes/chengchen/10039151.java +++ /dev/null @@ -1,18 +0,0 @@ -/** - * 冒泡排序函数 - * aa bb cc - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - // 你的代码，使无序数组 a 变得有序 - for (int i = 0; i < n; i++) { - for (int j = 0; j < i; j++) { - if (a[i] < a[j]) { - int t = a[i]; - a[i] = a[j]; - a[j] = t; - } - } - } -} //end diff --git a/codes/chengqi/.keep b/codes/chengqi/.keep deleted file mode 100644 index e69de29bb2d1d6434b8b29ae775ad8c2e48c5391..0000000000000000000000000000000000000000 diff --git a/codes/chengqi/15845978.java b/codes/chengqi/15845978.java deleted file mode 100644 index 6426772fb479b07ed3be21ef1867921d1dbb194c..0000000000000000000000000000000000000000 --- a/codes/chengqi/15845978.java +++ /dev/null @@ -1,20 +0,0 @@ -/** - * 冒泡排序函数 - * aa bb cc - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - // 你的代码，使无序数组 a 变得有序 - for(int i = 0; i < n; i++) { - for(int j = 0; j < n - i - 1; j++) { - if(a[j] > a[j + 1]) { - int temp = a[j]; - a [j] = a[j + 1]; - a[j + 1] = temp; - } - } - } - - -} //end \ No newline at end of file diff --git a/codes/chengzhi/11005917.java b/codes/chengzhi/11005917.java deleted file mode 100644 index 661499fc3a69b869708e75b839ddbc12a2776d9b..0000000000000000000000000000000000000000 --- a/codes/chengzhi/11005917.java +++ /dev/null @@ -1,17 +0,0 @@ -/** - * 冒泡排序函数 - * aa bb cc - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a,int n){ - for(int i = 0; i < n-1 ; i++){ - for (int j = 0;j < n-1-i;j++){ - if(a[j] > a[j+1]){ - int temp = a[j]; - a[j] = a[j+1]; - a[j+1] = temp; - } - } - } -} diff --git a/codes/chenhan1129/15542140.java b/codes/chenhan1129/15542140.java deleted file mode 100644 index 2c70a5f0a8a7f03f7f386683b93f02bf6ebec03e..0000000000000000000000000000000000000000 --- a/codes/chenhan1129/15542140.java +++ /dev/null @@ -1,21 +0,0 @@ -/** - * 冒泡排序函数 - * 该函数使用冒泡排序算法对数组进行升序排序 - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int[] a, int n) { - // 外层循环，控制排序趟数 - for (int i = 0; i < n - 1; i++) { - // 内层循环，控制每趟排序多少次 - for (int j = 0; j < n - 1 - i; j++) { - // 如果当前元素大于下一个元素，则交换它们的位置 - if (a[j] > a[j + 1]) { - // 交换 a[j] 和 a[j+1] - int temp = a[j]; - a[j] = a[j + 1]; - a[j + 1] = temp; - } - } - } -} //end diff --git a/codes/chenqiuyun/15860178.java b/codes/chenqiuyun/15860178.java deleted file mode 100644 index ae82e695cbfd360050241c3f1f592658c8c1d4e7..0000000000000000000000000000000000000000 --- a/codes/chenqiuyun/15860178.java +++ /dev/null @@ -1,35 +0,0 @@ -/** - - * 冒泡排序函数 - - * aa bb cc - - * @param a 待排序的数组 - - * @param n 待排序的数组长度 - - */ - -public static void bubbleSort(int [] a, int n){ - - for(int i = 0; i < n-1 ; i++){ - - for (int j = 0;j < n-1-i;j++){ - - if(a[j] > a[j+1]){ - - int temp = a[j]; - - a[j] = a[j+1]; - - a[j+1] = temp; - - } - - } - - } - - - -} //end diff --git a/codes/chenwy/15816299.java b/codes/chenwy/15816299.java deleted file mode 100644 index 0f8ae249c1ac8dd89aa19dce85920d36b222fe57..0000000000000000000000000000000000000000 --- a/codes/chenwy/15816299.java +++ /dev/null @@ -1,19 +0,0 @@ - -/** - * 冒泡排序函数 - * 使用冒泡排序算法对数组进行升序排序 - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - for (int i = 0; i < n - 1; i++) { - for (int j = 0; j < n - i - 1; j++) { - // 如果前一个元素大于后一个元素，则交换它们的位置 - if (a[j] > a[j + 1]) { - int temp = a[j]; - a[j] = a[j + 1]; - a[j + 1] = temp; - } - } - } -} //end diff --git a/codes/chenyongru/.keep b/codes/chenyongru/.keep deleted file mode 100644 index e69de29bb2d1d6434b8b29ae775ad8c2e48c5391..0000000000000000000000000000000000000000 diff --git a/codes/chenyongru/15764377.java b/codes/chenyongru/15764377.java deleted file mode 100644 index d40803fb8fd6db6216a346341ff5180f0b773922..0000000000000000000000000000000000000000 --- a/codes/chenyongru/15764377.java +++ /dev/null @@ -1,20 +0,0 @@ -/** - * 冒泡排序函数 - * aa bb cc - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - // 你的代码，使无序数组 a 变得有序 - for(int i = 0; i < n; i++) { - for(int j = 0; j < n - i - 1; j++) { - if(a[j] > a[j + 1]) { - int temp = a[j]; - a [j] = a[j + 1]; - a[j + 1] = temp; - } - } - } - - -} //end \ No newline at end of file diff --git a/codes/chenyunhao/15874841.java b/codes/chenyunhao/15874841.java deleted file mode 100644 index ae82e695cbfd360050241c3f1f592658c8c1d4e7..0000000000000000000000000000000000000000 --- a/codes/chenyunhao/15874841.java +++ /dev/null @@ -1,35 +0,0 @@ -/** - - * 冒泡排序函数 - - * aa bb cc - - * @param a 待排序的数组 - - * @param n 待排序的数组长度 - - */ - -public static void bubbleSort(int [] a, int n){ - - for(int i = 0; i < n-1 ; i++){ - - for (int j = 0;j < n-1-i;j++){ - - if(a[j] > a[j+1]){ - - int temp = a[j]; - - a[j] = a[j+1]; - - a[j+1] = temp; - - } - - } - - } - - - -} //end diff --git a/codes/chenzhongyao/15851007.java b/codes/chenzhongyao/15851007.java deleted file mode 100644 index ae82e695cbfd360050241c3f1f592658c8c1d4e7..0000000000000000000000000000000000000000 --- a/codes/chenzhongyao/15851007.java +++ /dev/null @@ -1,35 +0,0 @@ -/** - - * 冒泡排序函数 - - * aa bb cc - - * @param a 待排序的数组 - - * @param n 待排序的数组长度 - - */ - -public static void bubbleSort(int [] a, int n){ - - for(int i = 0; i < n-1 ; i++){ - - for (int j = 0;j < n-1-i;j++){ - - if(a[j] > a[j+1]){ - - int temp = a[j]; - - a[j] = a[j+1]; - - a[j+1] = temp; - - } - - } - - } - - - -} //end diff --git a/codes/cherryaini/.keep b/codes/cherryaini/.keep deleted file mode 100644 index e69de29bb2d1d6434b8b29ae775ad8c2e48c5391..0000000000000000000000000000000000000000 diff --git a/codes/cherryaini/15838357.java b/codes/cherryaini/15838357.java deleted file mode 100644 index 6e9861fa3ec6d5a2553cdccd1bb1e977430c671b..0000000000000000000000000000000000000000 --- a/codes/cherryaini/15838357.java +++ /dev/null @@ -1,19 +0,0 @@ -/** - * 冒泡排序函数 - * aa bb cc - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - // 你的代码，使无序数组 a 变得有序 - for (int i = 0; i < n - 1; i++) { - for (int j = 0; j < n - i - 1; j++) { - if (a[j] > a[j + 1]) { - - int temp = a[j]; - a[j] = a[j + 1]; - a[j + 1] = temp; - } - } - } -} //end \ No newline at end of file diff --git a/codes/cherrypocky/15837631.java b/codes/cherrypocky/15837631.java deleted file mode 100644 index 24f513b3219ac31ac3dcffe774647aa7bfdac254..0000000000000000000000000000000000000000 --- a/codes/cherrypocky/15837631.java +++ /dev/null @@ -1,11 +0,0 @@ -public static void bubbleSort(int [] a, int n){ - for (int i = 0; i < n - 1; i++) { - for (int j = 0; j < n - 1 - i; j++) { - if (a[j] > a[j + 1]) { - int temp = a[j]; - a[j] = a[j + 1]; - a[j + 1] = temp; - } - } - } -} diff --git a/codes/chnechenya/15815769.java b/codes/chnechenya/15815769.java deleted file mode 100644 index 54c5f3869cd16ee9e7c2b77895a39fae63f05dbc..0000000000000000000000000000000000000000 --- a/codes/chnechenya/15815769.java +++ /dev/null @@ -1,20 +0,0 @@ -/** - * 冒泡排序函数 - * aa bb cc - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - // 你的代码，使无序数组 a 变得有序 - for(int i = 0; i < n; i++) { - for(int liuy = 0; liuy < n - i - 1; liuy++) { - if(a[liuy] > a[liuy + 1]) { - int temp = a[liuy]; - a [liuy] = a[liuy + 1]; - a[liuy + 1] = temp; - } - } - } - - -} //end,liuy \ No newline at end of file diff --git a/codes/chris2024/15600397.java b/codes/chris2024/15600397.java deleted file mode 100644 index 2252b818e6125ed4f8bbd23eca03c12c15ca1757..0000000000000000000000000000000000000000 --- a/codes/chris2024/15600397.java +++ /dev/null @@ -1,19 +0,0 @@ -/** - * 冒泡排序函数 - * aa bb cc - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - // 你的代码，使无序数组 a 变得有序 - for (int i = 0; i < n - 1; i++) { - for (int j = 0; j < n - i - 1; j++) { - if (a[j] > a[j + 1]) { - // 交换元素 - int temp = a[j]; - a[j] = a[j + 1]; - a[j + 1] = temp; - } - } - } -} //end \ No newline at end of file diff --git a/codes/chuyuxuan/15685256.java b/codes/chuyuxuan/15685256.java deleted file mode 100644 index 137560e5ef1657b2bb8a51599b746d7b9dd29d14..0000000000000000000000000000000000000000 --- a/codes/chuyuxuan/15685256.java +++ /dev/null @@ -1,19 +0,0 @@ -/** - * 冒泡排序函数 - * 通过多次遍历数组，比较相邻元素的大小，并交换它们的位置， - * 直到没有需要交换的元素为止，从而使得数组有序。 - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - for (int i = 0; i < n - 1; i++) { // 外层循环控制遍历次数 - for (int j = 0; j < n - 1 - i; j++) { // 内层循环控制每次遍历比较的次数 - // 如果前一个元素大于后一个元素，则交换它们的位置 - if (a[j] > a[j + 1]) { - int temp = a[j]; - a[j] = a[j + 1]; - a[j + 1] = temp; - } - } - } -} //end diff --git a/codes/cieasefires/.keep b/codes/cieasefires/.keep deleted file mode 100644 index e69de29bb2d1d6434b8b29ae775ad8c2e48c5391..0000000000000000000000000000000000000000 diff --git a/codes/cieasefires/15844532.java b/codes/cieasefires/15844532.java deleted file mode 100644 index 6e9861fa3ec6d5a2553cdccd1bb1e977430c671b..0000000000000000000000000000000000000000 --- a/codes/cieasefires/15844532.java +++ /dev/null @@ -1,19 +0,0 @@ -/** - * 冒泡排序函数 - * aa bb cc - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - // 你的代码，使无序数组 a 变得有序 - for (int i = 0; i < n - 1; i++) { - for (int j = 0; j < n - i - 1; j++) { - if (a[j] > a[j + 1]) { - - int temp = a[j]; - a[j] = a[j + 1]; - a[j + 1] = temp; - } - } - } -} //end \ No newline at end of file diff --git a/codes/ckx1234/15830693.java b/codes/ckx1234/15830693.java deleted file mode 100644 index c2afaa2414da1853e4500b02c6de9068b64aeafe..0000000000000000000000000000000000000000 --- a/codes/ckx1234/15830693.java +++ /dev/null @@ -1,18 +0,0 @@ -/** - * 冒泡排序函数 - * aa bb cc - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - for(int i = 0; i < n-1 ; i++){ - for (int j = 0;j < n-1-i;j++){ - if(a[j] > a[j+1]){ - int temp = a[j]; - a[j] = a[j+1]; - a[j+1] = temp; - } - } - } - -} //end diff --git a/codes/ckx17837725358/15859776.java b/codes/ckx17837725358/15859776.java deleted file mode 100644 index 271d2f1dfec9c226694fa24afe300e49f150ca51..0000000000000000000000000000000000000000 --- a/codes/ckx17837725358/15859776.java +++ /dev/null @@ -1,18 +0,0 @@ -/** - * 冒泡排序函数 - * 将数组a按照从小到大的顺序排序 - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int[] a, int n) { - for (int i = 0; i < n - 1; i++) { // 外层循环，决定冒泡的趟数 - for (int j = 0; j < n - 1 - i; j++) { // 内层循环，决定每趟比较的次数 - if (a[j] > a[j + 1]) { // 如果当前元素大于下一个元素，则交换它们的位置 - // 交换a[j]和a[j + 1] - int temp = a[j]; - a[j] = a[j + 1]; - a[j + 1] = temp; - } - } - } -} // end diff --git a/codes/clausliang/11466217.java b/codes/clausliang/11466217.java deleted file mode 100644 index cdabc2e0876ad629e41ff055727cf3af34be8917..0000000000000000000000000000000000000000 --- a/codes/clausliang/11466217.java +++ /dev/null @@ -1,20 +0,0 @@ -/** - * 冒泡排序函数 - * aa bb cc - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - // 你的代码，使无序数组 a 变得有序 - for (int i = 0; i < n; i++) { - for (int j = i + 1; j < n; j++) { - if (a[i] > a[j]) { - int temp = a[j]; - a[j] = a[i]; - a[i] = temp; - - } - } - } - -} //end \ No newline at end of file diff --git a/codes/cloudchasers/.keep b/codes/cloudchasers/.keep deleted file mode 100644 index e69de29bb2d1d6434b8b29ae775ad8c2e48c5391..0000000000000000000000000000000000000000 diff --git a/codes/cloudchasers/15772624.java b/codes/cloudchasers/15772624.java deleted file mode 100644 index 6426772fb479b07ed3be21ef1867921d1dbb194c..0000000000000000000000000000000000000000 --- a/codes/cloudchasers/15772624.java +++ /dev/null @@ -1,20 +0,0 @@ -/** - * 冒泡排序函数 - * aa bb cc - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - // 你的代码，使无序数组 a 变得有序 - for(int i = 0; i < n; i++) { - for(int j = 0; j < n - i - 1; j++) { - if(a[j] > a[j + 1]) { - int temp = a[j]; - a [j] = a[j + 1]; - a[j + 1] = temp; - } - } - } - - -} //end \ No newline at end of file diff --git a/codes/cly2589/15577808.java b/codes/cly2589/15577808.java deleted file mode 100644 index c2afaa2414da1853e4500b02c6de9068b64aeafe..0000000000000000000000000000000000000000 --- a/codes/cly2589/15577808.java +++ /dev/null @@ -1,18 +0,0 @@ -/** - * 冒泡排序函数 - * aa bb cc - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - for(int i = 0; i < n-1 ; i++){ - for (int j = 0;j < n-1-i;j++){ - if(a[j] > a[j+1]){ - int temp = a[j]; - a[j] = a[j+1]; - a[j+1] = temp; - } - } - } - -} //end diff --git a/codes/cmosinverter/15780363.java b/codes/cmosinverter/15780363.java deleted file mode 100644 index c8198005f2d13a90b5127252caab1b5241ab2062..0000000000000000000000000000000000000000 --- a/codes/cmosinverter/15780363.java +++ /dev/null @@ -1,28 +0,0 @@ -/** - * 冒泡排序函数 - * aa bb cc - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - if (n <= 1) return; // 如果数组长度小于等于1，不需要排序 - - boolean swapped; - for (int i = 0; i < n - 1; i++) { - swapped = false; - for (int j = 0; j < n - 1 - i; j++) { - if (a[j] > a[j + 1]) { - // 交换a[j]和a[j + 1] - int temp = a[j]; - a[j] = a[j + 1]; - a[j + 1] = temp; - swapped = true; - } - } - // 如果这一轮没有发生交换，说明数组已经有序，退出排序 - if (!swapped) { - break; - } - } -} //end - diff --git a/codes/coco08/11244510.java b/codes/coco08/11244510.java deleted file mode 100644 index 4d7083fe05ce3e6d3fadd59d6d55e2cbc50d546d..0000000000000000000000000000000000000000 --- a/codes/coco08/11244510.java +++ /dev/null @@ -1,22 +0,0 @@ -/** - * 冒泡排序函数 - * aa bb cc - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - // 你的代码，使无序数组 a 变得有序 - int i, j; - - for(i=0; ia[j]){ - int temp; - temp = a[j-1]; - a[j-1] = a[j]; - a[j] = temp; - } - } - } - -} //end \ No newline at end of file diff --git a/codes/codeelite/.keep b/codes/codeelite/.keep deleted file mode 100644 index e69de29bb2d1d6434b8b29ae775ad8c2e48c5391..0000000000000000000000000000000000000000 diff --git a/codes/codeelite/15774516.java b/codes/codeelite/15774516.java deleted file mode 100644 index 6426772fb479b07ed3be21ef1867921d1dbb194c..0000000000000000000000000000000000000000 --- a/codes/codeelite/15774516.java +++ /dev/null @@ -1,20 +0,0 @@ -/** - * 冒泡排序函数 - * aa bb cc - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - // 你的代码，使无序数组 a 变得有序 - for(int i = 0; i < n; i++) { - for(int j = 0; j < n - i - 1; j++) { - if(a[j] > a[j + 1]) { - int temp = a[j]; - a [j] = a[j + 1]; - a[j + 1] = temp; - } - } - } - - -} //end \ No newline at end of file diff --git a/codes/codemovers/.keep b/codes/codemovers/.keep deleted file mode 100644 index e69de29bb2d1d6434b8b29ae775ad8c2e48c5391..0000000000000000000000000000000000000000 diff --git a/codes/codemovers/15776343.java b/codes/codemovers/15776343.java deleted file mode 100644 index 6426772fb479b07ed3be21ef1867921d1dbb194c..0000000000000000000000000000000000000000 --- a/codes/codemovers/15776343.java +++ /dev/null @@ -1,20 +0,0 @@ -/** - * 冒泡排序函数 - * aa bb cc - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - // 你的代码，使无序数组 a 变得有序 - for(int i = 0; i < n; i++) { - for(int j = 0; j < n - i - 1; j++) { - if(a[j] > a[j + 1]) { - int temp = a[j]; - a [j] = a[j + 1]; - a[j + 1] = temp; - } - } - } - - -} //end \ No newline at end of file diff --git a/codes/codeshallow/.java b/codes/codeshallow/.java deleted file mode 100644 index e69de29bb2d1d6434b8b29ae775ad8c2e48c5391..0000000000000000000000000000000000000000 diff --git a/codes/codeshallow/9947400.java b/codes/codeshallow/9947400.java deleted file mode 100644 index 10dbc6525b8c4427dda5055b3f3c224c68398d2c..0000000000000000000000000000000000000000 --- a/codes/codeshallow/9947400.java +++ /dev/null @@ -1,19 +0,0 @@ -/** - * 冒泡排序函数 - * aa bb cc - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - // 你的代码，使无序数组 a 变得有序 - for(int i = 0 ; i < n - 1 ; i++){ - for(int j = 0 ; j < n - 1 - i ; j++){ - if(a[j] > a[j + 1]){ - int tmp = a[j]; - a[j] = a[j + 1]; - a[j + 1] = tmp; - } - } - } - -} //end diff --git a/codes/comTom/10859102.java b/codes/comTom/10859102.java deleted file mode 100644 index ab3d8f390cfa4cee1947d39872e75bac48b3058a..0000000000000000000000000000000000000000 --- a/codes/comTom/10859102.java +++ /dev/null @@ -1,11 +0,0 @@ -public static void bubbleSort(int [] a, int n) { - for (int i=0 ; ia[j+1]) { - int temp=a[j]; - a[j]=a[j+1]; - a[j+1]=temp; - } - } - } -} diff --git a/codes/comefly/16334983.java b/codes/comefly/16334983.java deleted file mode 100644 index 94c35a664e1d7f42b4d76524b20effa37223c5ba..0000000000000000000000000000000000000000 --- a/codes/comefly/16334983.java +++ /dev/null @@ -1,11 +0,0 @@ -public static void bubbleSort(int[] a, int n) { - for (int i = 0; i < n - 1; i++) { - for (int j = 0; j < n - i - 1; j++) { - if (a[j] > a[j + 1]) { - int temp = a[j]; - a[j] = a[j + 1]; - a[j + 1] = temp; - } - } - } -} diff --git a/codes/conanz/.keep b/codes/conanz/.keep deleted file mode 100644 index e69de29bb2d1d6434b8b29ae775ad8c2e48c5391..0000000000000000000000000000000000000000 diff --git a/codes/conanz/10041693.java b/codes/conanz/10041693.java deleted file mode 100644 index 667eee0f585ec38ce639cb36d80df080e935946d..0000000000000000000000000000000000000000 --- a/codes/conanz/10041693.java +++ /dev/null @@ -1,11 +0,0 @@ -public static void bubbleSort(int [] a,int n){ - for(int i = 0; i < n-1 ; i++){ - for (int j = 0;j < n-1-i;j++){ - if(a[j] > a[j+1]){ - int temp = a[j]; - a[j] = a[j+1]; - a[j+1] = temp; - } - } - } -} \ No newline at end of file diff --git a/codes/coo6666/11212756.java b/codes/coo6666/11212756.java deleted file mode 100644 index b9bf7818d9ffdce1bf2bd0863a51890bffa3f951..0000000000000000000000000000000000000000 --- a/codes/coo6666/11212756.java +++ /dev/null @@ -1,11 +0,0 @@ -public static void bubbleSort(int [] a, int n) { - for (int i=0 ; ia[j+1]) { - int temp=a[j]; - a[j]=a[j+1]; - a[j+1]=temp; - } - } - } -} \ No newline at end of file diff --git a/codes/coolbob/11342463.java b/codes/coolbob/11342463.java deleted file mode 100644 index cdabc2e0876ad629e41ff055727cf3af34be8917..0000000000000000000000000000000000000000 --- a/codes/coolbob/11342463.java +++ /dev/null @@ -1,20 +0,0 @@ -/** - * 冒泡排序函数 - * aa bb cc - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - // 你的代码，使无序数组 a 变得有序 - for (int i = 0; i < n; i++) { - for (int j = i + 1; j < n; j++) { - if (a[i] > a[j]) { - int temp = a[j]; - a[j] = a[i]; - a[i] = temp; - - } - } - } - -} //end \ No newline at end of file diff --git a/codes/coreliu/9889405.java b/codes/coreliu/9889405.java deleted file mode 100644 index 661499fc3a69b869708e75b839ddbc12a2776d9b..0000000000000000000000000000000000000000 --- a/codes/coreliu/9889405.java +++ /dev/null @@ -1,17 +0,0 @@ -/** - * 冒泡排序函数 - * aa bb cc - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a,int n){ - for(int i = 0; i < n-1 ; i++){ - for (int j = 0;j < n-1-i;j++){ - if(a[j] > a[j+1]){ - int temp = a[j]; - a[j] = a[j+1]; - a[j+1] = temp; - } - } - } -} diff --git a/codes/coshpr/18429589.java b/codes/coshpr/18429589.java deleted file mode 100644 index 2ff38650b9dd5fcbbc8bb96086117f2c4f83d1a0..0000000000000000000000000000000000000000 --- a/codes/coshpr/18429589.java +++ /dev/null @@ -1,18 +0,0 @@ -/** - * 冒泡排序函数 - * aa bb cc - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - // 你的代码，使无序数组 a 变得有序 - for(int i=0;ia[j+1]){ - a[j] = a[j]+a[j+1]; - a[j+1] = a[j]-a[j+1]; - a[j] = a[j]-a[j+1]; - } - } - } -} //end diff --git a/codes/course/15530455.java b/codes/course/15530455.java deleted file mode 100644 index 61c422b629e86de0017a8c4de128f6973bd290c9..0000000000000000000000000000000000000000 --- a/codes/course/15530455.java +++ /dev/null @@ -1,19 +0,0 @@ -/** - * 冒泡排序函数 - * aa bb cc - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - // 你的代码，使无序数组 a 变得有序 - for (int i = 0; i < n - 1; i++) { - for (int j = 0; j < n - i - 1; j++) { - if (a[j] > a[j + 1]) { - // 交换元素 - int temp = a[j]; - a[j] = a[j + 1]; - a[j + 1] = temp; - } - } - } -} //end \ No newline at end of file diff --git a/codes/cppdkuo/11329887.java b/codes/cppdkuo/11329887.java deleted file mode 100644 index 8c505501c812f686a9abe78a0d1191db6085134c..0000000000000000000000000000000000000000 --- a/codes/cppdkuo/11329887.java +++ /dev/null @@ -1,19 +0,0 @@ -/** - * 冒泡排序函数 - * aa bb cc - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - // 你的代码，使无序数组 a 变得有序 - for(int i=0;i a[j+1]){ - int temp = a[j]; - a[j] = a[j+1]; - a[j+1] = temp; - } - } - } - -} //end \ No newline at end of file diff --git a/codes/cr12345/.keep b/codes/cr12345/.keep deleted file mode 100644 index e69de29bb2d1d6434b8b29ae775ad8c2e48c5391..0000000000000000000000000000000000000000 diff --git a/codes/cr12345/10985032.java b/codes/cr12345/10985032.java deleted file mode 100644 index ecc6b910e01246737286675ada360c1f523475f8..0000000000000000000000000000000000000000 --- a/codes/cr12345/10985032.java +++ /dev/null @@ -1,12 +0,0 @@ -public static void bubbleSort(int [] a, int n) { - for (int i=0 ; ia[j+1]) { - int temp=a[j]; - a[j]=a[j+1]; - a[j+1]=temp; - } - } - } -} - diff --git a/codes/craftsmen/.keep b/codes/craftsmen/.keep deleted file mode 100644 index e69de29bb2d1d6434b8b29ae775ad8c2e48c5391..0000000000000000000000000000000000000000 diff --git a/codes/craftsmen/15775673.java b/codes/craftsmen/15775673.java deleted file mode 100644 index 6426772fb479b07ed3be21ef1867921d1dbb194c..0000000000000000000000000000000000000000 --- a/codes/craftsmen/15775673.java +++ /dev/null @@ -1,20 +0,0 @@ -/** - * 冒泡排序函数 - * aa bb cc - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - // 你的代码，使无序数组 a 变得有序 - for(int i = 0; i < n; i++) { - for(int j = 0; j < n - i - 1; j++) { - if(a[j] > a[j + 1]) { - int temp = a[j]; - a [j] = a[j + 1]; - a[j + 1] = temp; - } - } - } - - -} //end \ No newline at end of file diff --git a/codes/credit/15777503.java b/codes/credit/15777503.java deleted file mode 100644 index a73834e9835a08c8638f1d13214eacc12771f0ca..0000000000000000000000000000000000000000 --- a/codes/credit/15777503.java +++ /dev/null @@ -1,26 +0,0 @@ -/** - * 冒泡排序函数 - * 通过相邻元素之间的比较和交换，将无序数组变为有序数组 - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - for (int i = 0; i < n - 1; i++) { - // 标记变量，用于优化，如果在一趟排序中没有交换，则数组已经有序 - boolean swapped = false; - for (int j = 0; j < n - i - 1; j++) { - // 如果前一个元素大于后一个元素，则交换它们 - if (a[j] > a[j + 1]) { - int temp = a[j]; - a[j] = a[j + 1]; - a[j + 1] = temp; - // 发生了交换，将标记设为true - swapped = true; - } - } - // 如果在内层循环中没有发生交换，则数组已经有序，提前退出 - if (!swapped) { - break; - } - } -} //end diff --git a/codes/crh111/15562582.java b/codes/crh111/15562582.java deleted file mode 100644 index 25b3bbe48bce467063cee5629079bc6a1504a0ec..0000000000000000000000000000000000000000 --- a/codes/crh111/15562582.java +++ /dev/null @@ -1,18 +0,0 @@ -/** - * 冒泡排序函数 - * aa bb cc - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - // 你的代码，使无序数组 a 变得有序 - for(int i = 0; i < n-1 ; i++){ - for (int j = 0;j < n-1-i;j++){ - if(a[j] > a[j+1]){ - int temp = a[j]; - a[j] = a[j+1]; - a[j+1] = temp; - } - } - } -} //end diff --git a/codes/cslearn/10428388.java b/codes/cslearn/10428388.java deleted file mode 100644 index 5ba81a6b94b820eafee5fda1bbd6ce01d9d083b4..0000000000000000000000000000000000000000 --- a/codes/cslearn/10428388.java +++ /dev/null @@ -1,21 +0,0 @@ -/** - * 冒泡排序函数 - * aa bb cc - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - // 你的代码，使无序数组 a 变得有序 - for(int i = 0; i < n - 1; i++) { - - for(int j = 0; j < n - 1 - i; j++) { - - if(a[j] > a[j+1]) { - int temp = a[j]; - a[j] = a[j+1]; - a[j+1] = temp; - } - } - } - -} //end diff --git a/codes/cstzt6/15454369.java b/codes/cstzt6/15454369.java deleted file mode 100644 index 4005b9a51725fadf01f5bf33c84951b00695b246..0000000000000000000000000000000000000000 --- a/codes/cstzt6/15454369.java +++ /dev/null @@ -1,13 +0,0 @@ -public static void bubbleSort(int [] a, int n){ - - for(int i = 0 ; i < n - 1 ; i++){ - for(int j = 0 ; j < n - 1 - i ; j++){ - if(a[j] > a[j + 1]){ - int tmp = a[j]; - a[j] = a[j + 1]; - a[j + 1] = tmp; - } - } - } - -} diff --git a/codes/cstzt6/16340693.java b/codes/cstzt6/16340693.java deleted file mode 100644 index 4005b9a51725fadf01f5bf33c84951b00695b246..0000000000000000000000000000000000000000 --- a/codes/cstzt6/16340693.java +++ /dev/null @@ -1,13 +0,0 @@ -public static void bubbleSort(int [] a, int n){ - - for(int i = 0 ; i < n - 1 ; i++){ - for(int j = 0 ; j < n - 1 - i ; j++){ - if(a[j] > a[j + 1]){ - int tmp = a[j]; - a[j] = a[j + 1]; - a[j + 1] = tmp; - } - } - } - -} diff --git a/codes/cumtsgw/.15377867.java.swp b/codes/cumtsgw/.15377867.java.swp deleted file mode 100644 index 50eed755d8becbd73a565f065816f9970304c3ea..0000000000000000000000000000000000000000 Binary files a/codes/cumtsgw/.15377867.java.swp and /dev/null differ diff --git a/codes/cumtsgw/15377867.java b/codes/cumtsgw/15377867.java deleted file mode 100644 index 27626c403eaa167d0a67eb769b2c3d8c95df20dd..0000000000000000000000000000000000000000 --- a/codes/cumtsgw/15377867.java +++ /dev/null @@ -1,18 +0,0 @@ -/** - * 冒泡排序函数 - * aa bb cc - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - // 你的代码，使无序数组 a 变得有序 - for (int i = 0; i < n; i++) { - for (int j = 0; j < n - 1 - i; j++) { - if (a[j] > a[j + 1]) { - int temp = a[j]; - a[j] = a[j + 1]; - a[j + 1] = temp; - } - } - } -} //end diff --git a/codes/current/11226352.java b/codes/current/11226352.java deleted file mode 100644 index cdabc2e0876ad629e41ff055727cf3af34be8917..0000000000000000000000000000000000000000 --- a/codes/current/11226352.java +++ /dev/null @@ -1,20 +0,0 @@ -/** - * 冒泡排序函数 - * aa bb cc - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - // 你的代码，使无序数组 a 变得有序 - for (int i = 0; i < n; i++) { - for (int j = i + 1; j < n; j++) { - if (a[i] > a[j]) { - int temp = a[j]; - a[j] = a[i]; - a[i] = temp; - - } - } - } - -} //end \ No newline at end of file diff --git a/codes/cursor/.java b/codes/cursor/.java deleted file mode 100644 index e69de29bb2d1d6434b8b29ae775ad8c2e48c5391..0000000000000000000000000000000000000000 diff --git a/codes/cursor/13859449.java b/codes/cursor/13859449.java deleted file mode 100644 index 6fbfba637d03d4f83c986e9c02a37a624268bd6a..0000000000000000000000000000000000000000 --- a/codes/cursor/13859449.java +++ /dev/null @@ -1,33 +0,0 @@ -/** - * 冒泡排序函数 - * aa bb cc - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - // 你的代码，使无序数组 a 变得有序 - if (n <= 1) { - return; - } - - for (int i = 0; i < n; i++) { - // 提前退出冒泡循环的标志位 - boolean flag = false; - - for (int j = 0; j < n - i - 1; j++) { - if (a[j] > a[j + 1]) { // 将相邻元素进行比较 - // 交换相邻元素 - int temp = a[j]; - a[j] = a[j + 1]; - a[j + 1] = temp; - // 设置标志位为true - flag = true; - } - } - - if (!flag) { // 如果一次冒泡循环中没有发生交换，则说明数组已经有序，直接退出循环 - break; - } - } - -} //end diff --git a/codes/cwt1216/15777958.java b/codes/cwt1216/15777958.java deleted file mode 100644 index 81aa6d0aae15c398f43303418c389cd76d99c30b..0000000000000000000000000000000000000000 --- a/codes/cwt1216/15777958.java +++ /dev/null @@ -1,28 +0,0 @@ -/** - * 冒泡排序函数 - * 通过重复地遍历待排序的数列，一次比较两个元素，如果他们的顺序错误就把他们交换过来。 - * 遍历数列的工作是重复地进行直到没有再需要交换，也就是说该数列已经排序完成。 - * 这个算法的名字由来是因为越小的元素会经由交换慢慢“浮”到数列的顶端。 - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int[] a, int n) { - for (int i = 0; i < n - 1; i++) { - // 标记是否有交换发生，用于提前结束循环 - boolean swapped = false; - for (int j = 0; j < n - i - 1; j++) { - // 如果当前元素大于下一个元素，则交换它们 - if (a[j] > a[j + 1]) { - int temp = a[j]; - a[j] = a[j + 1]; - a[j + 1] = temp; - // 发生了交换，标记为true - swapped = true; - } - } - // 如果在内层循环中没有发生交换，则数组已经有序，可以提前结束 - if (!swapped) { - break; - } - } -} //end diff --git a/codes/cxy11/15898495.java b/codes/cxy11/15898495.java deleted file mode 100644 index 3738ab943b7336ea05c09b4f4a63f0d3103c9736..0000000000000000000000000000000000000000 --- a/codes/cxy11/15898495.java +++ /dev/null @@ -1,12 +0,0 @@ -public static void bubbleSort(int [] a, int n){ - for(int i = 0; i < n-1 ; i++){ - for (int j = 0;j < n-1-i;j++){ - if(a[j] > a[j+1]){ - int temp = a[j]; - a[j] = a[j+1]; - a[j+1] = temp; - } - } - } - -} //end diff --git a/codes/cxy2801439718/15898495.java b/codes/cxy2801439718/15898495.java deleted file mode 100644 index 90127cbc8ddaeed19d92ca092f6aa6b75553f5ef..0000000000000000000000000000000000000000 --- a/codes/cxy2801439718/15898495.java +++ /dev/null @@ -1,12 +0,0 @@ -public static void bubbleSort(int [] a, int n){ - for(int i = 0; i < n-1 ; i++){ - for (int j = 0;j < n-1-i;j++){ - if(a[j] > a[j+1]){ - int temp = a[j]; - a[j] = a[j+1]; - a[j+1] = temp; - } - } - } - -} diff --git a/codes/cyanide/15311596.java b/codes/cyanide/15311596.java deleted file mode 100644 index 2b9ca2cfd4ca60597211367f659c9aeb6cf30b10..0000000000000000000000000000000000000000 --- a/codes/cyanide/15311596.java +++ /dev/null @@ -1,11 +0,0 @@ -public static void bubbleSort(int [] arr, int n){ - for(int i = 0; i < n; i++) { - for(int j = 0; j < n - i - 1; j++) { - if(arr[j] > arr[j + 1]) { - int temp = arr[j]; - arr [j] = arr[j + 1]; - arr[j + 1] = temp; - } - } - } -} diff --git a/codes/cybernexuss/.keep b/codes/cybernexuss/.keep deleted file mode 100644 index e69de29bb2d1d6434b8b29ae775ad8c2e48c5391..0000000000000000000000000000000000000000 diff --git a/codes/cybernexuss/15776044.java b/codes/cybernexuss/15776044.java deleted file mode 100644 index 6426772fb479b07ed3be21ef1867921d1dbb194c..0000000000000000000000000000000000000000 --- a/codes/cybernexuss/15776044.java +++ /dev/null @@ -1,20 +0,0 @@ -/** - * 冒泡排序函数 - * aa bb cc - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - // 你的代码，使无序数组 a 变得有序 - for(int i = 0; i < n; i++) { - for(int j = 0; j < n - i - 1; j++) { - if(a[j] > a[j + 1]) { - int temp = a[j]; - a [j] = a[j + 1]; - a[j + 1] = temp; - } - } - } - - -} //end \ No newline at end of file diff --git a/codes/cyberwarriors/.keep b/codes/cyberwarriors/.keep deleted file mode 100644 index e69de29bb2d1d6434b8b29ae775ad8c2e48c5391..0000000000000000000000000000000000000000 diff --git a/codes/cyberwarriors/15771923.java b/codes/cyberwarriors/15771923.java deleted file mode 100644 index 6426772fb479b07ed3be21ef1867921d1dbb194c..0000000000000000000000000000000000000000 --- a/codes/cyberwarriors/15771923.java +++ /dev/null @@ -1,20 +0,0 @@ -/** - * 冒泡排序函数 - * aa bb cc - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - // 你的代码，使无序数组 a 变得有序 - for(int i = 0; i < n; i++) { - for(int j = 0; j < n - i - 1; j++) { - if(a[j] > a[j + 1]) { - int temp = a[j]; - a [j] = a[j + 1]; - a[j + 1] = temp; - } - } - } - - -} //end \ No newline at end of file diff --git a/codes/cyc991026/.keep b/codes/cyc991026/.keep deleted file mode 100644 index e69de29bb2d1d6434b8b29ae775ad8c2e48c5391..0000000000000000000000000000000000000000 diff --git a/codes/cyc991026/10042475.java b/codes/cyc991026/10042475.java deleted file mode 100644 index 667eee0f585ec38ce639cb36d80df080e935946d..0000000000000000000000000000000000000000 --- a/codes/cyc991026/10042475.java +++ /dev/null @@ -1,11 +0,0 @@ -public static void bubbleSort(int [] a,int n){ - for(int i = 0; i < n-1 ; i++){ - for (int j = 0;j < n-1-i;j++){ - if(a[j] > a[j+1]){ - int temp = a[j]; - a[j] = a[j+1]; - a[j+1] = temp; - } - } - } -} \ No newline at end of file diff --git a/codes/cyqlxxy/15777955.java b/codes/cyqlxxy/15777955.java deleted file mode 100644 index 2252b818e6125ed4f8bbd23eca03c12c15ca1757..0000000000000000000000000000000000000000 --- a/codes/cyqlxxy/15777955.java +++ /dev/null @@ -1,19 +0,0 @@ -/** - * 冒泡排序函数 - * aa bb cc - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - // 你的代码，使无序数组 a 变得有序 - for (int i = 0; i < n - 1; i++) { - for (int j = 0; j < n - i - 1; j++) { - if (a[j] > a[j + 1]) { - // 交换元素 - int temp = a[j]; - a[j] = a[j + 1]; - a[j + 1] = temp; - } - } - } -} //end \ No newline at end of file diff --git a/codes/cyrusyu/11179070.java b/codes/cyrusyu/11179070.java deleted file mode 100644 index 183c2516b28113e5c1197a19ab0c7945d79b5d20..0000000000000000000000000000000000000000 --- a/codes/cyrusyu/11179070.java +++ /dev/null @@ -1,19 +0,0 @@ -/** - * 冒泡排序函数 - * aa bb cc - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - - for (int i = 0; i < n; i++) { - for (int j = 0; j < i; j++) { - if (a[i] < a[j]) { - int t = a[i]; - a[i] = a[j]; - a[j] = t; - } - } - } -}//end - diff --git a/codes/dabing/.keep b/codes/dabing/.keep deleted file mode 100644 index e69de29bb2d1d6434b8b29ae775ad8c2e48c5391..0000000000000000000000000000000000000000 diff --git a/codes/dabing/15831131.java b/codes/dabing/15831131.java deleted file mode 100644 index 6426772fb479b07ed3be21ef1867921d1dbb194c..0000000000000000000000000000000000000000 --- a/codes/dabing/15831131.java +++ /dev/null @@ -1,20 +0,0 @@ -/** - * 冒泡排序函数 - * aa bb cc - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - // 你的代码，使无序数组 a 变得有序 - for(int i = 0; i < n; i++) { - for(int j = 0; j < n - i - 1; j++) { - if(a[j] > a[j + 1]) { - int temp = a[j]; - a [j] = a[j + 1]; - a[j + 1] = temp; - } - } - } - - -} //end \ No newline at end of file diff --git a/codes/daisyw0221/15531109.java b/codes/daisyw0221/15531109.java deleted file mode 100644 index 09f809e415a4633d026f43e5f6d9f379165fc44b..0000000000000000000000000000000000000000 --- a/codes/daisyw0221/15531109.java +++ /dev/null @@ -1,20 +0,0 @@ -/** - * 冒泡排序函数 - * aa bb cc - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - // 你的代码，使无序数组 a 变得有序 - for (int i = 0; i < n - 1; i++) { - for (int j = 0; j < n - i - 1; j++) { - if (a[j] > a[j + 1]) { - // 交换 a[j] 和 a[j + 1] - int temp = a[j]; - a[j] = a[j + 1]; - a[j + 1] = temp; - } - } - } -} //end - diff --git a/codes/damingya/15777770.java b/codes/damingya/15777770.java deleted file mode 100644 index 987377810b5beca8eb4bf5eafeee5db45e234a87..0000000000000000000000000000000000000000 --- a/codes/damingya/15777770.java +++ /dev/null @@ -1,20 +0,0 @@ -/** - * 冒泡排序函数 - * aa bb cc - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - // 你的代码，使无序数组 a 变得有序 - for(int i = 0; i < n; i++) { - for(int liuy = 0; liuy < n - i - 1; liuy++) { - if(a[liuy] > a[liuy + 1]) { - int temp = a[liuy]; - a [liuy] = a[liuy + 1]; - a[liuy + 1] = temp; - } - } - } - - -} //end,liuy diff --git a/codes/dappwwww/10999016.java b/codes/dappwwww/10999016.java deleted file mode 100644 index d34027face05a4c77a2a35deae63795bb9c58f79..0000000000000000000000000000000000000000 --- a/codes/dappwwww/10999016.java +++ /dev/null @@ -1,27 +0,0 @@ -/** - * 冒泡排序函数 - * aa bb cc - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - // 你的代码，使无序数组 a 变得有序 - if(a == null || a.length == 0){ - return; - } - for(int i = 0; i< n; i++){ - boolean flag = true; - for(int j = 0; j< n - i - 1 ; j++){ - if(a[j]> a[j+1]){ - int tmp = a[j]; - a[j] = a[j+1]; - a[j+1] = tmp; - flag = false; - } - } - if(flag){ - break; - } - - } -} //end \ No newline at end of file diff --git a/codes/darkfu/15693973.java b/codes/darkfu/15693973.java deleted file mode 100644 index 3ca2d28eb7fccbe814f3857fc11061c1324317bc..0000000000000000000000000000000000000000 --- a/codes/darkfu/15693973.java +++ /dev/null @@ -1,17 +0,0 @@ -/** - * 冒泡排序函数 - * 使用冒泡法对数组进行升序排序 - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - for (int i = 0; i < n - 1; i++) { // 外层循环控制遍历次数 - for (int j = 0; j < n - 1 - i; j++) { // 内层循环用来比较相邻元素并可能交换它们 - if (a[j] > a[j + 1]) { // 如果前一个元素大于后一个元素，则交换它们的位置 - int temp = a[j]; - a[j] = a[j + 1]; - a[j + 1] = temp; - } - } - } -} // end diff --git a/codes/dasdasd2341/.keep b/codes/dasdasd2341/.keep deleted file mode 100644 index e69de29bb2d1d6434b8b29ae775ad8c2e48c5391..0000000000000000000000000000000000000000 diff --git a/codes/dasdasd2341/15743468.java b/codes/dasdasd2341/15743468.java deleted file mode 100644 index 6e9861fa3ec6d5a2553cdccd1bb1e977430c671b..0000000000000000000000000000000000000000 --- a/codes/dasdasd2341/15743468.java +++ /dev/null @@ -1,19 +0,0 @@ -/** - * 冒泡排序函数 - * aa bb cc - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - // 你的代码，使无序数组 a 变得有序 - for (int i = 0; i < n - 1; i++) { - for (int j = 0; j < n - i - 1; j++) { - if (a[j] > a[j + 1]) { - - int temp = a[j]; - a[j] = a[j + 1]; - a[j + 1] = temp; - } - } - } -} //end \ No newline at end of file diff --git a/codes/dasdasd2341/15799082.java b/codes/dasdasd2341/15799082.java deleted file mode 100644 index 6e9861fa3ec6d5a2553cdccd1bb1e977430c671b..0000000000000000000000000000000000000000 --- a/codes/dasdasd2341/15799082.java +++ /dev/null @@ -1,19 +0,0 @@ -/** - * 冒泡排序函数 - * aa bb cc - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - // 你的代码，使无序数组 a 变得有序 - for (int i = 0; i < n - 1; i++) { - for (int j = 0; j < n - i - 1; j++) { - if (a[j] > a[j + 1]) { - - int temp = a[j]; - a[j] = a[j + 1]; - a[j + 1] = temp; - } - } - } -} //end \ No newline at end of file diff --git a/codes/dashengfa/15837719.java b/codes/dashengfa/15837719.java deleted file mode 100644 index 47e0d6efa8bfa49fe95c91537dccda0c09563b63..0000000000000000000000000000000000000000 --- a/codes/dashengfa/15837719.java +++ /dev/null @@ -1,18 +0,0 @@ -/** - * 冒泡排序函数 - * 功能：对数组进行升序排序 - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int[] a, int n) { - for (int i = 0; i < n - 1; i++) { // 遍历数组，从第一个元素到倒数第二个元素 - for (int j = 0; j < n - 1 - i; j++) { // 每次比较相邻的元素，最后一个元素已经是当前轮的最大值，无需再比较 - if (a[j] > a[j + 1]) { // 如果前一个元素大于后一个元素，则交换它们的位置 - // 交换 a[j] 和 a[j+1] - int temp = a[j]; - a[j] = a[j + 1]; - a[j + 1] = temp; - } - } - } -} // end diff --git a/codes/datacubes/.keep b/codes/datacubes/.keep deleted file mode 100644 index e69de29bb2d1d6434b8b29ae775ad8c2e48c5391..0000000000000000000000000000000000000000 diff --git a/codes/datacubes/15775733.java b/codes/datacubes/15775733.java deleted file mode 100644 index 6426772fb479b07ed3be21ef1867921d1dbb194c..0000000000000000000000000000000000000000 --- a/codes/datacubes/15775733.java +++ /dev/null @@ -1,20 +0,0 @@ -/** - * 冒泡排序函数 - * aa bb cc - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - // 你的代码，使无序数组 a 变得有序 - for(int i = 0; i < n; i++) { - for(int j = 0; j < n - i - 1; j++) { - if(a[j] > a[j + 1]) { - int temp = a[j]; - a [j] = a[j + 1]; - a[j + 1] = temp; - } - } - } - - -} //end \ No newline at end of file diff --git a/codes/datudou/15775955.java b/codes/datudou/15775955.java deleted file mode 100644 index 987377810b5beca8eb4bf5eafeee5db45e234a87..0000000000000000000000000000000000000000 --- a/codes/datudou/15775955.java +++ /dev/null @@ -1,20 +0,0 @@ -/** - * 冒泡排序函数 - * aa bb cc - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - // 你的代码，使无序数组 a 变得有序 - for(int i = 0; i < n; i++) { - for(int liuy = 0; liuy < n - i - 1; liuy++) { - if(a[liuy] > a[liuy + 1]) { - int temp = a[liuy]; - a [liuy] = a[liuy + 1]; - a[liuy + 1] = temp; - } - } - } - - -} //end,liuy diff --git a/codes/dawnli/15533387.java b/codes/dawnli/15533387.java deleted file mode 100644 index bdd22e5b5503973ed7066b59149c51127f36664e..0000000000000000000000000000000000000000 --- a/codes/dawnli/15533387.java +++ /dev/null @@ -1,18 +0,0 @@ - /** - * 冒泡排序函数 - * aa bb cc - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ - public static void bubbleSort(int [] a, int n){ - for (int i = 0; i < n-1; i++) { - for (int j = 0; j < n-i-1; j++) { - if (a[j] > a[j+1]) { - // 交换 arr[j+1] and arr[j] - int temp = a[j]; - a[j] = a[j+1]; - a[j+1] = temp; - } - } - } - } //end diff --git a/codes/daxiong/.keep b/codes/daxiong/.keep deleted file mode 100644 index e69de29bb2d1d6434b8b29ae775ad8c2e48c5391..0000000000000000000000000000000000000000 diff --git a/codes/daxiong/15846450.java b/codes/daxiong/15846450.java deleted file mode 100644 index 6426772fb479b07ed3be21ef1867921d1dbb194c..0000000000000000000000000000000000000000 --- a/codes/daxiong/15846450.java +++ /dev/null @@ -1,20 +0,0 @@ -/** - * 冒泡排序函数 - * aa bb cc - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - // 你的代码，使无序数组 a 变得有序 - for(int i = 0; i < n; i++) { - for(int j = 0; j < n - i - 1; j++) { - if(a[j] > a[j + 1]) { - int temp = a[j]; - a [j] = a[j + 1]; - a[j + 1] = temp; - } - } - } - - -} //end \ No newline at end of file diff --git a/codes/dayeee/12165634.java b/codes/dayeee/12165634.java deleted file mode 100644 index 9a1b572d4ab0a76a6614137e28d90b6c2dd28ef8..0000000000000000000000000000000000000000 --- a/codes/dayeee/12165634.java +++ /dev/null @@ -1,18 +0,0 @@ -/** - * 冒泡排序函数 - * - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int[] a, int n) { - for (int i = 0; i < n - 1; i++) { - for (int j = 0; j < n - 1 - i; j++) { - if (a[j] > a[j + 1]) { - // 交换 a[j] 和 a[j+1] 的位置 - int temp = a[j]; - a[j] = a[j + 1]; - a[j + 1] = temp; - } - } - } -} diff --git a/codes/dayuya/10044865.java b/codes/dayuya/10044865.java deleted file mode 100644 index 83bb3cd3aa5e3e22feb4c71643b6b05d736e4b55..0000000000000000000000000000000000000000 --- a/codes/dayuya/10044865.java +++ /dev/null @@ -1,19 +0,0 @@ -/** - * 冒泡排序函数 - * aa bb cc - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - // 你的代码，使无序数组 a 变得有序 - for(int i=0;i a[j+1]){ - int temp = a[j]; - a[j] = a[j+1]; - a[j+1] = temp; - } - } - } - -} //end diff --git a/codes/ddi123456/15775627.java b/codes/ddi123456/15775627.java deleted file mode 100644 index 9805991e910566f0640e2e7eac2f9f3cd59f99f1..0000000000000000000000000000000000000000 --- a/codes/ddi123456/15775627.java +++ /dev/null @@ -1,18 +0,0 @@ -/** - * 冒泡排序函数 - * 该函数实现了冒泡排序算法，将数组a按照从小到大的顺序排序 - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int[] a, int n) { - for (int i = 0; i < n - 1; i++) { - for (int j = 0; j < n - i - 1; j++) { - // 如果当前元素大于下一个元素，则交换它们的位置 - if (a[j] > a[j + 1]) { - int temp = a[j]; - a[j] = a[j + 1]; - a[j + 1] = temp; - } - } - } -} //end diff --git a/codes/ddl667/.keep b/codes/ddl667/.keep deleted file mode 100644 index e69de29bb2d1d6434b8b29ae775ad8c2e48c5391..0000000000000000000000000000000000000000 diff --git a/codes/ddl667/15814859.java b/codes/ddl667/15814859.java deleted file mode 100644 index 6e9861fa3ec6d5a2553cdccd1bb1e977430c671b..0000000000000000000000000000000000000000 --- a/codes/ddl667/15814859.java +++ /dev/null @@ -1,19 +0,0 @@ -/** - * 冒泡排序函数 - * aa bb cc - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - // 你的代码，使无序数组 a 变得有序 - for (int i = 0; i < n - 1; i++) { - for (int j = 0; j < n - i - 1; j++) { - if (a[j] > a[j + 1]) { - - int temp = a[j]; - a[j] = a[j + 1]; - a[j + 1] = temp; - } - } - } -} //end \ No newline at end of file diff --git a/codes/deCoder2024/.keep b/codes/deCoder2024/.keep deleted file mode 100644 index e69de29bb2d1d6434b8b29ae775ad8c2e48c5391..0000000000000000000000000000000000000000 diff --git a/codes/deCoder2024/15847492.java b/codes/deCoder2024/15847492.java deleted file mode 100644 index 6e9861fa3ec6d5a2553cdccd1bb1e977430c671b..0000000000000000000000000000000000000000 --- a/codes/deCoder2024/15847492.java +++ /dev/null @@ -1,19 +0,0 @@ -/** - * 冒泡排序函数 - * aa bb cc - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - // 你的代码，使无序数组 a 变得有序 - for (int i = 0; i < n - 1; i++) { - for (int j = 0; j < n - i - 1; j++) { - if (a[j] > a[j + 1]) { - - int temp = a[j]; - a[j] = a[j + 1]; - a[j + 1] = temp; - } - } - } -} //end \ No newline at end of file diff --git a/codes/deaita/.keep b/codes/deaita/.keep deleted file mode 100644 index e69de29bb2d1d6434b8b29ae775ad8c2e48c5391..0000000000000000000000000000000000000000 diff --git a/codes/deaita/15845569.java b/codes/deaita/15845569.java deleted file mode 100644 index 6426772fb479b07ed3be21ef1867921d1dbb194c..0000000000000000000000000000000000000000 --- a/codes/deaita/15845569.java +++ /dev/null @@ -1,20 +0,0 @@ -/** - * 冒泡排序函数 - * aa bb cc - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - // 你的代码，使无序数组 a 变得有序 - for(int i = 0; i < n; i++) { - for(int j = 0; j < n - i - 1; j++) { - if(a[j] > a[j + 1]) { - int temp = a[j]; - a [j] = a[j + 1]; - a[j + 1] = temp; - } - } - } - - -} //end \ No newline at end of file diff --git a/codes/dedeya/15742795.java b/codes/dedeya/15742795.java deleted file mode 100644 index 987377810b5beca8eb4bf5eafeee5db45e234a87..0000000000000000000000000000000000000000 --- a/codes/dedeya/15742795.java +++ /dev/null @@ -1,20 +0,0 @@ -/** - * 冒泡排序函数 - * aa bb cc - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - // 你的代码，使无序数组 a 变得有序 - for(int i = 0; i < n; i++) { - for(int liuy = 0; liuy < n - i - 1; liuy++) { - if(a[liuy] > a[liuy + 1]) { - int temp = a[liuy]; - a [liuy] = a[liuy + 1]; - a[liuy + 1] = temp; - } - } - } - - -} //end,liuy diff --git a/codes/deijia909/11468750.java b/codes/deijia909/11468750.java deleted file mode 100644 index 8c505501c812f686a9abe78a0d1191db6085134c..0000000000000000000000000000000000000000 --- a/codes/deijia909/11468750.java +++ /dev/null @@ -1,19 +0,0 @@ -/** - * 冒泡排序函数 - * aa bb cc - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - // 你的代码，使无序数组 a 变得有序 - for(int i=0;i a[j+1]){ - int temp = a[j]; - a[j] = a[j+1]; - a[j+1] = temp; - } - } - } - -} //end \ No newline at end of file diff --git a/codes/dekali/.keep b/codes/dekali/.keep deleted file mode 100644 index e69de29bb2d1d6434b8b29ae775ad8c2e48c5391..0000000000000000000000000000000000000000 diff --git a/codes/dekali/15845962.java b/codes/dekali/15845962.java deleted file mode 100644 index 6426772fb479b07ed3be21ef1867921d1dbb194c..0000000000000000000000000000000000000000 --- a/codes/dekali/15845962.java +++ /dev/null @@ -1,20 +0,0 @@ -/** - * 冒泡排序函数 - * aa bb cc - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - // 你的代码，使无序数组 a 变得有序 - for(int i = 0; i < n; i++) { - for(int j = 0; j < n - i - 1; j++) { - if(a[j] > a[j + 1]) { - int temp = a[j]; - a [j] = a[j + 1]; - a[j + 1] = temp; - } - } - } - - -} //end \ No newline at end of file diff --git a/codes/denghaodongmy123/.keep b/codes/denghaodongmy123/.keep deleted file mode 100644 index e69de29bb2d1d6434b8b29ae775ad8c2e48c5391..0000000000000000000000000000000000000000 diff --git a/codes/denghaodongmy123/15838830.java b/codes/denghaodongmy123/15838830.java deleted file mode 100644 index 6e9861fa3ec6d5a2553cdccd1bb1e977430c671b..0000000000000000000000000000000000000000 --- a/codes/denghaodongmy123/15838830.java +++ /dev/null @@ -1,19 +0,0 @@ -/** - * 冒泡排序函数 - * aa bb cc - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - // 你的代码，使无序数组 a 变得有序 - for (int i = 0; i < n - 1; i++) { - for (int j = 0; j < n - i - 1; j++) { - if (a[j] > a[j + 1]) { - - int temp = a[j]; - a[j] = a[j + 1]; - a[j + 1] = temp; - } - } - } -} //end \ No newline at end of file diff --git a/codes/devinroot/9687540.java b/codes/devinroot/9687540.java deleted file mode 100644 index 7aa905f3acb901a1a470d411df1ce71f7e107a4f..0000000000000000000000000000000000000000 --- a/codes/devinroot/9687540.java +++ /dev/null @@ -1,24 +0,0 @@ -/** - * 冒泡排序函数 - * aa bb cc - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - // 你的代码，使无序数组 a 变得有序 - for(int j=0;ja[i+1]) - { - temp=a[i]; - a[i]=a[i+1]; - a[i+1]=temp; - } - } - } - //System.out.println(a); - -} //end diff --git a/codes/df452aff/.keep b/codes/df452aff/.keep deleted file mode 100644 index e69de29bb2d1d6434b8b29ae775ad8c2e48c5391..0000000000000000000000000000000000000000 diff --git a/codes/df452aff/15831296.java b/codes/df452aff/15831296.java deleted file mode 100644 index 6e9861fa3ec6d5a2553cdccd1bb1e977430c671b..0000000000000000000000000000000000000000 --- a/codes/df452aff/15831296.java +++ /dev/null @@ -1,19 +0,0 @@ -/** - * 冒泡排序函数 - * aa bb cc - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - // 你的代码，使无序数组 a 变得有序 - for (int i = 0; i < n - 1; i++) { - for (int j = 0; j < n - i - 1; j++) { - if (a[j] > a[j + 1]) { - - int temp = a[j]; - a[j] = a[j + 1]; - a[j + 1] = temp; - } - } - } -} //end \ No newline at end of file diff --git a/codes/dfg56tsdfas/.keep b/codes/dfg56tsdfas/.keep deleted file mode 100644 index e69de29bb2d1d6434b8b29ae775ad8c2e48c5391..0000000000000000000000000000000000000000 diff --git a/codes/dfg56tsdfas/15743482.java b/codes/dfg56tsdfas/15743482.java deleted file mode 100644 index 6e9861fa3ec6d5a2553cdccd1bb1e977430c671b..0000000000000000000000000000000000000000 --- a/codes/dfg56tsdfas/15743482.java +++ /dev/null @@ -1,19 +0,0 @@ -/** - * 冒泡排序函数 - * aa bb cc - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - // 你的代码，使无序数组 a 变得有序 - for (int i = 0; i < n - 1; i++) { - for (int j = 0; j < n - i - 1; j++) { - if (a[j] > a[j + 1]) { - - int temp = a[j]; - a[j] = a[j + 1]; - a[j + 1] = temp; - } - } - } -} //end \ No newline at end of file diff --git a/codes/dfghrtdfgge5/.keep b/codes/dfghrtdfgge5/.keep deleted file mode 100644 index e69de29bb2d1d6434b8b29ae775ad8c2e48c5391..0000000000000000000000000000000000000000 diff --git a/codes/dfghrtdfgge5/15828963.java b/codes/dfghrtdfgge5/15828963.java deleted file mode 100644 index 6e9861fa3ec6d5a2553cdccd1bb1e977430c671b..0000000000000000000000000000000000000000 --- a/codes/dfghrtdfgge5/15828963.java +++ /dev/null @@ -1,19 +0,0 @@ -/** - * 冒泡排序函数 - * aa bb cc - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - // 你的代码，使无序数组 a 变得有序 - for (int i = 0; i < n - 1; i++) { - for (int j = 0; j < n - i - 1; j++) { - if (a[j] > a[j + 1]) { - - int temp = a[j]; - a[j] = a[j + 1]; - a[j + 1] = temp; - } - } - } -} //end \ No newline at end of file diff --git a/codes/dgq420377903/.keep b/codes/dgq420377903/.keep deleted file mode 100644 index e69de29bb2d1d6434b8b29ae775ad8c2e48c5391..0000000000000000000000000000000000000000 diff --git a/codes/dgq420377903/15776080.java b/codes/dgq420377903/15776080.java deleted file mode 100644 index 9f86eb587f5fb5dee2fac7e589a1cf95128af5cc..0000000000000000000000000000000000000000 --- a/codes/dgq420377903/15776080.java +++ /dev/null @@ -1,18 +0,0 @@ -/** - * 冒泡排序函数 - * aa bb cc - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - // 你的代码，使无序数组 a 变得有序 - for(int i=0;ia[j+1]){ - a[j] = a[j]+a[j+1]; - a[j+1] = a[j]-a[j+1]; - a[j] = a[j]-a[j+1]; - } - } - } -} //end \ No newline at end of file diff --git a/codes/diantun00/13629189.java b/codes/diantun00/13629189.java deleted file mode 100644 index 66bacf1af033896dc478c2741e5828abbac347d2..0000000000000000000000000000000000000000 --- a/codes/diantun00/13629189.java +++ /dev/null @@ -1,18 +0,0 @@ -/** - * 冒泡排序函数 - * aa bb cc - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - // 你的代码，使无序数组 a 变得有序 - for (int i = 0; i < n - 1; i++) { - for (int j = 0; j < n - 1 - i; j++){ - if (a[j] > a[j + 1]) { - int temp = a[j]; - a[j] = a[j + 1]; - a[j + 1] = temp; - } - } - } -} //end diff --git a/codes/dioopp/11292585.java b/codes/dioopp/11292585.java deleted file mode 100644 index 1c8889947f924214c71a3c3f202500b4780dc281..0000000000000000000000000000000000000000 --- a/codes/dioopp/11292585.java +++ /dev/null @@ -1,11 +0,0 @@ -public static void bubbleSort(int [] a,int n){ - for(int i = 0; i < n-1 ; i++){ - for (int j = 0;j < n-1-i;j++){ - if(a[j] > a[j+1]){ - int temp = a[j]; - a[j] = a[j+1]; - a[j+1] = temp; - } - } - } -} \ No newline at end of file diff --git a/codes/disaner/.keep b/codes/disaner/.keep deleted file mode 100644 index e69de29bb2d1d6434b8b29ae775ad8c2e48c5391..0000000000000000000000000000000000000000 diff --git a/codes/disaner/15798333.java b/codes/disaner/15798333.java deleted file mode 100644 index 6426772fb479b07ed3be21ef1867921d1dbb194c..0000000000000000000000000000000000000000 --- a/codes/disaner/15798333.java +++ /dev/null @@ -1,20 +0,0 @@ -/** - * 冒泡排序函数 - * aa bb cc - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - // 你的代码，使无序数组 a 变得有序 - for(int i = 0; i < n; i++) { - for(int j = 0; j < n - i - 1; j++) { - if(a[j] > a[j + 1]) { - int temp = a[j]; - a [j] = a[j + 1]; - a[j + 1] = temp; - } - } - } - - -} //end \ No newline at end of file diff --git a/codes/dishierge/.keep b/codes/dishierge/.keep deleted file mode 100644 index e69de29bb2d1d6434b8b29ae775ad8c2e48c5391..0000000000000000000000000000000000000000 diff --git a/codes/dishierge/15758829.java b/codes/dishierge/15758829.java deleted file mode 100644 index 6426772fb479b07ed3be21ef1867921d1dbb194c..0000000000000000000000000000000000000000 --- a/codes/dishierge/15758829.java +++ /dev/null @@ -1,20 +0,0 @@ -/** - * 冒泡排序函数 - * aa bb cc - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - // 你的代码，使无序数组 a 变得有序 - for(int i = 0; i < n; i++) { - for(int j = 0; j < n - i - 1; j++) { - if(a[j] > a[j + 1]) { - int temp = a[j]; - a [j] = a[j + 1]; - a[j + 1] = temp; - } - } - } - - -} //end \ No newline at end of file diff --git a/codes/dishige/.keep b/codes/dishige/.keep deleted file mode 100644 index e69de29bb2d1d6434b8b29ae775ad8c2e48c5391..0000000000000000000000000000000000000000 diff --git a/codes/dishige/15758406.java b/codes/dishige/15758406.java deleted file mode 100644 index 6426772fb479b07ed3be21ef1867921d1dbb194c..0000000000000000000000000000000000000000 --- a/codes/dishige/15758406.java +++ /dev/null @@ -1,20 +0,0 @@ -/** - * 冒泡排序函数 - * aa bb cc - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - // 你的代码，使无序数组 a 变得有序 - for(int i = 0; i < n; i++) { - for(int j = 0; j < n - i - 1; j++) { - if(a[j] > a[j + 1]) { - int temp = a[j]; - a [j] = a[j + 1]; - a[j + 1] = temp; - } - } - } - - -} //end \ No newline at end of file diff --git a/codes/dishijiuge/.keep b/codes/dishijiuge/.keep deleted file mode 100644 index e69de29bb2d1d6434b8b29ae775ad8c2e48c5391..0000000000000000000000000000000000000000 diff --git a/codes/dishijiuge/15759226.java b/codes/dishijiuge/15759226.java deleted file mode 100644 index 6426772fb479b07ed3be21ef1867921d1dbb194c..0000000000000000000000000000000000000000 --- a/codes/dishijiuge/15759226.java +++ /dev/null @@ -1,20 +0,0 @@ -/** - * 冒泡排序函数 - * aa bb cc - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - // 你的代码，使无序数组 a 变得有序 - for(int i = 0; i < n; i++) { - for(int j = 0; j < n - i - 1; j++) { - if(a[j] > a[j + 1]) { - int temp = a[j]; - a [j] = a[j + 1]; - a[j + 1] = temp; - } - } - } - - -} //end \ No newline at end of file diff --git a/codes/dishiliuge/.keep b/codes/dishiliuge/.keep deleted file mode 100644 index e69de29bb2d1d6434b8b29ae775ad8c2e48c5391..0000000000000000000000000000000000000000 diff --git a/codes/dishiliuge/15759149.java b/codes/dishiliuge/15759149.java deleted file mode 100644 index 6426772fb479b07ed3be21ef1867921d1dbb194c..0000000000000000000000000000000000000000 --- a/codes/dishiliuge/15759149.java +++ /dev/null @@ -1,20 +0,0 @@ -/** - * 冒泡排序函数 - * aa bb cc - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - // 你的代码，使无序数组 a 变得有序 - for(int i = 0; i < n; i++) { - for(int j = 0; j < n - i - 1; j++) { - if(a[j] > a[j + 1]) { - int temp = a[j]; - a [j] = a[j + 1]; - a[j + 1] = temp; - } - } - } - - -} //end \ No newline at end of file diff --git a/codes/dishiqige/.keep b/codes/dishiqige/.keep deleted file mode 100644 index e69de29bb2d1d6434b8b29ae775ad8c2e48c5391..0000000000000000000000000000000000000000 diff --git a/codes/dishiqige/15759140.java b/codes/dishiqige/15759140.java deleted file mode 100644 index 6426772fb479b07ed3be21ef1867921d1dbb194c..0000000000000000000000000000000000000000 --- a/codes/dishiqige/15759140.java +++ /dev/null @@ -1,20 +0,0 @@ -/** - * 冒泡排序函数 - * aa bb cc - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - // 你的代码，使无序数组 a 变得有序 - for(int i = 0; i < n; i++) { - for(int j = 0; j < n - i - 1; j++) { - if(a[j] > a[j + 1]) { - int temp = a[j]; - a [j] = a[j + 1]; - a[j + 1] = temp; - } - } - } - - -} //end \ No newline at end of file diff --git a/codes/dishisi/.keep b/codes/dishisi/.keep deleted file mode 100644 index e69de29bb2d1d6434b8b29ae775ad8c2e48c5391..0000000000000000000000000000000000000000 diff --git a/codes/dishisi/15758975.java b/codes/dishisi/15758975.java deleted file mode 100644 index 6426772fb479b07ed3be21ef1867921d1dbb194c..0000000000000000000000000000000000000000 --- a/codes/dishisi/15758975.java +++ /dev/null @@ -1,20 +0,0 @@ -/** - * 冒泡排序函数 - * aa bb cc - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - // 你的代码，使无序数组 a 变得有序 - for(int i = 0; i < n; i++) { - for(int j = 0; j < n - i - 1; j++) { - if(a[j] > a[j + 1]) { - int temp = a[j]; - a [j] = a[j + 1]; - a[j + 1] = temp; - } - } - } - - -} //end \ No newline at end of file diff --git a/codes/dishissange/.keep b/codes/dishissange/.keep deleted file mode 100644 index e69de29bb2d1d6434b8b29ae775ad8c2e48c5391..0000000000000000000000000000000000000000 diff --git a/codes/dishissange/15759022.java b/codes/dishissange/15759022.java deleted file mode 100644 index 6426772fb479b07ed3be21ef1867921d1dbb194c..0000000000000000000000000000000000000000 --- a/codes/dishissange/15759022.java +++ /dev/null @@ -1,20 +0,0 @@ -/** - * 冒泡排序函数 - * aa bb cc - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - // 你的代码，使无序数组 a 变得有序 - for(int i = 0; i < n; i++) { - for(int j = 0; j < n - i - 1; j++) { - if(a[j] > a[j + 1]) { - int temp = a[j]; - a [j] = a[j + 1]; - a[j + 1] = temp; - } - } - } - - -} //end \ No newline at end of file diff --git a/codes/dishiwuge/.keep b/codes/dishiwuge/.keep deleted file mode 100644 index e69de29bb2d1d6434b8b29ae775ad8c2e48c5391..0000000000000000000000000000000000000000 diff --git a/codes/dishiwuge/15759050.java b/codes/dishiwuge/15759050.java deleted file mode 100644 index 6426772fb479b07ed3be21ef1867921d1dbb194c..0000000000000000000000000000000000000000 --- a/codes/dishiwuge/15759050.java +++ /dev/null @@ -1,20 +0,0 @@ -/** - * 冒泡排序函数 - * aa bb cc - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - // 你的代码，使无序数组 a 变得有序 - for(int i = 0; i < n; i++) { - for(int j = 0; j < n - i - 1; j++) { - if(a[j] > a[j + 1]) { - int temp = a[j]; - a [j] = a[j + 1]; - a[j + 1] = temp; - } - } - } - - -} //end \ No newline at end of file diff --git a/codes/dist11/15779201.java b/codes/dist11/15779201.java deleted file mode 100644 index 9b5ae978ad5bd6ab8b8051aac036ab32ba4981bb..0000000000000000000000000000000000000000 --- a/codes/dist11/15779201.java +++ /dev/null @@ -1,17 +0,0 @@ -/** - * 冒泡排序函数 - * 通过相邻元素比较和交换，将无序数组变为有序数组 - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - for (int i = 0; i < n - 1; i++) { // 外层循环，控制排序趟数 - for (int j = 0; j < n - i - 1; j++) { // 内层循环，进行相邻元素比较和交换 - if (a[j] > a[j + 1]) { // 如果前一个元素比后一个元素大，则交换它们 - int temp = a[j]; // 临时变量，用于交换 - a[j] = a[j + 1]; - a[j + 1] = temp; - } - } - } -} //end diff --git a/codes/dist22/15779370.java b/codes/dist22/15779370.java deleted file mode 100644 index 9b5ae978ad5bd6ab8b8051aac036ab32ba4981bb..0000000000000000000000000000000000000000 --- a/codes/dist22/15779370.java +++ /dev/null @@ -1,17 +0,0 @@ -/** - * 冒泡排序函数 - * 通过相邻元素比较和交换，将无序数组变为有序数组 - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - for (int i = 0; i < n - 1; i++) { // 外层循环，控制排序趟数 - for (int j = 0; j < n - i - 1; j++) { // 内层循环，进行相邻元素比较和交换 - if (a[j] > a[j + 1]) { // 如果前一个元素比后一个元素大，则交换它们 - int temp = a[j]; // 临时变量，用于交换 - a[j] = a[j + 1]; - a[j + 1] = temp; - } - } - } -} //end diff --git a/codes/dist33/15779447.java b/codes/dist33/15779447.java deleted file mode 100644 index 9b5ae978ad5bd6ab8b8051aac036ab32ba4981bb..0000000000000000000000000000000000000000 --- a/codes/dist33/15779447.java +++ /dev/null @@ -1,17 +0,0 @@ -/** - * 冒泡排序函数 - * 通过相邻元素比较和交换，将无序数组变为有序数组 - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - for (int i = 0; i < n - 1; i++) { // 外层循环，控制排序趟数 - for (int j = 0; j < n - i - 1; j++) { // 内层循环，进行相邻元素比较和交换 - if (a[j] > a[j + 1]) { // 如果前一个元素比后一个元素大，则交换它们 - int temp = a[j]; // 临时变量，用于交换 - a[j] = a[j + 1]; - a[j + 1] = temp; - } - } - } -} //end diff --git a/codes/dist55/15779566.java b/codes/dist55/15779566.java deleted file mode 100644 index 9b5ae978ad5bd6ab8b8051aac036ab32ba4981bb..0000000000000000000000000000000000000000 --- a/codes/dist55/15779566.java +++ /dev/null @@ -1,17 +0,0 @@ -/** - * 冒泡排序函数 - * 通过相邻元素比较和交换，将无序数组变为有序数组 - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - for (int i = 0; i < n - 1; i++) { // 外层循环，控制排序趟数 - for (int j = 0; j < n - i - 1; j++) { // 内层循环，进行相邻元素比较和交换 - if (a[j] > a[j + 1]) { // 如果前一个元素比后一个元素大，则交换它们 - int temp = a[j]; // 临时变量，用于交换 - a[j] = a[j + 1]; - a[j + 1] = temp; - } - } - } -} //end diff --git a/codes/dist66/15782518.java b/codes/dist66/15782518.java deleted file mode 100644 index 9b5ae978ad5bd6ab8b8051aac036ab32ba4981bb..0000000000000000000000000000000000000000 --- a/codes/dist66/15782518.java +++ /dev/null @@ -1,17 +0,0 @@ -/** - * 冒泡排序函数 - * 通过相邻元素比较和交换，将无序数组变为有序数组 - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - for (int i = 0; i < n - 1; i++) { // 外层循环，控制排序趟数 - for (int j = 0; j < n - i - 1; j++) { // 内层循环，进行相邻元素比较和交换 - if (a[j] > a[j + 1]) { // 如果前一个元素比后一个元素大，则交换它们 - int temp = a[j]; // 临时变量，用于交换 - a[j] = a[j + 1]; - a[j + 1] = temp; - } - } - } -} //end diff --git a/codes/dist77/15782715.java b/codes/dist77/15782715.java deleted file mode 100644 index 9b5ae978ad5bd6ab8b8051aac036ab32ba4981bb..0000000000000000000000000000000000000000 --- a/codes/dist77/15782715.java +++ /dev/null @@ -1,17 +0,0 @@ -/** - * 冒泡排序函数 - * 通过相邻元素比较和交换，将无序数组变为有序数组 - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - for (int i = 0; i < n - 1; i++) { // 外层循环，控制排序趟数 - for (int j = 0; j < n - i - 1; j++) { // 内层循环，进行相邻元素比较和交换 - if (a[j] > a[j + 1]) { // 如果前一个元素比后一个元素大，则交换它们 - int temp = a[j]; // 临时变量，用于交换 - a[j] = a[j + 1]; - a[j + 1] = temp; - } - } - } -} //end diff --git a/codes/dist88/15782777.java b/codes/dist88/15782777.java deleted file mode 100644 index 9b5ae978ad5bd6ab8b8051aac036ab32ba4981bb..0000000000000000000000000000000000000000 --- a/codes/dist88/15782777.java +++ /dev/null @@ -1,17 +0,0 @@ -/** - * 冒泡排序函数 - * 通过相邻元素比较和交换，将无序数组变为有序数组 - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - for (int i = 0; i < n - 1; i++) { // 外层循环，控制排序趟数 - for (int j = 0; j < n - i - 1; j++) { // 内层循环，进行相邻元素比较和交换 - if (a[j] > a[j + 1]) { // 如果前一个元素比后一个元素大，则交换它们 - int temp = a[j]; // 临时变量，用于交换 - a[j] = a[j + 1]; - a[j + 1] = temp; - } - } - } -} //end diff --git a/codes/dist99/15782896.java b/codes/dist99/15782896.java deleted file mode 100644 index 9b5ae978ad5bd6ab8b8051aac036ab32ba4981bb..0000000000000000000000000000000000000000 --- a/codes/dist99/15782896.java +++ /dev/null @@ -1,17 +0,0 @@ -/** - * 冒泡排序函数 - * 通过相邻元素比较和交换，将无序数组变为有序数组 - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - for (int i = 0; i < n - 1; i++) { // 外层循环，控制排序趟数 - for (int j = 0; j < n - i - 1; j++) { // 内层循环，进行相邻元素比较和交换 - if (a[j] > a[j + 1]) { // 如果前一个元素比后一个元素大，则交换它们 - int temp = a[j]; // 临时变量，用于交换 - a[j] = a[j + 1]; - a[j + 1] = temp; - } - } - } -} //end diff --git a/codes/diudiuge12262792/15499955.java b/codes/diudiuge12262792/15499955.java deleted file mode 100644 index 68edfbccbb546b67f699c1e200d26c82a9e1f941..0000000000000000000000000000000000000000 --- a/codes/diudiuge12262792/15499955.java +++ /dev/null @@ -1,26 +0,0 @@ -/** - * 冒泡排序函数 - * aa bb cc - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int[] a, int n) { - for (int i = 0; i < n; i++) { - boolean swapped = false; - - for (int j = 0; j < n - i - 1; j++) { - if (a[j] > a[j + 1]) { - int temp = a[j]; - a[j] = a[j + 1]; - a[j + 1] = temp; - - swapped = true; - } - } - - // 如果在整个内部循环中都没有交换，则数组已经是排序好的 - if (!swapped) { - break; - } - } -} //end diff --git a/codes/dkptlv/15520718.java b/codes/dkptlv/15520718.java deleted file mode 100644 index 854beb62bfcf4ead3549d682ffca7f1b9f32d947..0000000000000000000000000000000000000000 --- a/codes/dkptlv/15520718.java +++ /dev/null @@ -1,19 +0,0 @@ -/** - * 冒泡排序函数 - * aa bb cc - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - for(int i = 0; i < n-1 ; i++){ - for (int j = 0;j < n-1-i;j++){ - if(a[j] > a[j+1]){ - int temp = a[j]; - a[j] = a[j+1]; - a[j+1] = temp; - } - } - } - -} //end - diff --git a/codes/dmw681/16541740.java b/codes/dmw681/16541740.java deleted file mode 100644 index 0eb45e47a15abe28083210769484f1855e581b01..0000000000000000000000000000000000000000 --- a/codes/dmw681/16541740.java +++ /dev/null @@ -1,20 +0,0 @@ -/** - * 冒泡排序函数 - * aa bb cc - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - // 你的代码，使无序数组 a 变得有序 - for(int i=0; ia[j]) { - int temp = a[i]; - a[i] = a[j]; - a[j] = temp; - } - } - } - - -} //end diff --git a/codes/dogepalm/.keep b/codes/dogepalm/.keep deleted file mode 100644 index e69de29bb2d1d6434b8b29ae775ad8c2e48c5391..0000000000000000000000000000000000000000 diff --git a/codes/dogepalm/15845073.java b/codes/dogepalm/15845073.java deleted file mode 100644 index 6e9861fa3ec6d5a2553cdccd1bb1e977430c671b..0000000000000000000000000000000000000000 --- a/codes/dogepalm/15845073.java +++ /dev/null @@ -1,19 +0,0 @@ -/** - * 冒泡排序函数 - * aa bb cc - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - // 你的代码，使无序数组 a 变得有序 - for (int i = 0; i < n - 1; i++) { - for (int j = 0; j < n - i - 1; j++) { - if (a[j] > a[j + 1]) { - - int temp = a[j]; - a[j] = a[j + 1]; - a[j + 1] = temp; - } - } - } -} //end \ No newline at end of file diff --git a/codes/downsider/.keep b/codes/downsider/.keep deleted file mode 100644 index e69de29bb2d1d6434b8b29ae775ad8c2e48c5391..0000000000000000000000000000000000000000 diff --git a/codes/downsider/15814998.java b/codes/downsider/15814998.java deleted file mode 100644 index 6e9861fa3ec6d5a2553cdccd1bb1e977430c671b..0000000000000000000000000000000000000000 --- a/codes/downsider/15814998.java +++ /dev/null @@ -1,19 +0,0 @@ -/** - * 冒泡排序函数 - * aa bb cc - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - // 你的代码，使无序数组 a 变得有序 - for (int i = 0; i < n - 1; i++) { - for (int j = 0; j < n - i - 1; j++) { - if (a[j] > a[j + 1]) { - - int temp = a[j]; - a[j] = a[j + 1]; - a[j + 1] = temp; - } - } - } -} //end \ No newline at end of file diff --git a/codes/dragg123/15718958.java b/codes/dragg123/15718958.java deleted file mode 100644 index 987377810b5beca8eb4bf5eafeee5db45e234a87..0000000000000000000000000000000000000000 --- a/codes/dragg123/15718958.java +++ /dev/null @@ -1,20 +0,0 @@ -/** - * 冒泡排序函数 - * aa bb cc - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - // 你的代码，使无序数组 a 变得有序 - for(int i = 0; i < n; i++) { - for(int liuy = 0; liuy < n - i - 1; liuy++) { - if(a[liuy] > a[liuy + 1]) { - int temp = a[liuy]; - a [liuy] = a[liuy + 1]; - a[liuy + 1] = temp; - } - } - } - - -} //end,liuy diff --git a/codes/dragonir/11357510.java b/codes/dragonir/11357510.java deleted file mode 100644 index 4d7083fe05ce3e6d3fadd59d6d55e2cbc50d546d..0000000000000000000000000000000000000000 --- a/codes/dragonir/11357510.java +++ /dev/null @@ -1,22 +0,0 @@ -/** - * 冒泡排序函数 - * aa bb cc - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - // 你的代码，使无序数组 a 变得有序 - int i, j; - - for(i=0; ia[j]){ - int temp; - temp = a[j-1]; - a[j-1] = a[j]; - a[j] = temp; - } - } - } - -} //end \ No newline at end of file diff --git a/codes/dsfggsd445/.keep b/codes/dsfggsd445/.keep deleted file mode 100644 index e69de29bb2d1d6434b8b29ae775ad8c2e48c5391..0000000000000000000000000000000000000000 diff --git a/codes/dsfggsd445/15828546.java b/codes/dsfggsd445/15828546.java deleted file mode 100644 index 6e9861fa3ec6d5a2553cdccd1bb1e977430c671b..0000000000000000000000000000000000000000 --- a/codes/dsfggsd445/15828546.java +++ /dev/null @@ -1,19 +0,0 @@ -/** - * 冒泡排序函数 - * aa bb cc - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - // 你的代码，使无序数组 a 变得有序 - for (int i = 0; i < n - 1; i++) { - for (int j = 0; j < n - i - 1; j++) { - if (a[j] > a[j + 1]) { - - int temp = a[j]; - a[j] = a[j + 1]; - a[j + 1] = temp; - } - } - } -} //end \ No newline at end of file diff --git a/codes/dsfsqerada33/.keep b/codes/dsfsqerada33/.keep deleted file mode 100644 index e69de29bb2d1d6434b8b29ae775ad8c2e48c5391..0000000000000000000000000000000000000000 diff --git a/codes/dsfsqerada33/15743351.java b/codes/dsfsqerada33/15743351.java deleted file mode 100644 index 6e9861fa3ec6d5a2553cdccd1bb1e977430c671b..0000000000000000000000000000000000000000 --- a/codes/dsfsqerada33/15743351.java +++ /dev/null @@ -1,19 +0,0 @@ -/** - * 冒泡排序函数 - * aa bb cc - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - // 你的代码，使无序数组 a 变得有序 - for (int i = 0; i < n - 1; i++) { - for (int j = 0; j < n - i - 1; j++) { - if (a[j] > a[j + 1]) { - - int temp = a[j]; - a[j] = a[j + 1]; - a[j + 1] = temp; - } - } - } -} //end \ No newline at end of file diff --git a/codes/duanshusheng/15508667.java b/codes/duanshusheng/15508667.java deleted file mode 100644 index cea168b5c054cacc07ac29bad448fc0d73b21ff8..0000000000000000000000000000000000000000 --- a/codes/duanshusheng/15508667.java +++ /dev/null @@ -1,17 +0,0 @@ -/** - * 冒泡排序函数 - * aa bb cc - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - for (int i = 0; i < n; i++) { - for (int j = i + 1; j < n; j++) { - if (a[i] > a[j]) { - int temp = a[i]; - a[i] = a[j]; - a[j] = temp; - } - } - } -} //end \ No newline at end of file diff --git a/codes/duanxintao/15684621.java b/codes/duanxintao/15684621.java deleted file mode 100644 index be1beed5543eb5e66db4e4e5a75da8787a3973d3..0000000000000000000000000000000000000000 --- a/codes/duanxintao/15684621.java +++ /dev/null @@ -1,22 +0,0 @@ -/** - * 冒泡排序函数 - * 通过相邻元素两两比较，将较大的元素交换到数组的末尾， - * 重复这个过程直到整个数组变得有序。 - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int[] a, int n) { - // 外层循环控制排序趟数 - for (int i = 0; i < n - 1; i++) { - // 内层循环控制每一趟排序多少次 - for (int j = 0; j < n - 1 - i; j++) { - // 如果前一个元素比后一个元素大，则交换它们的位置 - if (a[j] > a[j + 1]) { - // 交换 a[j] 和 a[j+1] - int temp = a[j]; - a[j] = a[j + 1]; - a[j + 1] = temp; - } - } - } -} //end diff --git a/codes/duixiang/.keep b/codes/duixiang/.keep deleted file mode 100644 index e69de29bb2d1d6434b8b29ae775ad8c2e48c5391..0000000000000000000000000000000000000000 diff --git a/codes/duixiang/15814647.java b/codes/duixiang/15814647.java deleted file mode 100644 index 6426772fb479b07ed3be21ef1867921d1dbb194c..0000000000000000000000000000000000000000 --- a/codes/duixiang/15814647.java +++ /dev/null @@ -1,20 +0,0 @@ -/** - * 冒泡排序函数 - * aa bb cc - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - // 你的代码，使无序数组 a 变得有序 - for(int i = 0; i < n; i++) { - for(int j = 0; j < n - i - 1; j++) { - if(a[j] > a[j + 1]) { - int temp = a[j]; - a [j] = a[j + 1]; - a[j + 1] = temp; - } - } - } - - -} //end \ No newline at end of file diff --git a/codes/dulong/11749087.java b/codes/dulong/11749087.java deleted file mode 100644 index 1462d26235b024a7f108828a86ad58006771f6ff..0000000000000000000000000000000000000000 --- a/codes/dulong/11749087.java +++ /dev/null @@ -1,21 +0,0 @@ -/** - * 冒泡排序函数 - * aa bb cc - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int[] a, int n) { - if (n <= 1) return; - for (int i = 0; i < n; ++i) { - boolean flag = false; - for (int j = 0; j < n - i - 1; ++j) { - if (a[j] > a[j+1]) { - int tmp = a[j]; - a[j] = a[j+1]; - a[j+1] = tmp; - flag = true; - } - } - if (!flag) break; - } -} //end diff --git a/codes/dundun/15861800.java b/codes/dundun/15861800.java deleted file mode 100644 index 54c5f3869cd16ee9e7c2b77895a39fae63f05dbc..0000000000000000000000000000000000000000 --- a/codes/dundun/15861800.java +++ /dev/null @@ -1,20 +0,0 @@ -/** - * 冒泡排序函数 - * aa bb cc - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - // 你的代码，使无序数组 a 变得有序 - for(int i = 0; i < n; i++) { - for(int liuy = 0; liuy < n - i - 1; liuy++) { - if(a[liuy] > a[liuy + 1]) { - int temp = a[liuy]; - a [liuy] = a[liuy + 1]; - a[liuy + 1] = temp; - } - } - } - - -} //end,liuy \ No newline at end of file diff --git a/codes/duoduo172/15759065.java b/codes/duoduo172/15759065.java deleted file mode 100644 index 76cbddd876f8669466e0a2651682cee667741713..0000000000000000000000000000000000000000 --- a/codes/duoduo172/15759065.java +++ /dev/null @@ -1,20 +0,0 @@ -/** - * 冒泡排序函数 - * aa bb cc - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - // 你的代码，使无序数组 a 变得有序 - for(int i = 0; i < n; i++) { - for(int b = 0; b < n - i - 1; b++) { - if(a[b] > a[b + 1]) { - int temp = a[b]; - a [b] = a[b + 1]; - a[b + 1] = temp; - } - } - } - - -} //end diff --git a/codes/duzidundun/15860749.java b/codes/duzidundun/15860749.java deleted file mode 100644 index 54c5f3869cd16ee9e7c2b77895a39fae63f05dbc..0000000000000000000000000000000000000000 --- a/codes/duzidundun/15860749.java +++ /dev/null @@ -1,20 +0,0 @@ -/** - * 冒泡排序函数 - * aa bb cc - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - // 你的代码，使无序数组 a 变得有序 - for(int i = 0; i < n; i++) { - for(int liuy = 0; liuy < n - i - 1; liuy++) { - if(a[liuy] > a[liuy + 1]) { - int temp = a[liuy]; - a [liuy] = a[liuy + 1]; - a[liuy + 1] = temp; - } - } - } - - -} //end,liuy \ No newline at end of file diff --git a/codes/duziteng/10968772.java b/codes/duziteng/10968772.java deleted file mode 100644 index ab3d8f390cfa4cee1947d39872e75bac48b3058a..0000000000000000000000000000000000000000 --- a/codes/duziteng/10968772.java +++ /dev/null @@ -1,11 +0,0 @@ -public static void bubbleSort(int [] a, int n) { - for (int i=0 ; ia[j+1]) { - int temp=a[j]; - a[j]=a[j+1]; - a[j+1]=temp; - } - } - } -} diff --git a/codes/dxr13146640122/15867024.java b/codes/dxr13146640122/15867024.java deleted file mode 100644 index 24f513b3219ac31ac3dcffe774647aa7bfdac254..0000000000000000000000000000000000000000 --- a/codes/dxr13146640122/15867024.java +++ /dev/null @@ -1,11 +0,0 @@ -public static void bubbleSort(int [] a, int n){ - for (int i = 0; i < n - 1; i++) { - for (int j = 0; j < n - 1 - i; j++) { - if (a[j] > a[j + 1]) { - int temp = a[j]; - a[j] = a[j + 1]; - a[j + 1] = temp; - } - } - } -} diff --git a/codes/dxy18882636878/15829939.java b/codes/dxy18882636878/15829939.java deleted file mode 100644 index ce045dc0ec47c9f59627ca0c133a89bcad127bba..0000000000000000000000000000000000000000 --- a/codes/dxy18882636878/15829939.java +++ /dev/null @@ -1,11 +0,0 @@ -public static void bubbleSort(int []a,int n){ - for(int i=0;ia[j+1]){ - int temp = a[j]; - a[j]=a[j+1]; - a[j+1]=temp; - } - } - } -} diff --git a/codes/ebb29bbe/9945255.java b/codes/ebb29bbe/9945255.java deleted file mode 100644 index f5658b7b8e7bc0be374b18ce85459f2f58c5bc6b..0000000000000000000000000000000000000000 --- a/codes/ebb29bbe/9945255.java +++ /dev/null @@ -1,19 +0,0 @@ -/** - * 冒泡排序函数 - * aa bb cc - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - // 你的代码，使无序数组 a 变得有序 - for(int i = 0 ; i < n - 1 ; i++){ - for(int j = 0 ; j < n - 1 - i ; j++){ - if(a[j] > a[j + 1]){ - int temp = a[j]; - a[j] = a[j + 1]; - a[j + 1] = temp; - } - } - } - -} //end diff --git a/codes/educ157441/.keep b/codes/educ157441/.keep deleted file mode 100644 index e69de29bb2d1d6434b8b29ae775ad8c2e48c5391..0000000000000000000000000000000000000000 diff --git a/codes/educ157441/15842827.java b/codes/educ157441/15842827.java deleted file mode 100644 index 6e9861fa3ec6d5a2553cdccd1bb1e977430c671b..0000000000000000000000000000000000000000 --- a/codes/educ157441/15842827.java +++ /dev/null @@ -1,19 +0,0 @@ -/** - * 冒泡排序函数 - * aa bb cc - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - // 你的代码，使无序数组 a 变得有序 - for (int i = 0; i < n - 1; i++) { - for (int j = 0; j < n - i - 1; j++) { - if (a[j] > a[j + 1]) { - - int temp = a[j]; - a[j] = a[j + 1]; - a[j + 1] = temp; - } - } - } -} //end \ No newline at end of file diff --git a/codes/ee858882845/15848149.java b/codes/ee858882845/15848149.java deleted file mode 100644 index 809e6c454de4e33d540c35a26f34e2679a08693a..0000000000000000000000000000000000000000 --- a/codes/ee858882845/15848149.java +++ /dev/null @@ -1,18 +0,0 @@ -/** - * 冒泡排序函数 - * 通过相邻元素两两比较和交换，使得每一轮循环后最大（或最小）的元素“冒泡”到数组的末尾。 - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int[] a, int n) { - for (int i = 0; i < n - 1; i++) { // 外层循环控制比较轮数 - for (int j = 0; j < n - 1 - i; j++) { // 内层循环控制每轮比较的次数 - if (a[j] > a[j + 1]) { // 如果当前元素大于下一个元素，则交换它们的位置 - // 交换 a[j] 和 a[j + 1] - int temp = a[j]; - a[j] = a[j + 1]; - a[j + 1] = temp; - } - } - } -} //end diff --git a/codes/eedd22/15875744.java b/codes/eedd22/15875744.java deleted file mode 100644 index 987377810b5beca8eb4bf5eafeee5db45e234a87..0000000000000000000000000000000000000000 --- a/codes/eedd22/15875744.java +++ /dev/null @@ -1,20 +0,0 @@ -/** - * 冒泡排序函数 - * aa bb cc - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - // 你的代码，使无序数组 a 变得有序 - for(int i = 0; i < n; i++) { - for(int liuy = 0; liuy < n - i - 1; liuy++) { - if(a[liuy] > a[liuy + 1]) { - int temp = a[liuy]; - a [liuy] = a[liuy + 1]; - a[liuy + 1] = temp; - } - } - } - - -} //end,liuy diff --git a/codes/ekdher/11188020.java b/codes/ekdher/11188020.java deleted file mode 100644 index cdabc2e0876ad629e41ff055727cf3af34be8917..0000000000000000000000000000000000000000 --- a/codes/ekdher/11188020.java +++ /dev/null @@ -1,20 +0,0 @@ -/** - * 冒泡排序函数 - * aa bb cc - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - // 你的代码，使无序数组 a 变得有序 - for (int i = 0; i < n; i++) { - for (int j = i + 1; j < n; j++) { - if (a[i] > a[j]) { - int temp = a[j]; - a[j] = a[i]; - a[i] = temp; - - } - } - } - -} //end \ No newline at end of file diff --git a/codes/ekwwu1/11122460.java b/codes/ekwwu1/11122460.java deleted file mode 100644 index cdabc2e0876ad629e41ff055727cf3af34be8917..0000000000000000000000000000000000000000 --- a/codes/ekwwu1/11122460.java +++ /dev/null @@ -1,20 +0,0 @@ -/** - * 冒泡排序函数 - * aa bb cc - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - // 你的代码，使无序数组 a 变得有序 - for (int i = 0; i < n; i++) { - for (int j = i + 1; j < n; j++) { - if (a[i] > a[j]) { - int temp = a[j]; - a[j] = a[i]; - a[i] = temp; - - } - } - } - -} //end \ No newline at end of file diff --git a/codes/enRENE1/11005023.java b/codes/enRENE1/11005023.java deleted file mode 100644 index b9bf7818d9ffdce1bf2bd0863a51890bffa3f951..0000000000000000000000000000000000000000 --- a/codes/enRENE1/11005023.java +++ /dev/null @@ -1,11 +0,0 @@ -public static void bubbleSort(int [] a, int n) { - for (int i=0 ; ia[j+1]) { - int temp=a[j]; - a[j]=a[j+1]; - a[j+1]=temp; - } - } - } -} \ No newline at end of file diff --git a/codes/enkilee/15372338.java b/codes/enkilee/15372338.java deleted file mode 100644 index c2afaa2414da1853e4500b02c6de9068b64aeafe..0000000000000000000000000000000000000000 --- a/codes/enkilee/15372338.java +++ /dev/null @@ -1,18 +0,0 @@ -/** - * 冒泡排序函数 - * aa bb cc - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - for(int i = 0; i < n-1 ; i++){ - for (int j = 0;j < n-1-i;j++){ - if(a[j] > a[j+1]){ - int temp = a[j]; - a[j] = a[j+1]; - a[j+1] = temp; - } - } - } - -} //end diff --git a/codes/enoughisenough/11364587.java b/codes/enoughisenough/11364587.java deleted file mode 100644 index 272a12fc81d3dd0e857bba9ae001c15818fb7123..0000000000000000000000000000000000000000 --- a/codes/enoughisenough/11364587.java +++ /dev/null @@ -1,18 +0,0 @@ - /** - * 冒泡排序函数 - * aa bb cc - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ - public static void bubbleSort(int [] arr, int n){ - // 你的代码，使无序数组 a 变得有序 - for (int i = 0; i < n; i++) { - for (int j = (i + 1); j < n; j++) { - if (arr[i] > arr[j]) { - int temp = arr[i]; - arr[i] = arr[j]; - arr[j] = temp; - } - } - } - } //end \ No newline at end of file diff --git a/codes/ergeren/.keep b/codes/ergeren/.keep deleted file mode 100644 index e69de29bb2d1d6434b8b29ae775ad8c2e48c5391..0000000000000000000000000000000000000000 diff --git a/codes/ergeren/15799133.java b/codes/ergeren/15799133.java deleted file mode 100644 index 6426772fb479b07ed3be21ef1867921d1dbb194c..0000000000000000000000000000000000000000 --- a/codes/ergeren/15799133.java +++ /dev/null @@ -1,20 +0,0 @@ -/** - * 冒泡排序函数 - * aa bb cc - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - // 你的代码，使无序数组 a 变得有序 - for(int i = 0; i < n; i++) { - for(int j = 0; j < n - i - 1; j++) { - if(a[j] > a[j + 1]) { - int temp = a[j]; - a [j] = a[j + 1]; - a[j + 1] = temp; - } - } - } - - -} //end \ No newline at end of file diff --git a/codes/ericxu/16282084.java b/codes/ericxu/16282084.java deleted file mode 100644 index c30cb33d594c1d228d24ba101ff8184e6a8d3866..0000000000000000000000000000000000000000 --- a/codes/ericxu/16282084.java +++ /dev/null @@ -1,21 +0,0 @@ -/** - * 冒泡排序函数 - * aa bb cc - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - // 你的代码，使无序数组 a 变得有序 - for (int i = 0; i < n - 1; i++) { - for (int j = 0; j < n - 1 - i; j++) { - //将前一个比后一个大的两元素进行交换 - if (a[j] > a[j + 1]) { - int tmp = a[j]; - a[j] = a[j + 1]; - a[j + 1] = tmp; - } - } - } - - -} //end diff --git a/codes/ewrt3425sdfs/.keep b/codes/ewrt3425sdfs/.keep deleted file mode 100644 index e69de29bb2d1d6434b8b29ae775ad8c2e48c5391..0000000000000000000000000000000000000000 diff --git a/codes/ewrt3425sdfs/15831329.java b/codes/ewrt3425sdfs/15831329.java deleted file mode 100644 index 6e9861fa3ec6d5a2553cdccd1bb1e977430c671b..0000000000000000000000000000000000000000 --- a/codes/ewrt3425sdfs/15831329.java +++ /dev/null @@ -1,19 +0,0 @@ -/** - * 冒泡排序函数 - * aa bb cc - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - // 你的代码，使无序数组 a 变得有序 - for (int i = 0; i < n - 1; i++) { - for (int j = 0; j < n - i - 1; j++) { - if (a[j] > a[j + 1]) { - - int temp = a[j]; - a[j] = a[j + 1]; - a[j + 1] = temp; - } - } - } -} //end \ No newline at end of file diff --git a/codes/express77/15513152.java b/codes/express77/15513152.java deleted file mode 100644 index 20575dc4ccc75a5bf6af9ea4614fcfa2a84fdeaf..0000000000000000000000000000000000000000 --- a/codes/express77/15513152.java +++ /dev/null @@ -1,19 +0,0 @@ -/** - * 冒泡排序函数 - * aa bb cc - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - // 你的代码，使无序数组 a 变得有序 - for (int i = 0; i < n - 1; i++) { - for (int j = 0; j < n - i - 1; j++) { - if (a[j] > a[j + 1]) { - // 交换元素 - int temp = a[j]; - a[j] = a[j + 1]; - a[j + 1] = temp; - } - } - } -} //end diff --git a/codes/ezh3wx95/11002373.java b/codes/ezh3wx95/11002373.java deleted file mode 100644 index 823354248ac46c3e3650f1c6dd3e0d62c7ad26cd..0000000000000000000000000000000000000000 --- a/codes/ezh3wx95/11002373.java +++ /dev/null @@ -1,17 +0,0 @@ -/** - * 冒泡排序函数 - * aa bb cc - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a,int n){ - for(int i = 0; i < n-1 ; i++){ - for (int j = 0;j < n-1-i;j++){ - if(a[j] > a[j+1]){ - int temp = a[j]; - a[j] = a[j+1]; - a[j+1] = temp; - } - } - } -} \ No newline at end of file diff --git a/codes/f13306939842/.keep b/codes/f13306939842/.keep deleted file mode 100644 index e69de29bb2d1d6434b8b29ae775ad8c2e48c5391..0000000000000000000000000000000000000000 diff --git a/codes/f13306939842/10968297.java b/codes/f13306939842/10968297.java deleted file mode 100644 index c5585035958ffe8f04cc6f835f294ea420c7c2aa..0000000000000000000000000000000000000000 --- a/codes/f13306939842/10968297.java +++ /dev/null @@ -1,11 +0,0 @@ -public static void bubbleSort(int [] a, int n) { -for (int i=0 ; ia[j+1]) { -int temp=a[j]; -a[j]=a[j+1]; -a[j+1]=temp; -} -} -} -} \ No newline at end of file diff --git a/codes/f18967940562/.keep b/codes/f18967940562/.keep deleted file mode 100644 index e69de29bb2d1d6434b8b29ae775ad8c2e48c5391..0000000000000000000000000000000000000000 diff --git a/codes/f18967940562/10972030.java b/codes/f18967940562/10972030.java deleted file mode 100644 index 9eccfac593dd84bb4c285d230d4de6b8c72a1d65..0000000000000000000000000000000000000000 --- a/codes/f18967940562/10972030.java +++ /dev/null @@ -1,11 +0,0 @@ -public static void bubbleSort(int [] a, int n) { - for (int i=0 ; ia[j+1]) { - int temp=a[j]; - a[j]=a[j+1]; - a[j+1]=temp; - } - } - } -} diff --git a/codes/f19555076671/15837167.java b/codes/f19555076671/15837167.java deleted file mode 100644 index 47e0d6efa8bfa49fe95c91537dccda0c09563b63..0000000000000000000000000000000000000000 --- a/codes/f19555076671/15837167.java +++ /dev/null @@ -1,18 +0,0 @@ -/** - * 冒泡排序函数 - * 功能：对数组进行升序排序 - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int[] a, int n) { - for (int i = 0; i < n - 1; i++) { // 遍历数组，从第一个元素到倒数第二个元素 - for (int j = 0; j < n - 1 - i; j++) { // 每次比较相邻的元素，最后一个元素已经是当前轮的最大值，无需再比较 - if (a[j] > a[j + 1]) { // 如果前一个元素大于后一个元素，则交换它们的位置 - // 交换 a[j] 和 a[j+1] - int temp = a[j]; - a[j] = a[j + 1]; - a[j + 1] = temp; - } - } - } -} // end diff --git a/codes/f370857894/.keep b/codes/f370857894/.keep deleted file mode 100644 index e69de29bb2d1d6434b8b29ae775ad8c2e48c5391..0000000000000000000000000000000000000000 diff --git a/codes/f370857894/10970517.java b/codes/f370857894/10970517.java deleted file mode 100644 index d5f586ad1c2f298d47266c7736708d19746c491a..0000000000000000000000000000000000000000 --- a/codes/f370857894/10970517.java +++ /dev/null @@ -1,11 +0,0 @@ -public static void bubbleSort(int [] b, int n) { - for (int i=0 ; ib[j+1]) { - int temp=b[j]; - b[j]=b[j+1]; - b[j+1]=temp; - } - } - } -} diff --git a/codes/f435wedt/.keep b/codes/f435wedt/.keep deleted file mode 100644 index e69de29bb2d1d6434b8b29ae775ad8c2e48c5391..0000000000000000000000000000000000000000 diff --git a/codes/f435wedt/15743453.java b/codes/f435wedt/15743453.java deleted file mode 100644 index 6e9861fa3ec6d5a2553cdccd1bb1e977430c671b..0000000000000000000000000000000000000000 --- a/codes/f435wedt/15743453.java +++ /dev/null @@ -1,19 +0,0 @@ -/** - * 冒泡排序函数 - * aa bb cc - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - // 你的代码，使无序数组 a 变得有序 - for (int i = 0; i < n - 1; i++) { - for (int j = 0; j < n - i - 1; j++) { - if (a[j] > a[j + 1]) { - - int temp = a[j]; - a[j] = a[j + 1]; - a[j + 1] = temp; - } - } - } -} //end \ No newline at end of file diff --git a/codes/f456af67654/.keep b/codes/f456af67654/.keep deleted file mode 100644 index e69de29bb2d1d6434b8b29ae775ad8c2e48c5391..0000000000000000000000000000000000000000 diff --git a/codes/f456af67654/15743470.java b/codes/f456af67654/15743470.java deleted file mode 100644 index 6e9861fa3ec6d5a2553cdccd1bb1e977430c671b..0000000000000000000000000000000000000000 --- a/codes/f456af67654/15743470.java +++ /dev/null @@ -1,19 +0,0 @@ -/** - * 冒泡排序函数 - * aa bb cc - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - // 你的代码，使无序数组 a 变得有序 - for (int i = 0; i < n - 1; i++) { - for (int j = 0; j < n - i - 1; j++) { - if (a[j] > a[j + 1]) { - - int temp = a[j]; - a[j] = a[j + 1]; - a[j + 1] = temp; - } - } - } -} //end \ No newline at end of file diff --git a/codes/f734tasaf/.keep b/codes/f734tasaf/.keep deleted file mode 100644 index e69de29bb2d1d6434b8b29ae775ad8c2e48c5391..0000000000000000000000000000000000000000 diff --git a/codes/f734tasaf/15743456.java b/codes/f734tasaf/15743456.java deleted file mode 100644 index 6e9861fa3ec6d5a2553cdccd1bb1e977430c671b..0000000000000000000000000000000000000000 --- a/codes/f734tasaf/15743456.java +++ /dev/null @@ -1,19 +0,0 @@ -/** - * 冒泡排序函数 - * aa bb cc - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - // 你的代码，使无序数组 a 变得有序 - for (int i = 0; i < n - 1; i++) { - for (int j = 0; j < n - i - 1; j++) { - if (a[j] > a[j + 1]) { - - int temp = a[j]; - a[j] = a[j + 1]; - a[j + 1] = temp; - } - } - } -} //end \ No newline at end of file diff --git a/codes/fangfangha/15775625.java b/codes/fangfangha/15775625.java deleted file mode 100644 index 987377810b5beca8eb4bf5eafeee5db45e234a87..0000000000000000000000000000000000000000 --- a/codes/fangfangha/15775625.java +++ /dev/null @@ -1,20 +0,0 @@ -/** - * 冒泡排序函数 - * aa bb cc - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - // 你的代码，使无序数组 a 变得有序 - for(int i = 0; i < n; i++) { - for(int liuy = 0; liuy < n - i - 1; liuy++) { - if(a[liuy] > a[liuy + 1]) { - int temp = a[liuy]; - a [liuy] = a[liuy + 1]; - a[liuy + 1] = temp; - } - } - } - - -} //end,liuy diff --git a/codes/fanghua/.keep b/codes/fanghua/.keep deleted file mode 100644 index e69de29bb2d1d6434b8b29ae775ad8c2e48c5391..0000000000000000000000000000000000000000 diff --git a/codes/fanghua/10971642.java b/codes/fanghua/10971642.java deleted file mode 100644 index 9eccfac593dd84bb4c285d230d4de6b8c72a1d65..0000000000000000000000000000000000000000 --- a/codes/fanghua/10971642.java +++ /dev/null @@ -1,11 +0,0 @@ -public static void bubbleSort(int [] a, int n) { - for (int i=0 ; ia[j+1]) { - int temp=a[j]; - a[j]=a[j+1]; - a[j+1]=temp; - } - } - } -} diff --git a/codes/fangqb/.keep b/codes/fangqb/.keep deleted file mode 100644 index e69de29bb2d1d6434b8b29ae775ad8c2e48c5391..0000000000000000000000000000000000000000 diff --git a/codes/fangqb/10043498.java b/codes/fangqb/10043498.java deleted file mode 100644 index 667eee0f585ec38ce639cb36d80df080e935946d..0000000000000000000000000000000000000000 --- a/codes/fangqb/10043498.java +++ /dev/null @@ -1,11 +0,0 @@ -public static void bubbleSort(int [] a,int n){ - for(int i = 0; i < n-1 ; i++){ - for (int j = 0;j < n-1-i;j++){ - if(a[j] > a[j+1]){ - int temp = a[j]; - a[j] = a[j+1]; - a[j+1] = temp; - } - } - } -} \ No newline at end of file diff --git a/codes/fangying1/.keep b/codes/fangying1/.keep deleted file mode 100644 index e69de29bb2d1d6434b8b29ae775ad8c2e48c5391..0000000000000000000000000000000000000000 diff --git a/codes/fangying1/10968297.java b/codes/fangying1/10968297.java deleted file mode 100644 index 1752b8cbc3fdd044b5ce59517f8f6e5b3348a88b..0000000000000000000000000000000000000000 --- a/codes/fangying1/10968297.java +++ /dev/null @@ -1,11 +0,0 @@ -public static void sortFunc(int [] a, int n) { -for (int i=0 ; ia[j+1]) { -int temp=a[j]; -a[j]=a[j+1]; -a[j+1]=temp; -} -} -} -} \ No newline at end of file diff --git a/codes/fasfaf227/.keep b/codes/fasfaf227/.keep deleted file mode 100644 index e69de29bb2d1d6434b8b29ae775ad8c2e48c5391..0000000000000000000000000000000000000000 diff --git a/codes/fasfaf227/15820189.java b/codes/fasfaf227/15820189.java deleted file mode 100644 index 6e9861fa3ec6d5a2553cdccd1bb1e977430c671b..0000000000000000000000000000000000000000 --- a/codes/fasfaf227/15820189.java +++ /dev/null @@ -1,19 +0,0 @@ -/** - * 冒泡排序函数 - * aa bb cc - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - // 你的代码，使无序数组 a 变得有序 - for (int i = 0; i < n - 1; i++) { - for (int j = 0; j < n - i - 1; j++) { - if (a[j] > a[j + 1]) { - - int temp = a[j]; - a[j] = a[j + 1]; - a[j + 1] = temp; - } - } - } -} //end \ No newline at end of file diff --git a/codes/fasfasfas234/.keep b/codes/fasfasfas234/.keep deleted file mode 100644 index e69de29bb2d1d6434b8b29ae775ad8c2e48c5391..0000000000000000000000000000000000000000 diff --git a/codes/fasfasfas234/15743358/15743358.java b/codes/fasfasfas234/15743358/15743358.java deleted file mode 100644 index 6e9861fa3ec6d5a2553cdccd1bb1e977430c671b..0000000000000000000000000000000000000000 --- a/codes/fasfasfas234/15743358/15743358.java +++ /dev/null @@ -1,19 +0,0 @@ -/** - * 冒泡排序函数 - * aa bb cc - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - // 你的代码，使无序数组 a 变得有序 - for (int i = 0; i < n - 1; i++) { - for (int j = 0; j < n - i - 1; j++) { - if (a[j] > a[j + 1]) { - - int temp = a[j]; - a[j] = a[j + 1]; - a[j + 1] = temp; - } - } - } -} //end \ No newline at end of file diff --git a/codes/fasfasfas234/15830971.java b/codes/fasfasfas234/15830971.java deleted file mode 100644 index 6e9861fa3ec6d5a2553cdccd1bb1e977430c671b..0000000000000000000000000000000000000000 --- a/codes/fasfasfas234/15830971.java +++ /dev/null @@ -1,19 +0,0 @@ -/** - * 冒泡排序函数 - * aa bb cc - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - // 你的代码，使无序数组 a 变得有序 - for (int i = 0; i < n - 1; i++) { - for (int j = 0; j < n - i - 1; j++) { - if (a[j] > a[j + 1]) { - - int temp = a[j]; - a[j] = a[j + 1]; - a[j + 1] = temp; - } - } - } -} //end \ No newline at end of file diff --git a/codes/fasfsa2412/.keep b/codes/fasfsa2412/.keep deleted file mode 100644 index e69de29bb2d1d6434b8b29ae775ad8c2e48c5391..0000000000000000000000000000000000000000 diff --git a/codes/fasfsa2412/15743474.java b/codes/fasfsa2412/15743474.java deleted file mode 100644 index 96508c1385b4a62859a2adea3c8dfae39051b7cd..0000000000000000000000000000000000000000 --- a/codes/fasfsa2412/15743474.java +++ /dev/null @@ -1,19 +0,0 @@ -/** - * 冒泡排序函数 - * aa bb cc - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - // 你的代码，使无序数组 a 变得有序 - for (int i = 0; i < n - 1; i++) { - for (int j = 0; j < n - i - 1; j++) { - if (a[j] > a[j + 1]) { - - int temp = a[j]; - a[j] = a[j + 1]; - a[j + 1] = temp; - } - } - } -} //end \ No newline at end of file diff --git a/codes/fasfsaf292/.keep b/codes/fasfsaf292/.keep deleted file mode 100644 index e69de29bb2d1d6434b8b29ae775ad8c2e48c5391..0000000000000000000000000000000000000000 diff --git a/codes/fasfsaf292/15743418.java b/codes/fasfsaf292/15743418.java deleted file mode 100644 index 6e9861fa3ec6d5a2553cdccd1bb1e977430c671b..0000000000000000000000000000000000000000 --- a/codes/fasfsaf292/15743418.java +++ /dev/null @@ -1,19 +0,0 @@ -/** - * 冒泡排序函数 - * aa bb cc - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - // 你的代码，使无序数组 a 变得有序 - for (int i = 0; i < n - 1; i++) { - for (int j = 0; j < n - i - 1; j++) { - if (a[j] > a[j + 1]) { - - int temp = a[j]; - a[j] = a[j + 1]; - a[j + 1] = temp; - } - } - } -} //end \ No newline at end of file diff --git a/codes/fasfsf2442/.keep b/codes/fasfsf2442/.keep deleted file mode 100644 index e69de29bb2d1d6434b8b29ae775ad8c2e48c5391..0000000000000000000000000000000000000000 diff --git a/codes/fasfsf2442/15831391.java b/codes/fasfsf2442/15831391.java deleted file mode 100644 index 6e9861fa3ec6d5a2553cdccd1bb1e977430c671b..0000000000000000000000000000000000000000 --- a/codes/fasfsf2442/15831391.java +++ /dev/null @@ -1,19 +0,0 @@ -/** - * 冒泡排序函数 - * aa bb cc - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - // 你的代码，使无序数组 a 变得有序 - for (int i = 0; i < n - 1; i++) { - for (int j = 0; j < n - i - 1; j++) { - if (a[j] > a[j + 1]) { - - int temp = a[j]; - a[j] = a[j + 1]; - a[j + 1] = temp; - } - } - } -} //end \ No newline at end of file diff --git a/codes/fasioc924/.keep b/codes/fasioc924/.keep deleted file mode 100644 index e69de29bb2d1d6434b8b29ae775ad8c2e48c5391..0000000000000000000000000000000000000000 diff --git a/codes/fasioc924/15743426.java b/codes/fasioc924/15743426.java deleted file mode 100644 index 6e9861fa3ec6d5a2553cdccd1bb1e977430c671b..0000000000000000000000000000000000000000 --- a/codes/fasioc924/15743426.java +++ /dev/null @@ -1,19 +0,0 @@ -/** - * 冒泡排序函数 - * aa bb cc - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - // 你的代码，使无序数组 a 变得有序 - for (int i = 0; i < n - 1; i++) { - for (int j = 0; j < n - i - 1; j++) { - if (a[j] > a[j + 1]) { - - int temp = a[j]; - a[j] = a[j + 1]; - a[j + 1] = temp; - } - } - } -} //end \ No newline at end of file diff --git a/codes/fasttiger/10143432.java b/codes/fasttiger/10143432.java deleted file mode 100644 index 93912216960266eb51f494e2a74a748085a12c4e..0000000000000000000000000000000000000000 --- a/codes/fasttiger/10143432.java +++ /dev/null @@ -1,23 +0,0 @@ -/** - * 冒泡排序函数 - * aa bb cc - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - if(a != null && a.length > 0){ - int l = a.length; - if(l > n){ - l = n; - } - for (int i = 0; i< l; i++){ - for (int j=0; j a[j+1]){ - int t = a[j]; - a[j] = a[j+1]; - a[j+1] = t; - } - } - } - } -} //end \ No newline at end of file diff --git a/codes/fcc321/15630159.java b/codes/fcc321/15630159.java deleted file mode 100644 index d7fbec1bd5b39dee2d383d4d20f8690284d526d4..0000000000000000000000000000000000000000 --- a/codes/fcc321/15630159.java +++ /dev/null @@ -1,18 +0,0 @@ -/** - * 冒泡排序函数 - * 对数组进行冒泡排序，将无序数组变为有序数组 - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int[] a, int n) { - for (int i = 0; i < n - 1; i++) { // 外层循环，控制需要排序的趟数 - for (int j = 0; j < n - 1 - i; j++) { // 内层循环，从前往后依次比较相邻的两个元素 - if (a[j] > a[j + 1]) { // 如果前一个元素比后一个元素大，则交换它们的位置 - // 交换 a[j] 和 a[j+1] - int temp = a[j]; - a[j] = a[j + 1]; - a[j + 1] = temp; - } - } - } -} // end diff --git a/codes/feifeixi/15846547.java b/codes/feifeixi/15846547.java deleted file mode 100644 index 987377810b5beca8eb4bf5eafeee5db45e234a87..0000000000000000000000000000000000000000 --- a/codes/feifeixi/15846547.java +++ /dev/null @@ -1,20 +0,0 @@ -/** - * 冒泡排序函数 - * aa bb cc - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - // 你的代码，使无序数组 a 变得有序 - for(int i = 0; i < n; i++) { - for(int liuy = 0; liuy < n - i - 1; liuy++) { - if(a[liuy] > a[liuy + 1]) { - int temp = a[liuy]; - a [liuy] = a[liuy + 1]; - a[liuy + 1] = temp; - } - } - } - - -} //end,liuy diff --git a/codes/feihudui/.keep b/codes/feihudui/.keep deleted file mode 100644 index e69de29bb2d1d6434b8b29ae775ad8c2e48c5391..0000000000000000000000000000000000000000 diff --git a/codes/feihudui/15846656.java b/codes/feihudui/15846656.java deleted file mode 100644 index 6426772fb479b07ed3be21ef1867921d1dbb194c..0000000000000000000000000000000000000000 --- a/codes/feihudui/15846656.java +++ /dev/null @@ -1,20 +0,0 @@ -/** - * 冒泡排序函数 - * aa bb cc - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - // 你的代码，使无序数组 a 变得有序 - for(int i = 0; i < n; i++) { - for(int j = 0; j < n - i - 1; j++) { - if(a[j] > a[j + 1]) { - int temp = a[j]; - a [j] = a[j + 1]; - a[j + 1] = temp; - } - } - } - - -} //end \ No newline at end of file diff --git a/codes/feipao/11252573.java b/codes/feipao/11252573.java deleted file mode 100644 index 24b49b4b1fd01d1f21be8b362a582158452e41d3..0000000000000000000000000000000000000000 --- a/codes/feipao/11252573.java +++ /dev/null @@ -1,19 +0,0 @@ -/** - * 冒泡排序函数 - * aa bb cc - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - // 你的代码，使无序数组 a 变得有序 - for(int i = 0 ; i < n - 1 ; i++){ - for(int j = 0 ; j < n - 1 - i ; j++){ - if(a[j] > a[j + 1]){ - int tmp = a[j]; - a[j] = a[j + 1]; - a[j + 1] = tmp; - } - } - } - -} //end \ No newline at end of file diff --git a/codes/feiya123/15719128.java b/codes/feiya123/15719128.java deleted file mode 100644 index 987377810b5beca8eb4bf5eafeee5db45e234a87..0000000000000000000000000000000000000000 --- a/codes/feiya123/15719128.java +++ /dev/null @@ -1,20 +0,0 @@ -/** - * 冒泡排序函数 - * aa bb cc - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - // 你的代码，使无序数组 a 变得有序 - for(int i = 0; i < n; i++) { - for(int liuy = 0; liuy < n - i - 1; liuy++) { - if(a[liuy] > a[liuy + 1]) { - int temp = a[liuy]; - a [liuy] = a[liuy + 1]; - a[liuy + 1] = temp; - } - } - } - - -} //end,liuy diff --git a/codes/fendou/15635967.java b/codes/fendou/15635967.java deleted file mode 100644 index fa7b3ff5555a00872225a421a281b11b145052d2..0000000000000000000000000000000000000000 --- a/codes/fendou/15635967.java +++ /dev/null @@ -1,17 +0,0 @@ -/** - * 冒泡排序函数 - * 将无序数组 a 按照从小到大的顺序进行排序 - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int[] a, int n) { - for (int i = 0; i < n - 1; i++) { // 外层循环控制排序趟数 - for (int j = 0; j < n - i - 1; j++) { // 内层循环控制每一趟排序多少次 - if (a[j] > a[j + 1]) { // 如果前一个元素大于后一个元素，则交换它们的位置 - int temp = a[j]; - a[j] = a[j + 1]; - a[j + 1] = temp; - } - } - } -} // end diff --git a/codes/feng666/15777226.java b/codes/feng666/15777226.java deleted file mode 100644 index fd29ee9751e3ce9e14043e1e185ec6f035affc03..0000000000000000000000000000000000000000 --- a/codes/feng666/15777226.java +++ /dev/null @@ -1,18 +0,0 @@ -/** - * 冒泡排序函数 - * 将无序数组通过冒泡排序变为有序数组 - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int[] a, int n) { - for (int i = 0; i < n - 1; i++) { // 外层循环，控制比较轮数 - for (int j = 0; j < n - 1 - i; j++) { // 内层循环，进行相邻元素比较 - if (a[j] > a[j + 1]) { // 如果前一个元素大于后一个元素，则交换它们 - // 交换 a[j] 和 a[j+1] - int temp = a[j]; - a[j] = a[j + 1]; - a[j + 1] = temp; - } - } - } -} // end diff --git a/codes/fengling/15838545.java b/codes/fengling/15838545.java deleted file mode 100644 index 47e0d6efa8bfa49fe95c91537dccda0c09563b63..0000000000000000000000000000000000000000 --- a/codes/fengling/15838545.java +++ /dev/null @@ -1,18 +0,0 @@ -/** - * 冒泡排序函数 - * 功能：对数组进行升序排序 - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int[] a, int n) { - for (int i = 0; i < n - 1; i++) { // 遍历数组，从第一个元素到倒数第二个元素 - for (int j = 0; j < n - 1 - i; j++) { // 每次比较相邻的元素，最后一个元素已经是当前轮的最大值，无需再比较 - if (a[j] > a[j + 1]) { // 如果前一个元素大于后一个元素，则交换它们的位置 - // 交换 a[j] 和 a[j+1] - int temp = a[j]; - a[j] = a[j + 1]; - a[j + 1] = temp; - } - } - } -} // end diff --git a/codes/fengshang/15510907.java b/codes/fengshang/15510907.java deleted file mode 100644 index c1da30053b9b0e7d4b084859edaf1c76a325fe66..0000000000000000000000000000000000000000 --- a/codes/fengshang/15510907.java +++ /dev/null @@ -1,17 +0,0 @@ -/** - * 冒泡排序函数 - * 通过不断比较相邻元素，将较大的元素交换到数组的末尾，经过n-1轮比较后，数组变得有序。 - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int[] a, int n) { - for (int i = 0; i < n - 1; i++) { // 外层循环控制需要比较的轮数 - for (int j = 0; j < n - i - 1; j++) { // 内层循环控制每轮比较的次数 - if (a[j] > a[j + 1]) { // 如果前一个元素大于后一个元素，则交换它们的位置 - int temp = a[j]; - a[j] = a[j + 1]; - a[j + 1] = temp; - } - } - } -} // end diff --git a/codes/fengshang/fengshang/15510907.java b/codes/fengshang/fengshang/15510907.java deleted file mode 100644 index 01fb16399d83d1c2a0e52c988214b4ea75463c6b..0000000000000000000000000000000000000000 --- a/codes/fengshang/fengshang/15510907.java +++ /dev/null @@ -1,17 +0,0 @@ -/** - * 冒泡排序函数 - * 通过不断比较相邻元素，将较大的元素交换到数组的末尾，经过n-1轮比较后，数组变得有序。 - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int[] a, int n) { - for (int i = 0; i < n - 1; i++) { // 外层循环控制需要比较的轮数 - for (int j = 0; j < n - i - 1; j++) { // 内层循环控制每轮比较的次数 - if (a[j] > a[j + 1]) { // 如果前一个元素大于后一个元素，则交换它们的位置 - int temp = a[j]; - a[j] = a[j + 1]; - a[j + 1] = temp; - } - } - } -} // end diff --git a/codes/fengyeorz/15629835.java b/codes/fengyeorz/15629835.java deleted file mode 100644 index fdf32e5cfc95a9f290221769990e4791c334e55f..0000000000000000000000000000000000000000 --- a/codes/fengyeorz/15629835.java +++ /dev/null @@ -1,26 +0,0 @@ -/** - * 冒泡排序函数 - * 该函数实现了冒泡排序算法，将数组a中的元素按升序排列 - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int[] a, int n) { - // 遍历所有数组元素 - for (int i = 0; i < n - 1; i++) { - // 标记变量，用于检查是否发生了交换 - boolean swapped = false; - for (int j = 0; j < n - i - 1; j++) { - // 如果当前元素大于下一个元素，则交换它们 - if (a[j] > a[j + 1]) { - int temp = a[j]; - a[j] = a[j + 1]; - a[j + 1] = temp; - swapped = true; - } - } - // 如果内层循环没有发生交换，说明数组已经有序，可以提前退出 - if (!swapped) { - break; - } - } -} //end diff --git a/codes/fengyu176/15759028.java b/codes/fengyu176/15759028.java deleted file mode 100644 index f2b711a46fe664a20752955f5730ee67702ccb8b..0000000000000000000000000000000000000000 --- a/codes/fengyu176/15759028.java +++ /dev/null @@ -1,20 +0,0 @@ -/** - * 冒泡排序函数 - * aa bb cc - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - // 你的代码，使无序数组 a 变得有序 - for(int i = 0; i < n; i++) { - for(int huat = 0; huat < n - i - 1; huat++) { - if(a[huat] > a[huat + 1]) { - int temp = a[huat]; - a [huat] = a[huat + 1]; - a[huat + 1] = temp; - } - } - } - - -} //end,huat diff --git a/codes/fhbb111/15605446.java b/codes/fhbb111/15605446.java deleted file mode 100644 index 04625a494ce3da760397a3c3c648cdbe5d0bfa71..0000000000000000000000000000000000000000 --- a/codes/fhbb111/15605446.java +++ /dev/null @@ -1,19 +0,0 @@ -/** - * 冒泡排序函数 - * aa bb cc - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - // 你的代码，使无序数组 a 变得有序 - for(int i = 0; i < n-1 ; i++){ - for (int j = 0;j < n-1-i;j++){ - if(a[j] > a[j+1]){ - int temp = a[j]; - a[j] = a[j+1]; - a[j+1] = temp; - } - } - } -} //end - diff --git a/codes/fhkjhkl876/.keep b/codes/fhkjhkl876/.keep deleted file mode 100644 index e69de29bb2d1d6434b8b29ae775ad8c2e48c5391..0000000000000000000000000000000000000000 diff --git a/codes/fhkjhkl876/15743332.java b/codes/fhkjhkl876/15743332.java deleted file mode 100644 index 6e9861fa3ec6d5a2553cdccd1bb1e977430c671b..0000000000000000000000000000000000000000 --- a/codes/fhkjhkl876/15743332.java +++ /dev/null @@ -1,19 +0,0 @@ -/** - * 冒泡排序函数 - * aa bb cc - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - // 你的代码，使无序数组 a 变得有序 - for (int i = 0; i < n - 1; i++) { - for (int j = 0; j < n - i - 1; j++) { - if (a[j] > a[j + 1]) { - - int temp = a[j]; - a[j] = a[j + 1]; - a[j + 1] = temp; - } - } - } -} //end \ No newline at end of file diff --git a/codes/fhl3yue/15692389.java b/codes/fhl3yue/15692389.java deleted file mode 100644 index 854beb62bfcf4ead3549d682ffca7f1b9f32d947..0000000000000000000000000000000000000000 --- a/codes/fhl3yue/15692389.java +++ /dev/null @@ -1,19 +0,0 @@ -/** - * 冒泡排序函数 - * aa bb cc - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - for(int i = 0; i < n-1 ; i++){ - for (int j = 0;j < n-1-i;j++){ - if(a[j] > a[j+1]){ - int temp = a[j]; - a[j] = a[j+1]; - a[j+1] = temp; - } - } - } - -} //end - diff --git a/codes/fhvz199/15759040.java b/codes/fhvz199/15759040.java deleted file mode 100644 index 76cbddd876f8669466e0a2651682cee667741713..0000000000000000000000000000000000000000 --- a/codes/fhvz199/15759040.java +++ /dev/null @@ -1,20 +0,0 @@ -/** - * 冒泡排序函数 - * aa bb cc - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - // 你的代码，使无序数组 a 变得有序 - for(int i = 0; i < n; i++) { - for(int b = 0; b < n - i - 1; b++) { - if(a[b] > a[b + 1]) { - int temp = a[b]; - a [b] = a[b + 1]; - a[b + 1] = temp; - } - } - } - - -} //end diff --git a/codes/fitzge/.keep b/codes/fitzge/.keep deleted file mode 100644 index e69de29bb2d1d6434b8b29ae775ad8c2e48c5391..0000000000000000000000000000000000000000 diff --git a/codes/fitzge/15867203.java b/codes/fitzge/15867203.java deleted file mode 100644 index 6426772fb479b07ed3be21ef1867921d1dbb194c..0000000000000000000000000000000000000000 --- a/codes/fitzge/15867203.java +++ /dev/null @@ -1,20 +0,0 @@ -/** - * 冒泡排序函数 - * aa bb cc - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - // 你的代码，使无序数组 a 变得有序 - for(int i = 0; i < n; i++) { - for(int j = 0; j < n - i - 1; j++) { - if(a[j] > a[j + 1]) { - int temp = a[j]; - a [j] = a[j + 1]; - a[j + 1] = temp; - } - } - } - - -} //end \ No newline at end of file diff --git a/codes/flutter/11187840.java b/codes/flutter/11187840.java deleted file mode 100644 index 9e7534d4b41cf071c848fa4d5c08c6519526b6e3..0000000000000000000000000000000000000000 --- a/codes/flutter/11187840.java +++ /dev/null @@ -1,18 +0,0 @@ -/** - * 冒泡 排序 函数 - * aa bb cc - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - // 你的代码，使无序数组 a 变得有序 - for (int i = 0; i < n; i++) { - for (int j = 0; j < i; j++) { - if (a[i] < a[j]) { - int t = a[i]; - a[i] = a[j]; - a[j] = t; - } - } - } -}//end \ No newline at end of file diff --git a/codes/fofone/15772455.java b/codes/fofone/15772455.java deleted file mode 100644 index 987377810b5beca8eb4bf5eafeee5db45e234a87..0000000000000000000000000000000000000000 --- a/codes/fofone/15772455.java +++ /dev/null @@ -1,20 +0,0 @@ -/** - * 冒泡排序函数 - * aa bb cc - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - // 你的代码，使无序数组 a 变得有序 - for(int i = 0; i < n; i++) { - for(int liuy = 0; liuy < n - i - 1; liuy++) { - if(a[liuy] > a[liuy + 1]) { - int temp = a[liuy]; - a [liuy] = a[liuy + 1]; - a[liuy + 1] = temp; - } - } - } - - -} //end,liuy diff --git a/codes/forz4ever/18245446.java b/codes/forz4ever/18245446.java deleted file mode 100644 index c65720407ad829324c4e38dc794639d5c4bfd899..0000000000000000000000000000000000000000 --- a/codes/forz4ever/18245446.java +++ /dev/null @@ -1,21 +0,0 @@ -/** - * 冒泡函数排序 - * aa bb cc - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - //你的代码，，使无序数组 a 变得有序 - for(int i = 0;i < n - 1;i++){ - for(int j = 0;j < n - 1 - i;j++){ - if(a[j] > a[j + 1]){ - int temp = a[j]; - a[j] = a[j + 1]; - a[j + 1] = temp; - - } - } - } - - -}//end diff --git a/codes/fosmos/10385999.java b/codes/fosmos/10385999.java deleted file mode 100644 index dcb3be9513f62812667c57af8e4c4304b5262734..0000000000000000000000000000000000000000 --- a/codes/fosmos/10385999.java +++ /dev/null @@ -1,12 +0,0 @@ -public static void bubbleSort( int[] a, int n ) { - for (int i = 0;i < a.length ;i++) { - for(int j = (i+1); j < a.length ;j++) { - int tep = 0; - if (a[i] > a[j]) { - tep = a[i]; - a[i] = a[j]; - a[j] = tep; - } - } - } -} \ No newline at end of file diff --git a/codes/fq18552765314/.keep b/codes/fq18552765314/.keep deleted file mode 100644 index e69de29bb2d1d6434b8b29ae775ad8c2e48c5391..0000000000000000000000000000000000000000 diff --git a/codes/fq18552765314/10972612.java b/codes/fq18552765314/10972612.java deleted file mode 100644 index 9eccfac593dd84bb4c285d230d4de6b8c72a1d65..0000000000000000000000000000000000000000 --- a/codes/fq18552765314/10972612.java +++ /dev/null @@ -1,11 +0,0 @@ -public static void bubbleSort(int [] a, int n) { - for (int i=0 ; ia[j+1]) { - int temp=a[j]; - a[j]=a[j+1]; - a[j+1]=temp; - } - } - } -} diff --git a/codes/franki_lxsq/9958657.java b/codes/franki_lxsq/9958657.java deleted file mode 100644 index e13c76bcf4cb1ee7db2f171ec3fa540a879af839..0000000000000000000000000000000000000000 --- a/codes/franki_lxsq/9958657.java +++ /dev/null @@ -1,18 +0,0 @@ -/** - * 冒泡排序函数 - * aa bb cc - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - // 你的代码，使无序数组 a 变得有序 -for(int i = 0 ; i < n - 1 ; i++){ - for(int j = 0 ; j < n - 1 - i ; j++){ - if(a[j] > a[j + 1]){ - int tmp = a[j]; - a[j] = a[j + 1]; - a[j + 1] = tmp; - } - } - } -} //end diff --git a/codes/freeliujian/11351490.java b/codes/freeliujian/11351490.java deleted file mode 100644 index 9e7534d4b41cf071c848fa4d5c08c6519526b6e3..0000000000000000000000000000000000000000 --- a/codes/freeliujian/11351490.java +++ /dev/null @@ -1,18 +0,0 @@ -/** - * 冒泡 排序 函数 - * aa bb cc - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - // 你的代码，使无序数组 a 变得有序 - for (int i = 0; i < n; i++) { - for (int j = 0; j < i; j++) { - if (a[i] < a[j]) { - int t = a[i]; - a[i] = a[j]; - a[j] = t; - } - } - } -}//end \ No newline at end of file diff --git a/codes/friklogff/15528029.java b/codes/friklogff/15528029.java deleted file mode 100644 index 854beb62bfcf4ead3549d682ffca7f1b9f32d947..0000000000000000000000000000000000000000 --- a/codes/friklogff/15528029.java +++ /dev/null @@ -1,19 +0,0 @@ -/** - * 冒泡排序函数 - * aa bb cc - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - for(int i = 0; i < n-1 ; i++){ - for (int j = 0;j < n-1-i;j++){ - if(a[j] > a[j+1]){ - int temp = a[j]; - a[j] = a[j+1]; - a[j+1] = temp; - } - } - } - -} //end - diff --git a/codes/fsa722/.keep b/codes/fsa722/.keep deleted file mode 100644 index e69de29bb2d1d6434b8b29ae775ad8c2e48c5391..0000000000000000000000000000000000000000 diff --git a/codes/fsa722/15742665.java b/codes/fsa722/15742665.java deleted file mode 100644 index 6e9861fa3ec6d5a2553cdccd1bb1e977430c671b..0000000000000000000000000000000000000000 --- a/codes/fsa722/15742665.java +++ /dev/null @@ -1,19 +0,0 @@ -/** - * 冒泡排序函数 - * aa bb cc - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - // 你的代码，使无序数组 a 变得有序 - for (int i = 0; i < n - 1; i++) { - for (int j = 0; j < n - i - 1; j++) { - if (a[j] > a[j + 1]) { - - int temp = a[j]; - a[j] = a[j + 1]; - a[j + 1] = temp; - } - } - } -} //end \ No newline at end of file diff --git a/codes/fsafacc232/.keep b/codes/fsafacc232/.keep deleted file mode 100644 index e69de29bb2d1d6434b8b29ae775ad8c2e48c5391..0000000000000000000000000000000000000000 diff --git a/codes/fsafacc232/15743001.java b/codes/fsafacc232/15743001.java deleted file mode 100644 index 6e9861fa3ec6d5a2553cdccd1bb1e977430c671b..0000000000000000000000000000000000000000 --- a/codes/fsafacc232/15743001.java +++ /dev/null @@ -1,19 +0,0 @@ -/** - * 冒泡排序函数 - * aa bb cc - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - // 你的代码，使无序数组 a 变得有序 - for (int i = 0; i < n - 1; i++) { - for (int j = 0; j < n - i - 1; j++) { - if (a[j] > a[j + 1]) { - - int temp = a[j]; - a[j] = a[j + 1]; - a[j + 1] = temp; - } - } - } -} //end \ No newline at end of file diff --git a/codes/fsafas8979812/.keep b/codes/fsafas8979812/.keep deleted file mode 100644 index e69de29bb2d1d6434b8b29ae775ad8c2e48c5391..0000000000000000000000000000000000000000 diff --git a/codes/fsafas8979812/15831387.java b/codes/fsafas8979812/15831387.java deleted file mode 100644 index 6e9861fa3ec6d5a2553cdccd1bb1e977430c671b..0000000000000000000000000000000000000000 --- a/codes/fsafas8979812/15831387.java +++ /dev/null @@ -1,19 +0,0 @@ -/** - * 冒泡排序函数 - * aa bb cc - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - // 你的代码，使无序数组 a 变得有序 - for (int i = 0; i < n - 1; i++) { - for (int j = 0; j < n - i - 1; j++) { - if (a[j] > a[j + 1]) { - - int temp = a[j]; - a[j] = a[j + 1]; - a[j + 1] = temp; - } - } - } -} //end \ No newline at end of file diff --git a/codes/fsafsa234/.keep b/codes/fsafsa234/.keep deleted file mode 100644 index e69de29bb2d1d6434b8b29ae775ad8c2e48c5391..0000000000000000000000000000000000000000 diff --git a/codes/fsafsa234/15831509.java b/codes/fsafsa234/15831509.java deleted file mode 100644 index 6e9861fa3ec6d5a2553cdccd1bb1e977430c671b..0000000000000000000000000000000000000000 --- a/codes/fsafsa234/15831509.java +++ /dev/null @@ -1,19 +0,0 @@ -/** - * 冒泡排序函数 - * aa bb cc - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - // 你的代码，使无序数组 a 变得有序 - for (int i = 0; i < n - 1; i++) { - for (int j = 0; j < n - i - 1; j++) { - if (a[j] > a[j + 1]) { - - int temp = a[j]; - a[j] = a[j + 1]; - a[j + 1] = temp; - } - } - } -} //end \ No newline at end of file diff --git a/codes/fsafsc2132/.keep b/codes/fsafsc2132/.keep deleted file mode 100644 index e69de29bb2d1d6434b8b29ae775ad8c2e48c5391..0000000000000000000000000000000000000000 diff --git a/codes/fsafsc2132/15831373.java b/codes/fsafsc2132/15831373.java deleted file mode 100644 index 6e9861fa3ec6d5a2553cdccd1bb1e977430c671b..0000000000000000000000000000000000000000 --- a/codes/fsafsc2132/15831373.java +++ /dev/null @@ -1,19 +0,0 @@ -/** - * 冒泡排序函数 - * aa bb cc - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - // 你的代码，使无序数组 a 变得有序 - for (int i = 0; i < n - 1; i++) { - for (int j = 0; j < n - i - 1; j++) { - if (a[j] > a[j + 1]) { - - int temp = a[j]; - a[j] = a[j + 1]; - a[j + 1] = temp; - } - } - } -} //end \ No newline at end of file diff --git a/codes/fsdf435sdf/.keep b/codes/fsdf435sdf/.keep deleted file mode 100644 index e69de29bb2d1d6434b8b29ae775ad8c2e48c5391..0000000000000000000000000000000000000000 diff --git a/codes/fsdf435sdf/15743405.java b/codes/fsdf435sdf/15743405.java deleted file mode 100644 index 6e9861fa3ec6d5a2553cdccd1bb1e977430c671b..0000000000000000000000000000000000000000 --- a/codes/fsdf435sdf/15743405.java +++ /dev/null @@ -1,19 +0,0 @@ -/** - * 冒泡排序函数 - * aa bb cc - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - // 你的代码，使无序数组 a 变得有序 - for (int i = 0; i < n - 1; i++) { - for (int j = 0; j < n - i - 1; j++) { - if (a[j] > a[j + 1]) { - - int temp = a[j]; - a[j] = a[j + 1]; - a[j + 1] = temp; - } - } - } -} //end \ No newline at end of file diff --git a/codes/fsdfsdfh32/.keep b/codes/fsdfsdfh32/.keep deleted file mode 100644 index e69de29bb2d1d6434b8b29ae775ad8c2e48c5391..0000000000000000000000000000000000000000 diff --git a/codes/fsdfsdfh32/15827710.java b/codes/fsdfsdfh32/15827710.java deleted file mode 100644 index 6e9861fa3ec6d5a2553cdccd1bb1e977430c671b..0000000000000000000000000000000000000000 --- a/codes/fsdfsdfh32/15827710.java +++ /dev/null @@ -1,19 +0,0 @@ -/** - * 冒泡排序函数 - * aa bb cc - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - // 你的代码，使无序数组 a 变得有序 - for (int i = 0; i < n - 1; i++) { - for (int j = 0; j < n - i - 1; j++) { - if (a[j] > a[j + 1]) { - - int temp = a[j]; - a[j] = a[j + 1]; - a[j + 1] = temp; - } - } - } -} //end \ No newline at end of file diff --git a/codes/fsk1234/15790091.java b/codes/fsk1234/15790091.java deleted file mode 100644 index b6780441b2451c160b8725a709ccf6c9dcb4c7c4..0000000000000000000000000000000000000000 --- a/codes/fsk1234/15790091.java +++ /dev/null @@ -1,20 +0,0 @@ -/** - * 冒泡排序函数 - * 通过多次遍历数组，比较相邻元素并交换位置，将最大的元素逐渐“冒泡”到数组的末尾， - * 从而实现数组的升序排序。 - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int[] a, int n) { - for (int i = 0; i < n - 1; i++) { // 外层循环，控制遍历次数 - for (int j = 0; j < n - i - 1; j++) { // 内层循环，控制每次遍历的比较次数 - if (a[j] > a[j + 1]) { // 如果当前元素大于下一个元素，则交换它们 - // 交换 a[j] 和 a[j+1] - int temp = a[j]; - a[j] = a[j + 1]; - a[j + 1] = temp; - } - } - } -} //end - diff --git a/codes/fubing3/.keep b/codes/fubing3/.keep deleted file mode 100644 index e69de29bb2d1d6434b8b29ae775ad8c2e48c5391..0000000000000000000000000000000000000000 diff --git a/codes/fubing3/9619048.java b/codes/fubing3/9619048.java deleted file mode 100644 index 1752b8cbc3fdd044b5ce59517f8f6e5b3348a88b..0000000000000000000000000000000000000000 --- a/codes/fubing3/9619048.java +++ /dev/null @@ -1,11 +0,0 @@ -public static void sortFunc(int [] a, int n) { -for (int i=0 ; ia[j+1]) { -int temp=a[j]; -a[j]=a[j+1]; -a[j+1]=temp; -} -} -} -} \ No newline at end of file diff --git a/codes/fuzhong/10967384.java b/codes/fuzhong/10967384.java deleted file mode 100644 index c7db0a12c82390b8c8392060c67151185aa5fe32..0000000000000000000000000000000000000000 --- a/codes/fuzhong/10967384.java +++ /dev/null @@ -1,19 +0,0 @@ -/** - * 冒泡排序函数 - * @param arr 待排序的数组 - * @param size 待排序的数组长度 - */ -public static void bubbleSort(int [] arr, int size){ - // 你的代码，使无序数组 arr 变得有序 - for(int i = 0 ; i < size - 1 ; i++){ - for(int j = 0 ; j < size - 1 - i ; j++){ - if(arr[j] > arr[j + 1]){ - int tmp = arr[j]; - arr[j] = arr[j + 1]; - arr[j + 1] = tmp; - } - } - } - -} //end - diff --git a/codes/fuzio35/16199622.java b/codes/fuzio35/16199622.java deleted file mode 100644 index 7b62287675af2c233367ea046df0070c56426d30..0000000000000000000000000000000000000000 --- a/codes/fuzio35/16199622.java +++ /dev/null @@ -1,12 +0,0 @@ -public static void bubbleSort(int [] a, int n){ - int temp =0; - for(int i = 0;ii;j--){ - if(a[j]a[y+1]) { - int temp=a[y]; - a[y]=a[y+1]; - a[y+1]=temp; - } - } - } -} diff --git a/codes/fy13073414213/.keep b/codes/fy13073414213/.keep deleted file mode 100644 index e69de29bb2d1d6434b8b29ae775ad8c2e48c5391..0000000000000000000000000000000000000000 diff --git a/codes/fy13073414213/10972162.java b/codes/fy13073414213/10972162.java deleted file mode 100644 index 9eccfac593dd84bb4c285d230d4de6b8c72a1d65..0000000000000000000000000000000000000000 --- a/codes/fy13073414213/10972162.java +++ /dev/null @@ -1,11 +0,0 @@ -public static void bubbleSort(int [] a, int n) { - for (int i=0 ; ia[j+1]) { - int temp=a[j]; - a[j]=a[j+1]; - a[j+1]=temp; - } - } - } -} diff --git a/codes/fyt345sdfgsd/.keep b/codes/fyt345sdfgsd/.keep deleted file mode 100644 index e69de29bb2d1d6434b8b29ae775ad8c2e48c5391..0000000000000000000000000000000000000000 diff --git a/codes/fyt345sdfgsd/15743397.java b/codes/fyt345sdfgsd/15743397.java deleted file mode 100644 index 6e9861fa3ec6d5a2553cdccd1bb1e977430c671b..0000000000000000000000000000000000000000 --- a/codes/fyt345sdfgsd/15743397.java +++ /dev/null @@ -1,19 +0,0 @@ -/** - * 冒泡排序函数 - * aa bb cc - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - // 你的代码，使无序数组 a 变得有序 - for (int i = 0; i < n - 1; i++) { - for (int j = 0; j < n - i - 1; j++) { - if (a[j] > a[j + 1]) { - - int temp = a[j]; - a[j] = a[j + 1]; - a[j + 1] = temp; - } - } - } -} //end \ No newline at end of file diff --git a/codes/gaoxinjmj/.keep b/codes/gaoxinjmj/.keep deleted file mode 100644 index e69de29bb2d1d6434b8b29ae775ad8c2e48c5391..0000000000000000000000000000000000000000 diff --git a/codes/gaoxinjmj/15759215.java b/codes/gaoxinjmj/15759215.java deleted file mode 100644 index d40803fb8fd6db6216a346341ff5180f0b773922..0000000000000000000000000000000000000000 --- a/codes/gaoxinjmj/15759215.java +++ /dev/null @@ -1,20 +0,0 @@ -/** - * 冒泡排序函数 - * aa bb cc - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - // 你的代码，使无序数组 a 变得有序 - for(int i = 0; i < n; i++) { - for(int j = 0; j < n - i - 1; j++) { - if(a[j] > a[j + 1]) { - int temp = a[j]; - a [j] = a[j + 1]; - a[j + 1] = temp; - } - } - } - - -} //end \ No newline at end of file diff --git a/codes/gddclct/15959388.java b/codes/gddclct/15959388.java deleted file mode 100644 index 5cc1c636a63a4a96ad5c1161dade3c61f9551d9b..0000000000000000000000000000000000000000 --- a/codes/gddclct/15959388.java +++ /dev/null @@ -1,21 +0,0 @@ -/** - * 冒泡排序函数 - * 功能：将无序数组 a 按照从小到大的顺序进行排序 - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - // 外层循环控制所有轮数 - for (int i = 0; i < n - 1; i++) { - // 内层循环控制每一轮的比较次数 - for (int j = 0; j < n - 1 - i; j++) { - // 如果前一个元素大于后一个元素，则交换它们的位置 - if (a[j] > a[j + 1]) { - // 交换元素 - int temp = a[j]; - a[j] = a[j + 1]; - a[j + 1] = temp; - } - } - } -} //end diff --git a/codes/gedeshidai/15539757.java b/codes/gedeshidai/15539757.java deleted file mode 100644 index c7d4bd3a4f7751ebee0c866e0a6b4cc18ddef31d..0000000000000000000000000000000000000000 --- a/codes/gedeshidai/15539757.java +++ /dev/null @@ -1,19 +0,0 @@ -/** - * 冒泡排序函数 - * 该函数通过冒泡排序算法对待排序的数组进行排序 - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - for(int i = 0; i < n - 1; i++){ - for(int j = 0; j < n - i - 1; j++){ - // 如果前一个元素大于后一个元素，则交换他们的位置 - if(a[j] > a[j + 1]){ - int temp = a[j]; - a[j] = a[j + 1]; - a[j + 1] = temp; - } - } - } -} -//end diff --git a/codes/genghai/.keep b/codes/genghai/.keep deleted file mode 100644 index e69de29bb2d1d6434b8b29ae775ad8c2e48c5391..0000000000000000000000000000000000000000 diff --git a/codes/genghai/15831364.java b/codes/genghai/15831364.java deleted file mode 100644 index 6426772fb479b07ed3be21ef1867921d1dbb194c..0000000000000000000000000000000000000000 --- a/codes/genghai/15831364.java +++ /dev/null @@ -1,20 +0,0 @@ -/** - * 冒泡排序函数 - * aa bb cc - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - // 你的代码，使无序数组 a 变得有序 - for(int i = 0; i < n; i++) { - for(int j = 0; j < n - i - 1; j++) { - if(a[j] > a[j + 1]) { - int temp = a[j]; - a [j] = a[j + 1]; - a[j + 1] = temp; - } - } - } - - -} //end \ No newline at end of file diff --git a/codes/gflu777/15508845.java b/codes/gflu777/15508845.java deleted file mode 100644 index 7cd30ca2d60722a569bba6c83f6349fb70261177..0000000000000000000000000000000000000000 --- a/codes/gflu777/15508845.java +++ /dev/null @@ -1,19 +0,0 @@ - /** - * 冒泡排序函数 - * aa bb cc - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ - public static void bubbleSort(int [] a, int n){ - // 你的代码，使无序数组 a 变得有序 - for (int i = 0; i < n-1; i++) { - for (int j = 0; j < n-i-1; j++) { - if (a[j] > a[j+1]) { - int tmp = a[j]; - a[j] = a[j+1]; - a[j+1] = tmp; - } - } - } - - } //end diff --git a/codes/ghdfg3452/.keep b/codes/ghdfg3452/.keep deleted file mode 100644 index e69de29bb2d1d6434b8b29ae775ad8c2e48c5391..0000000000000000000000000000000000000000 diff --git a/codes/ghdfg3452/15743429.java b/codes/ghdfg3452/15743429.java deleted file mode 100644 index 6e9861fa3ec6d5a2553cdccd1bb1e977430c671b..0000000000000000000000000000000000000000 --- a/codes/ghdfg3452/15743429.java +++ /dev/null @@ -1,19 +0,0 @@ -/** - * 冒泡排序函数 - * aa bb cc - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - // 你的代码，使无序数组 a 变得有序 - for (int i = 0; i < n - 1; i++) { - for (int j = 0; j < n - i - 1; j++) { - if (a[j] > a[j + 1]) { - - int temp = a[j]; - a[j] = a[j + 1]; - a[j + 1] = temp; - } - } - } -} //end \ No newline at end of file diff --git a/codes/gin-lsl/11448781.java b/codes/gin-lsl/11448781.java deleted file mode 100644 index cacd12f1e4e4360dd1ffa22f3741e376110bcde4..0000000000000000000000000000000000000000 --- a/codes/gin-lsl/11448781.java +++ /dev/null @@ -1,18 +0,0 @@ -/** - * 冒泡排序函数 - * aa bb cc - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - // 你的代码，使无序数组 a 变得有序 - for(int i=0;ia[j+1]){ - a[j] = a[j]+a[j+1]; - a[j+1] = a[j]-a[j+1]; - a[j] = a[j]-a[j+1]; - } - } - } -} //end \ No newline at end of file diff --git a/codes/giooter/.keep b/codes/giooter/.keep deleted file mode 100644 index e69de29bb2d1d6434b8b29ae775ad8c2e48c5391..0000000000000000000000000000000000000000 diff --git a/codes/giooter/15773918.java b/codes/giooter/15773918.java deleted file mode 100644 index 9f86eb587f5fb5dee2fac7e589a1cf95128af5cc..0000000000000000000000000000000000000000 --- a/codes/giooter/15773918.java +++ /dev/null @@ -1,18 +0,0 @@ -/** - * 冒泡排序函数 - * aa bb cc - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - // 你的代码，使无序数组 a 变得有序 - for(int i=0;ia[j+1]){ - a[j] = a[j]+a[j+1]; - a[j+1] = a[j]-a[j+1]; - a[j] = a[j]-a[j+1]; - } - } - } -} //end \ No newline at end of file diff --git a/codes/gobuster/15555259.java b/codes/gobuster/15555259.java deleted file mode 100644 index 854beb62bfcf4ead3549d682ffca7f1b9f32d947..0000000000000000000000000000000000000000 --- a/codes/gobuster/15555259.java +++ /dev/null @@ -1,19 +0,0 @@ -/** - * 冒泡排序函数 - * aa bb cc - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - for(int i = 0; i < n-1 ; i++){ - for (int j = 0;j < n-1-i;j++){ - if(a[j] > a[j+1]){ - int temp = a[j]; - a[j] = a[j+1]; - a[j+1] = temp; - } - } - } - -} //end - diff --git a/codes/godawang/.keep b/codes/godawang/.keep deleted file mode 100644 index e69de29bb2d1d6434b8b29ae775ad8c2e48c5391..0000000000000000000000000000000000000000 diff --git a/codes/godawang/15764594.java b/codes/godawang/15764594.java deleted file mode 100644 index 6426772fb479b07ed3be21ef1867921d1dbb194c..0000000000000000000000000000000000000000 --- a/codes/godawang/15764594.java +++ /dev/null @@ -1,20 +0,0 @@ -/** - * 冒泡排序函数 - * aa bb cc - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - // 你的代码，使无序数组 a 变得有序 - for(int i = 0; i < n; i++) { - for(int j = 0; j < n - i - 1; j++) { - if(a[j] > a[j + 1]) { - int temp = a[j]; - a [j] = a[j + 1]; - a[j + 1] = temp; - } - } - } - - -} //end \ No newline at end of file diff --git a/codes/godgod/15775680.java b/codes/godgod/15775680.java deleted file mode 100644 index 987377810b5beca8eb4bf5eafeee5db45e234a87..0000000000000000000000000000000000000000 --- a/codes/godgod/15775680.java +++ /dev/null @@ -1,20 +0,0 @@ -/** - * 冒泡排序函数 - * aa bb cc - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - // 你的代码，使无序数组 a 变得有序 - for(int i = 0; i < n; i++) { - for(int liuy = 0; liuy < n - i - 1; liuy++) { - if(a[liuy] > a[liuy + 1]) { - int temp = a[liuy]; - a [liuy] = a[liuy + 1]; - a[liuy + 1] = temp; - } - } - } - - -} //end,liuy diff --git a/codes/godofkingsdonw6/.keep b/codes/godofkingsdonw6/.keep deleted file mode 100644 index e69de29bb2d1d6434b8b29ae775ad8c2e48c5391..0000000000000000000000000000000000000000 diff --git a/codes/godofkingsdonw6/15815850.java b/codes/godofkingsdonw6/15815850.java deleted file mode 100644 index 6e9861fa3ec6d5a2553cdccd1bb1e977430c671b..0000000000000000000000000000000000000000 --- a/codes/godofkingsdonw6/15815850.java +++ /dev/null @@ -1,19 +0,0 @@ -/** - * 冒泡排序函数 - * aa bb cc - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - // 你的代码，使无序数组 a 变得有序 - for (int i = 0; i < n - 1; i++) { - for (int j = 0; j < n - i - 1; j++) { - if (a[j] > a[j + 1]) { - - int temp = a[j]; - a[j] = a[j + 1]; - a[j + 1] = temp; - } - } - } -} //end \ No newline at end of file diff --git a/codes/gogomo/.keep b/codes/gogomo/.keep deleted file mode 100644 index e69de29bb2d1d6434b8b29ae775ad8c2e48c5391..0000000000000000000000000000000000000000 diff --git a/codes/gogomo/15865953.java b/codes/gogomo/15865953.java deleted file mode 100644 index 6426772fb479b07ed3be21ef1867921d1dbb194c..0000000000000000000000000000000000000000 --- a/codes/gogomo/15865953.java +++ /dev/null @@ -1,20 +0,0 @@ -/** - * 冒泡排序函数 - * aa bb cc - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - // 你的代码，使无序数组 a 变得有序 - for(int i = 0; i < n; i++) { - for(int j = 0; j < n - i - 1; j++) { - if(a[j] > a[j + 1]) { - int temp = a[j]; - a [j] = a[j + 1]; - a[j + 1] = temp; - } - } - } - - -} //end \ No newline at end of file diff --git a/codes/goodstudymyx/.keep b/codes/goodstudymyx/.keep deleted file mode 100644 index e69de29bb2d1d6434b8b29ae775ad8c2e48c5391..0000000000000000000000000000000000000000 diff --git a/codes/goodstudymyx/15846322.java b/codes/goodstudymyx/15846322.java deleted file mode 100644 index 6e9861fa3ec6d5a2553cdccd1bb1e977430c671b..0000000000000000000000000000000000000000 --- a/codes/goodstudymyx/15846322.java +++ /dev/null @@ -1,19 +0,0 @@ -/** - * 冒泡排序函数 - * aa bb cc - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - // 你的代码，使无序数组 a 变得有序 - for (int i = 0; i < n - 1; i++) { - for (int j = 0; j < n - i - 1; j++) { - if (a[j] > a[j + 1]) { - - int temp = a[j]; - a[j] = a[j + 1]; - a[j + 1] = temp; - } - } - } -} //end \ No newline at end of file diff --git a/codes/gotchar/15775671.java b/codes/gotchar/15775671.java deleted file mode 100644 index a5c2a32051a0cf886de3e27b736b7b2643072a26..0000000000000000000000000000000000000000 --- a/codes/gotchar/15775671.java +++ /dev/null @@ -1,18 +0,0 @@ -/** - * 冒泡排序函数 - * 通过相邻元素两两比较并交换，使得每一轮比较后最大（或最小）的元素能够移动到数组的末尾 - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int[] a, int n) { - for (int i = 0; i < n - 1; i++) { // 外层循环控制排序趟数 - for (int j = 0; j < n - 1 - i; j++) { // 内层循环控制每一趟排序多少次 - if (a[j] > a[j + 1]) { // 如果当前元素大于下一个元素，则交换它们的位置 - // 交换 a[j] 和 a[j + 1] - int temp = a[j]; - a[j] = a[j + 1]; - a[j + 1] = temp; - } - } - } -} //end diff --git a/codes/gqhomegitee/.keep b/codes/gqhomegitee/.keep deleted file mode 100644 index e69de29bb2d1d6434b8b29ae775ad8c2e48c5391..0000000000000000000000000000000000000000 diff --git a/codes/gqhomegitee/15846699.java b/codes/gqhomegitee/15846699.java deleted file mode 100644 index 6e9861fa3ec6d5a2553cdccd1bb1e977430c671b..0000000000000000000000000000000000000000 --- a/codes/gqhomegitee/15846699.java +++ /dev/null @@ -1,19 +0,0 @@ -/** - * 冒泡排序函数 - * aa bb cc - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - // 你的代码，使无序数组 a 变得有序 - for (int i = 0; i < n - 1; i++) { - for (int j = 0; j < n - i - 1; j++) { - if (a[j] > a[j + 1]) { - - int temp = a[j]; - a[j] = a[j + 1]; - a[j + 1] = temp; - } - } - } -} //end \ No newline at end of file diff --git a/codes/grfewryhh55/.keep b/codes/grfewryhh55/.keep deleted file mode 100644 index e69de29bb2d1d6434b8b29ae775ad8c2e48c5391..0000000000000000000000000000000000000000 diff --git a/codes/grfewryhh55/15828725.java b/codes/grfewryhh55/15828725.java deleted file mode 100644 index 6e9861fa3ec6d5a2553cdccd1bb1e977430c671b..0000000000000000000000000000000000000000 --- a/codes/grfewryhh55/15828725.java +++ /dev/null @@ -1,19 +0,0 @@ -/** - * 冒泡排序函数 - * aa bb cc - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - // 你的代码，使无序数组 a 变得有序 - for (int i = 0; i < n - 1; i++) { - for (int j = 0; j < n - i - 1; j++) { - if (a[j] > a[j + 1]) { - - int temp = a[j]; - a[j] = a[j + 1]; - a[j + 1] = temp; - } - } - } -} //end \ No newline at end of file diff --git a/codes/gsdrt657/.keep b/codes/gsdrt657/.keep deleted file mode 100644 index e69de29bb2d1d6434b8b29ae775ad8c2e48c5391..0000000000000000000000000000000000000000 diff --git a/codes/gsdrt657/15831411.java b/codes/gsdrt657/15831411.java deleted file mode 100644 index 6e9861fa3ec6d5a2553cdccd1bb1e977430c671b..0000000000000000000000000000000000000000 --- a/codes/gsdrt657/15831411.java +++ /dev/null @@ -1,19 +0,0 @@ -/** - * 冒泡排序函数 - * aa bb cc - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - // 你的代码，使无序数组 a 变得有序 - for (int i = 0; i < n - 1; i++) { - for (int j = 0; j < n - i - 1; j++) { - if (a[j] > a[j + 1]) { - - int temp = a[j]; - a[j] = a[j + 1]; - a[j + 1] = temp; - } - } - } -} //end \ No newline at end of file diff --git a/codes/gtuwer64/.keep b/codes/gtuwer64/.keep deleted file mode 100644 index e69de29bb2d1d6434b8b29ae775ad8c2e48c5391..0000000000000000000000000000000000000000 diff --git a/codes/gtuwer64/15828885.java b/codes/gtuwer64/15828885.java deleted file mode 100644 index 6e9861fa3ec6d5a2553cdccd1bb1e977430c671b..0000000000000000000000000000000000000000 --- a/codes/gtuwer64/15828885.java +++ /dev/null @@ -1,19 +0,0 @@ -/** - * 冒泡排序函数 - * aa bb cc - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - // 你的代码，使无序数组 a 变得有序 - for (int i = 0; i < n - 1; i++) { - for (int j = 0; j < n - i - 1; j++) { - if (a[j] > a[j + 1]) { - - int temp = a[j]; - a[j] = a[j + 1]; - a[j + 1] = temp; - } - } - } -} //end \ No newline at end of file diff --git a/codes/guagua123/15620667.java b/codes/guagua123/15620667.java deleted file mode 100644 index cee67cf6229d1a199df63ed1122d20749ba33784..0000000000000000000000000000000000000000 --- a/codes/guagua123/15620667.java +++ /dev/null @@ -1,18 +0,0 @@ -/** - * 冒泡排序函数 - * 对数组a进行升序排序 - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int[] a, int n) { - for (int i = 0; i < n - 1; i++) { // 外层循环控制比较轮数 - for (int j = 0; j < n - i - 1; j++) { // 内层循环控制每轮比较的次数 - // 如果前一个元素比后一个元素大，则交换它们的位置 - if (a[j] > a[j + 1]) { - int temp = a[j]; - a[j] = a[j + 1]; - a[j + 1] = temp; - } - } - } -} // end diff --git a/codes/guanghua/.keep b/codes/guanghua/.keep deleted file mode 100644 index e69de29bb2d1d6434b8b29ae775ad8c2e48c5391..0000000000000000000000000000000000000000 diff --git a/codes/guanghua/15756054.java b/codes/guanghua/15756054.java deleted file mode 100644 index c04ad968ede48b8851260c84fa7e7dfacf93666f..0000000000000000000000000000000000000000 --- a/codes/guanghua/15756054.java +++ /dev/null @@ -1,19 +0,0 @@ -/** -* 冒泡排序函数 -* aa bb cc -* @param a 待排序的数组 -* @param n 待排序的数组长度 -*/ -public static void bubbleSort(int [] a, int n){ - // 你的代码，使无序数组 a 变得有序 - for (int i = 0; i < n - 1; i++) { - for (int j = 0; j < n - i - 1; j++) { - if (a[j] > a[j + 1]) { - // 交换元素 - int temp = a[j]; - a[j] = a[j + 1]; - a[j + 1] = temp; - } - } - } -} //end \ No newline at end of file diff --git a/codes/guanghua/15772570.java b/codes/guanghua/15772570.java deleted file mode 100644 index 450685abac477f8d01ab4cf4abe3bb8091044f4e..0000000000000000000000000000000000000000 --- a/codes/guanghua/15772570.java +++ /dev/null @@ -1,19 +0,0 @@ -/** -* 冒泡排序函数 -* aa bb cc -* @param a 待排序的数组 -* @param n 待排序的数组长度 -*/ -public static void bubbleSort(int [] a, int n){ - // 你的代码，使无序数组 a 变得有序 - for (int i = 0; i < n-1; i++) { - for (int j = 0; j < n-i-1; j++) { - if (a[j] > a[j + 1]) { - // 交换元素 - int temp = a[j] ; - a[j] = a[j + 1] ; - a[j + 1] = temp ; - } - } - } -} //end 二次提交 \ No newline at end of file diff --git a/codes/guanghua/15819545.java b/codes/guanghua/15819545.java deleted file mode 100644 index c04ad968ede48b8851260c84fa7e7dfacf93666f..0000000000000000000000000000000000000000 --- a/codes/guanghua/15819545.java +++ /dev/null @@ -1,19 +0,0 @@ -/** -* 冒泡排序函数 -* aa bb cc -* @param a 待排序的数组 -* @param n 待排序的数组长度 -*/ -public static void bubbleSort(int [] a, int n){ - // 你的代码，使无序数组 a 变得有序 - for (int i = 0; i < n - 1; i++) { - for (int j = 0; j < n - i - 1; j++) { - if (a[j] > a[j + 1]) { - // 交换元素 - int temp = a[j]; - a[j] = a[j + 1]; - a[j + 1] = temp; - } - } - } -} //end \ No newline at end of file diff --git a/codes/guanghua/15820837.java b/codes/guanghua/15820837.java deleted file mode 100644 index 6426772fb479b07ed3be21ef1867921d1dbb194c..0000000000000000000000000000000000000000 --- a/codes/guanghua/15820837.java +++ /dev/null @@ -1,20 +0,0 @@ -/** - * 冒泡排序函数 - * aa bb cc - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - // 你的代码，使无序数组 a 变得有序 - for(int i = 0; i < n; i++) { - for(int j = 0; j < n - i - 1; j++) { - if(a[j] > a[j + 1]) { - int temp = a[j]; - a [j] = a[j + 1]; - a[j + 1] = temp; - } - } - } - - -} //end \ No newline at end of file diff --git a/codes/guanj123/15699820.java b/codes/guanj123/15699820.java deleted file mode 100644 index 987377810b5beca8eb4bf5eafeee5db45e234a87..0000000000000000000000000000000000000000 --- a/codes/guanj123/15699820.java +++ /dev/null @@ -1,20 +0,0 @@ -/** - * 冒泡排序函数 - * aa bb cc - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - // 你的代码，使无序数组 a 变得有序 - for(int i = 0; i < n; i++) { - for(int liuy = 0; liuy < n - i - 1; liuy++) { - if(a[liuy] > a[liuy + 1]) { - int temp = a[liuy]; - a [liuy] = a[liuy + 1]; - a[liuy + 1] = temp; - } - } - } - - -} //end,liuy diff --git a/codes/gufengxiao/15851937.java b/codes/gufengxiao/15851937.java deleted file mode 100644 index ae82e695cbfd360050241c3f1f592658c8c1d4e7..0000000000000000000000000000000000000000 --- a/codes/gufengxiao/15851937.java +++ /dev/null @@ -1,35 +0,0 @@ -/** - - * 冒泡排序函数 - - * aa bb cc - - * @param a 待排序的数组 - - * @param n 待排序的数组长度 - - */ - -public static void bubbleSort(int [] a, int n){ - - for(int i = 0; i < n-1 ; i++){ - - for (int j = 0;j < n-1-i;j++){ - - if(a[j] > a[j+1]){ - - int temp = a[j]; - - a[j] = a[j+1]; - - a[j+1] = temp; - - } - - } - - } - - - -} //end diff --git a/codes/gugulogs/15521175.java b/codes/gugulogs/15521175.java deleted file mode 100644 index f9340dccd37ede06d69d56d90660684be24f9b90..0000000000000000000000000000000000000000 --- a/codes/gugulogs/15521175.java +++ /dev/null @@ -1,13 +0,0 @@ -public static void bubbleSort(int [] a, int n){ - for(int i = 0; i < n-1 ; i++){ - for (int j = 0;j < n-1-i;j++){ - if(a[j] > a[j+1]){ - int temp = a[j]; - a[j] = a[j+1]; - a[j+1] = temp; - } - } - } - -} //end - diff --git a/codes/guhhzz/15835674.java b/codes/guhhzz/15835674.java deleted file mode 100644 index d0e7038df81a1dcd40ba57e5267839caad594f03..0000000000000000000000000000000000000000 --- a/codes/guhhzz/15835674.java +++ /dev/null @@ -1,19 +0,0 @@ -/** - * 冒泡排序函数 - * 冒泡排序是一种简单的排序算法，它重复地遍历要排序的数列，一次比较两个元素，如果他们的顺序错误就把他们交换过来。 - * 遍历数列的工作是重复地进行直到没有再需要交换，也就是说该数列已经排序完成。 - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - for (int i = 0; i < n - 1; i++) { // 外层循环控制比较的次数 - for (int j = 0; j < n - 1 - i; j++) { // 内层循环控制每一轮比较的次数 - // 如果前一个元素比后一个元素大，则交换它们的位置 - if (a[j] > a[j + 1]) { - int temp = a[j]; - a[j] = a[j + 1]; - a[j + 1] = temp; - } - } - } -} //end diff --git a/codes/gui8989/11228793.java b/codes/gui8989/11228793.java deleted file mode 100644 index 24b49b4b1fd01d1f21be8b362a582158452e41d3..0000000000000000000000000000000000000000 --- a/codes/gui8989/11228793.java +++ /dev/null @@ -1,19 +0,0 @@ -/** - * 冒泡排序函数 - * aa bb cc - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - // 你的代码，使无序数组 a 变得有序 - for(int i = 0 ; i < n - 1 ; i++){ - for(int j = 0 ; j < n - 1 - i ; j++){ - if(a[j] > a[j + 1]){ - int tmp = a[j]; - a[j] = a[j + 1]; - a[j + 1] = tmp; - } - } - } - -} //end \ No newline at end of file diff --git a/codes/gujian3724/15541800.java b/codes/gujian3724/15541800.java deleted file mode 100644 index c2157ca539b033e4736d5a6d1745f3f74bdc4b51..0000000000000000000000000000000000000000 --- a/codes/gujian3724/15541800.java +++ /dev/null @@ -1,17 +0,0 @@ -/** - * 冒泡排序函数 - * 将无序数组通过冒泡排序变得有序 - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int[] a, int n) { - for (int i = 0; i < n - 1; i++) { // 外层循环控制排序趟数 - for (int j = 0; j < n - i - 1; j++) { // 内层循环控制每一趟排序多少次 - if (a[j] > a[j + 1]) { // 如果前一个元素大于后一个元素，则交换它们的位置 - int temp = a[j]; - a[j] = a[j + 1]; - a[j + 1] = temp; - } - } - } -} //end diff --git a/codes/gunange/.keep b/codes/gunange/.keep deleted file mode 100644 index e69de29bb2d1d6434b8b29ae775ad8c2e48c5391..0000000000000000000000000000000000000000 diff --git a/codes/gunange/15846499.java b/codes/gunange/15846499.java deleted file mode 100644 index 6426772fb479b07ed3be21ef1867921d1dbb194c..0000000000000000000000000000000000000000 --- a/codes/gunange/15846499.java +++ /dev/null @@ -1,20 +0,0 @@ -/** - * 冒泡排序函数 - * aa bb cc - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - // 你的代码，使无序数组 a 变得有序 - for(int i = 0; i < n; i++) { - for(int j = 0; j < n - i - 1; j++) { - if(a[j] > a[j + 1]) { - int temp = a[j]; - a [j] = a[j + 1]; - a[j + 1] = temp; - } - } - } - - -} //end \ No newline at end of file diff --git a/codes/guoguoya/15742850.java b/codes/guoguoya/15742850.java deleted file mode 100644 index 987377810b5beca8eb4bf5eafeee5db45e234a87..0000000000000000000000000000000000000000 --- a/codes/guoguoya/15742850.java +++ /dev/null @@ -1,20 +0,0 @@ -/** - * 冒泡排序函数 - * aa bb cc - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - // 你的代码，使无序数组 a 变得有序 - for(int i = 0; i < n; i++) { - for(int liuy = 0; liuy < n - i - 1; liuy++) { - if(a[liuy] > a[liuy + 1]) { - int temp = a[liuy]; - a [liuy] = a[liuy + 1]; - a[liuy + 1] = temp; - } - } - } - - -} //end,liuy diff --git a/codes/gwya123/15699461.java b/codes/gwya123/15699461.java deleted file mode 100644 index 987377810b5beca8eb4bf5eafeee5db45e234a87..0000000000000000000000000000000000000000 --- a/codes/gwya123/15699461.java +++ /dev/null @@ -1,20 +0,0 @@ -/** - * 冒泡排序函数 - * aa bb cc - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - // 你的代码，使无序数组 a 变得有序 - for(int i = 0; i < n; i++) { - for(int liuy = 0; liuy < n - i - 1; liuy++) { - if(a[liuy] > a[liuy + 1]) { - int temp = a[liuy]; - a [liuy] = a[liuy + 1]; - a[liuy + 1] = temp; - } - } - } - - -} //end,liuy diff --git a/codes/h178414/.keep b/codes/h178414/.keep deleted file mode 100644 index e69de29bb2d1d6434b8b29ae775ad8c2e48c5391..0000000000000000000000000000000000000000 diff --git a/codes/h178414/15842656.java b/codes/h178414/15842656.java deleted file mode 100644 index 6e9861fa3ec6d5a2553cdccd1bb1e977430c671b..0000000000000000000000000000000000000000 --- a/codes/h178414/15842656.java +++ /dev/null @@ -1,19 +0,0 @@ -/** - * 冒泡排序函数 - * aa bb cc - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - // 你的代码，使无序数组 a 变得有序 - for (int i = 0; i < n - 1; i++) { - for (int j = 0; j < n - i - 1; j++) { - if (a[j] > a[j + 1]) { - - int temp = a[j]; - a[j] = a[j + 1]; - a[j + 1] = temp; - } - } - } -} //end \ No newline at end of file diff --git a/codes/h295276/15685251.java b/codes/h295276/15685251.java deleted file mode 100644 index 584706c9dc0b96b832073b89ac9276cb3a135390..0000000000000000000000000000000000000000 --- a/codes/h295276/15685251.java +++ /dev/null @@ -1,18 +0,0 @@ -/** - * 冒泡排序函数 - * 使用冒泡排序算法对数组进行升序排序 - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int[] a, int n){ - for (int i = 0; i < n - 1; i++) { // 外层循环，表示所有轮数 - for (int j = 0; j < n - i - 1; j++) { // 内层循环，表示每轮比较的次数 - // 如果前一个元素大于后一个元素，则交换位置 - if (a[j] > a[j + 1]) { - int temp = a[j]; - a[j] = a[j + 1]; - a[j + 1] = temp; - } - } - } -} // end diff --git a/codes/h4ppyguys/.keep b/codes/h4ppyguys/.keep deleted file mode 100644 index e69de29bb2d1d6434b8b29ae775ad8c2e48c5391..0000000000000000000000000000000000000000 diff --git a/codes/h4ppyguys/15843449.java b/codes/h4ppyguys/15843449.java deleted file mode 100644 index 6e9861fa3ec6d5a2553cdccd1bb1e977430c671b..0000000000000000000000000000000000000000 --- a/codes/h4ppyguys/15843449.java +++ /dev/null @@ -1,19 +0,0 @@ -/** - * 冒泡排序函数 - * aa bb cc - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - // 你的代码，使无序数组 a 变得有序 - for (int i = 0; i < n - 1; i++) { - for (int j = 0; j < n - i - 1; j++) { - if (a[j] > a[j + 1]) { - - int temp = a[j]; - a[j] = a[j + 1]; - a[j + 1] = temp; - } - } - } -} //end \ No newline at end of file diff --git a/codes/h891539721/15718815.java b/codes/h891539721/15718815.java deleted file mode 100644 index f2b4bb4b640425b88e8a8884aab8398c2374b077..0000000000000000000000000000000000000000 --- a/codes/h891539721/15718815.java +++ /dev/null @@ -1,18 +0,0 @@ -/** - * 冒泡排序函数 - * 将无序数组通过冒泡排序算法变为有序数组 - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - for (int i = 0; i < n - 1; i++) { - for (int j = 0; j < n - i - 1; j++) { - // 如果前一个元素大于后一个元素，则交换它们的位置 - if (a[j] > a[j + 1]) { - int temp = a[j]; - a[j] = a[j + 1]; - a[j + 1] = temp; - } - } - } -} //end diff --git a/codes/h915754289/15853542.java b/codes/h915754289/15853542.java deleted file mode 100644 index db00df4317c2971d839dccd193fa0332f983ff23..0000000000000000000000000000000000000000 --- a/codes/h915754289/15853542.java +++ /dev/null @@ -1,22 +0,0 @@ -/** - * 冒泡排序函数 - * 对数组进行冒泡排序，使得数组中的元素按从小到大的顺序排列 - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int[] a, int n) { - // 外层循环控制排序趟数 - for (int i = 0; i < n - 1; i++) { - // 内层循环负责进行每趟排序，通过相邻元素的比较和交换来移动较大元素到数组的末尾 - for (int j = 0; j < n - i - 1; j++) { - // 如果前一个元素大于后一个元素，则交换它们的位置 - if (a[j] > a[j + 1]) { - // 交换元素 - int temp = a[j]; - a[j] = a[j + 1]; - a[j + 1] = temp; - } - } - } - // 经过 n-1 趟排序后，数组已经变为有序 -} // end diff --git a/codes/haha176/15759089.java b/codes/haha176/15759089.java deleted file mode 100644 index 76cbddd876f8669466e0a2651682cee667741713..0000000000000000000000000000000000000000 --- a/codes/haha176/15759089.java +++ /dev/null @@ -1,20 +0,0 @@ -/** - * 冒泡排序函数 - * aa bb cc - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - // 你的代码，使无序数组 a 变得有序 - for(int i = 0; i < n; i++) { - for(int b = 0; b < n - i - 1; b++) { - if(a[b] > a[b + 1]) { - int temp = a[b]; - a [b] = a[b + 1]; - a[b + 1] = temp; - } - } - } - - -} //end diff --git a/codes/hahalin/15846388.java b/codes/hahalin/15846388.java deleted file mode 100644 index 987377810b5beca8eb4bf5eafeee5db45e234a87..0000000000000000000000000000000000000000 --- a/codes/hahalin/15846388.java +++ /dev/null @@ -1,20 +0,0 @@ -/** - * 冒泡排序函数 - * aa bb cc - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - // 你的代码，使无序数组 a 变得有序 - for(int i = 0; i < n; i++) { - for(int liuy = 0; liuy < n - i - 1; liuy++) { - if(a[liuy] > a[liuy + 1]) { - int temp = a[liuy]; - a [liuy] = a[liuy + 1]; - a[liuy + 1] = temp; - } - } - } - - -} //end,liuy diff --git a/codes/hahane/15772179.java b/codes/hahane/15772179.java deleted file mode 100644 index 987377810b5beca8eb4bf5eafeee5db45e234a87..0000000000000000000000000000000000000000 --- a/codes/hahane/15772179.java +++ /dev/null @@ -1,20 +0,0 @@ -/** - * 冒泡排序函数 - * aa bb cc - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - // 你的代码，使无序数组 a 变得有序 - for(int i = 0; i < n; i++) { - for(int liuy = 0; liuy < n - i - 1; liuy++) { - if(a[liuy] > a[liuy + 1]) { - int temp = a[liuy]; - a [liuy] = a[liuy + 1]; - a[liuy + 1] = temp; - } - } - } - - -} //end,liuy diff --git a/codes/haihai/.keep b/codes/haihai/.keep deleted file mode 100644 index e69de29bb2d1d6434b8b29ae775ad8c2e48c5391..0000000000000000000000000000000000000000 diff --git a/codes/haihai/15860309.java b/codes/haihai/15860309.java deleted file mode 100644 index 6426772fb479b07ed3be21ef1867921d1dbb194c..0000000000000000000000000000000000000000 --- a/codes/haihai/15860309.java +++ /dev/null @@ -1,20 +0,0 @@ -/** - * 冒泡排序函数 - * aa bb cc - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - // 你的代码，使无序数组 a 变得有序 - for(int i = 0; i < n; i++) { - for(int j = 0; j < n - i - 1; j++) { - if(a[j] > a[j + 1]) { - int temp = a[j]; - a [j] = a[j + 1]; - a[j + 1] = temp; - } - } - } - - -} //end \ No newline at end of file diff --git a/codes/handleRich/11471812.java b/codes/handleRich/11471812.java deleted file mode 100644 index 8c505501c812f686a9abe78a0d1191db6085134c..0000000000000000000000000000000000000000 --- a/codes/handleRich/11471812.java +++ /dev/null @@ -1,19 +0,0 @@ -/** - * 冒泡排序函数 - * aa bb cc - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - // 你的代码，使无序数组 a 变得有序 - for(int i=0;i a[j+1]){ - int temp = a[j]; - a[j] = a[j+1]; - a[j+1] = temp; - } - } - } - -} //end \ No newline at end of file diff --git a/codes/handsonboards/.keep b/codes/handsonboards/.keep deleted file mode 100644 index e69de29bb2d1d6434b8b29ae775ad8c2e48c5391..0000000000000000000000000000000000000000 diff --git a/codes/handsonboards/15841143.java b/codes/handsonboards/15841143.java deleted file mode 100644 index 6e9861fa3ec6d5a2553cdccd1bb1e977430c671b..0000000000000000000000000000000000000000 --- a/codes/handsonboards/15841143.java +++ /dev/null @@ -1,19 +0,0 @@ -/** - * 冒泡排序函数 - * aa bb cc - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - // 你的代码，使无序数组 a 变得有序 - for (int i = 0; i < n - 1; i++) { - for (int j = 0; j < n - i - 1; j++) { - if (a[j] > a[j + 1]) { - - int temp = a[j]; - a[j] = a[j + 1]; - a[j + 1] = temp; - } - } - } -} //end \ No newline at end of file diff --git a/codes/haohua/.keep b/codes/haohua/.keep deleted file mode 100644 index e69de29bb2d1d6434b8b29ae775ad8c2e48c5391..0000000000000000000000000000000000000000 diff --git a/codes/haohua/15830974.java b/codes/haohua/15830974.java deleted file mode 100644 index 6426772fb479b07ed3be21ef1867921d1dbb194c..0000000000000000000000000000000000000000 --- a/codes/haohua/15830974.java +++ /dev/null @@ -1,20 +0,0 @@ -/** - * 冒泡排序函数 - * aa bb cc - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - // 你的代码，使无序数组 a 变得有序 - for(int i = 0; i < n; i++) { - for(int j = 0; j < n - i - 1; j++) { - if(a[j] > a[j + 1]) { - int temp = a[j]; - a [j] = a[j + 1]; - a[j + 1] = temp; - } - } - } - - -} //end \ No newline at end of file diff --git a/codes/haoranx98/.keep b/codes/haoranx98/.keep deleted file mode 100644 index e69de29bb2d1d6434b8b29ae775ad8c2e48c5391..0000000000000000000000000000000000000000 diff --git a/codes/haoranx98/10039365.java b/codes/haoranx98/10039365.java deleted file mode 100644 index bd946e56245f533d12d032156931f19b418c55a5..0000000000000000000000000000000000000000 --- a/codes/haoranx98/10039365.java +++ /dev/null @@ -1,17 +0,0 @@ - /* 冒泡排序函数 - * aa bb cc - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - // 你的代码，使无序数组 a 变得有序 - for (int i = 0; i < n; i++) { - for (int j = 0; j < i; j++) { - if (a[i] < a[j]) { - int t = a[i]; - a[i] = a[j]; - a[j] = t; - } - } - } -} //end \ No newline at end of file diff --git a/codes/happymo/11212155.java b/codes/happymo/11212155.java deleted file mode 100644 index 272a12fc81d3dd0e857bba9ae001c15818fb7123..0000000000000000000000000000000000000000 --- a/codes/happymo/11212155.java +++ /dev/null @@ -1,18 +0,0 @@ - /** - * 冒泡排序函数 - * aa bb cc - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ - public static void bubbleSort(int [] arr, int n){ - // 你的代码，使无序数组 a 变得有序 - for (int i = 0; i < n; i++) { - for (int j = (i + 1); j < n; j++) { - if (arr[i] > arr[j]) { - int temp = arr[i]; - arr[i] = arr[j]; - arr[j] = temp; - } - } - } - } //end \ No newline at end of file diff --git a/codes/hatjs880328/.keep b/codes/hatjs880328/.keep deleted file mode 100644 index e69de29bb2d1d6434b8b29ae775ad8c2e48c5391..0000000000000000000000000000000000000000 diff --git a/codes/hatjs880328/15779413.java b/codes/hatjs880328/15779413.java deleted file mode 100644 index 9f86eb587f5fb5dee2fac7e589a1cf95128af5cc..0000000000000000000000000000000000000000 --- a/codes/hatjs880328/15779413.java +++ /dev/null @@ -1,18 +0,0 @@ -/** - * 冒泡排序函数 - * aa bb cc - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - // 你的代码，使无序数组 a 变得有序 - for(int i=0;ia[j+1]){ - a[j] = a[j]+a[j+1]; - a[j+1] = a[j]-a[j+1]; - a[j] = a[j]-a[j+1]; - } - } - } -} //end \ No newline at end of file diff --git a/codes/hclw_123/15865557.java b/codes/hclw_123/15865557.java deleted file mode 100644 index 3563ad5be47f9c3109f5af483f9138e8158cfa63..0000000000000000000000000000000000000000 --- a/codes/hclw_123/15865557.java +++ /dev/null @@ -1,17 +0,0 @@ -/** - * 冒泡排序函数 - * 通过相邻元素两两比较和交换，使得每一轮迭代后最大（或最小）的元素能够移动到数组的末尾。 - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int[] a, int n) { - for (int i = 0; i < n - 1; i++) { // 外层循环控制比较的轮数 - for (int j = 0; j < n - i - 1; j++) { // 内层循环控制每轮比较的次数 - if (a[j] > a[j + 1]) { // 如果前一个元素大于后一个元素，则交换它们的位置 - int temp = a[j]; - a[j] = a[j + 1]; - a[j + 1] = temp; - } - } - } -} // end diff --git a/codes/hdhd13726801083/15811090.java b/codes/hdhd13726801083/15811090.java deleted file mode 100644 index 166dea5db31166b381f11f50cf27b5f36311847d..0000000000000000000000000000000000000000 --- a/codes/hdhd13726801083/15811090.java +++ /dev/null @@ -1,19 +0,0 @@ -/** - * 冒泡排序函数 - * 该函数通过冒泡排序算法对数组进行排序 - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int[] a, int n) { - for (int i = 0; i < n - 1; i++) { // 外层循环控制比较轮数 - for (int j = 0; j < n - 1 - i; j++) { // 内层循环控制每轮的比较次数 - // 如果前一个元素大于后一个元素，则交换它们的位置 - if (a[j] > a[j + 1]) { - // 交换元素 - int temp = a[j]; - a[j] = a[j + 1]; - a[j + 1] = temp; - } - } - } -} //end diff --git a/codes/heheer/9674738.java b/codes/heheer/9674738.java deleted file mode 100644 index 3923f7078601d75004d88bf75be136d418c09154..0000000000000000000000000000000000000000 --- a/codes/heheer/9674738.java +++ /dev/null @@ -1,22 +0,0 @@ -/** - * 冒泡排序函数 - * aa bb cc - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - // 你的代码，使无序数组 a 变得有序 - int i, j; - - for(i=0; ia[j]){ - int temp; - temp = a[j-1]; - a[j-1] = a[j]; - a[j] = temp; - } - } - } - -} //end diff --git a/codes/heiheiya/15775428.java b/codes/heiheiya/15775428.java deleted file mode 100644 index 987377810b5beca8eb4bf5eafeee5db45e234a87..0000000000000000000000000000000000000000 --- a/codes/heiheiya/15775428.java +++ /dev/null @@ -1,20 +0,0 @@ -/** - * 冒泡排序函数 - * aa bb cc - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - // 你的代码，使无序数组 a 变得有序 - for(int i = 0; i < n; i++) { - for(int liuy = 0; liuy < n - i - 1; liuy++) { - if(a[liuy] > a[liuy + 1]) { - int temp = a[liuy]; - a [liuy] = a[liuy + 1]; - a[liuy + 1] = temp; - } - } - } - - -} //end,liuy diff --git a/codes/heiopx/11121859.java b/codes/heiopx/11121859.java deleted file mode 100644 index 1c8889947f924214c71a3c3f202500b4780dc281..0000000000000000000000000000000000000000 --- a/codes/heiopx/11121859.java +++ /dev/null @@ -1,11 +0,0 @@ -public static void bubbleSort(int [] a,int n){ - for(int i = 0; i < n-1 ; i++){ - for (int j = 0;j < n-1-i;j++){ - if(a[j] > a[j+1]){ - int temp = a[j]; - a[j] = a[j+1]; - a[j+1] = temp; - } - } - } -} \ No newline at end of file diff --git a/codes/helens0813/15861403.java b/codes/helens0813/15861403.java deleted file mode 100644 index 54c5f3869cd16ee9e7c2b77895a39fae63f05dbc..0000000000000000000000000000000000000000 --- a/codes/helens0813/15861403.java +++ /dev/null @@ -1,20 +0,0 @@ -/** - * 冒泡排序函数 - * aa bb cc - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - // 你的代码，使无序数组 a 变得有序 - for(int i = 0; i < n; i++) { - for(int liuy = 0; liuy < n - i - 1; liuy++) { - if(a[liuy] > a[liuy + 1]) { - int temp = a[liuy]; - a [liuy] = a[liuy + 1]; - a[liuy + 1] = temp; - } - } - } - - -} //end,liuy \ No newline at end of file diff --git a/codes/helloAnhusts/.keep b/codes/helloAnhusts/.keep deleted file mode 100644 index e69de29bb2d1d6434b8b29ae775ad8c2e48c5391..0000000000000000000000000000000000000000 diff --git a/codes/helloAnhusts/15846366.java b/codes/helloAnhusts/15846366.java deleted file mode 100644 index 6e9861fa3ec6d5a2553cdccd1bb1e977430c671b..0000000000000000000000000000000000000000 --- a/codes/helloAnhusts/15846366.java +++ /dev/null @@ -1,19 +0,0 @@ -/** - * 冒泡排序函数 - * aa bb cc - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - // 你的代码，使无序数组 a 变得有序 - for (int i = 0; i < n - 1; i++) { - for (int j = 0; j < n - i - 1; j++) { - if (a[j] > a[j + 1]) { - - int temp = a[j]; - a[j] = a[j + 1]; - a[j + 1] = temp; - } - } - } -} //end \ No newline at end of file diff --git a/codes/helloY_Y/15644488.java b/codes/helloY_Y/15644488.java deleted file mode 100644 index a644c1f63a52c77f1b4e9e66c5d629157ab6d7a0..0000000000000000000000000000000000000000 --- a/codes/helloY_Y/15644488.java +++ /dev/null @@ -1,19 +0,0 @@ -/** - * 冒泡排序函数 - * aa bb cc - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - // 你的代码，使无序数组 a 变得有序 - for (int i = 0; i < n - 1; i++) { - for (int j = 0; j < n - 1 - i; j++) { - if (a[j] > a[j + 1]) { - int temp = a[j]; - a[j] = a[j + 1]; - a[j + 1] = temp; - } - } - } -} //end - diff --git a/codes/heshu1/15640537.java b/codes/heshu1/15640537.java deleted file mode 100644 index c2afaa2414da1853e4500b02c6de9068b64aeafe..0000000000000000000000000000000000000000 --- a/codes/heshu1/15640537.java +++ /dev/null @@ -1,18 +0,0 @@ -/** - * 冒泡排序函数 - * aa bb cc - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - for(int i = 0; i < n-1 ; i++){ - for (int j = 0;j < n-1-i;j++){ - if(a[j] > a[j+1]){ - int temp = a[j]; - a[j] = a[j+1]; - a[j+1] = temp; - } - } - } - -} //end diff --git a/codes/hfghst45645d/.keep b/codes/hfghst45645d/.keep deleted file mode 100644 index e69de29bb2d1d6434b8b29ae775ad8c2e48c5391..0000000000000000000000000000000000000000 diff --git a/codes/hfghst45645d/15831264.java b/codes/hfghst45645d/15831264.java deleted file mode 100644 index 6e9861fa3ec6d5a2553cdccd1bb1e977430c671b..0000000000000000000000000000000000000000 --- a/codes/hfghst45645d/15831264.java +++ /dev/null @@ -1,19 +0,0 @@ -/** - * 冒泡排序函数 - * aa bb cc - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - // 你的代码，使无序数组 a 变得有序 - for (int i = 0; i < n - 1; i++) { - for (int j = 0; j < n - i - 1; j++) { - if (a[j] > a[j + 1]) { - - int temp = a[j]; - a[j] = a[j + 1]; - a[j + 1] = temp; - } - } - } -} //end \ No newline at end of file diff --git a/codes/hh456123/15721443.java b/codes/hh456123/15721443.java deleted file mode 100644 index 824031d9473ef3c11d89a1c1419f02422ae423fe..0000000000000000000000000000000000000000 --- a/codes/hh456123/15721443.java +++ /dev/null @@ -1,19 +0,0 @@ -/** - * 冒泡排序函数 - * 通过重复地遍历要排序的数列，一次比较两个元素，如果他们的顺序错误就把他们交换过来。 - * 遍历数列的工作是重复地进行直到没有再需要交换，也就是说该数列已经排序完成。 - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - for (int i = 0; i < n - 1; i++) { // 外层循环控制排序趟数 - for (int j = 0; j < n - 1 - i; j++) { // 内层循环控制每趟排序多少次 - if (a[j] > a[j + 1]) { // 如果前一个元素大于后一个元素，则交换它们 - int temp = a[j]; - a[j] = a[j + 1]; - a[j + 1] = temp; - } - } - } -} //end - diff --git a/codes/hhhh2160350883/15855109.java b/codes/hhhh2160350883/15855109.java deleted file mode 100644 index db00df4317c2971d839dccd193fa0332f983ff23..0000000000000000000000000000000000000000 --- a/codes/hhhh2160350883/15855109.java +++ /dev/null @@ -1,22 +0,0 @@ -/** - * 冒泡排序函数 - * 对数组进行冒泡排序，使得数组中的元素按从小到大的顺序排列 - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int[] a, int n) { - // 外层循环控制排序趟数 - for (int i = 0; i < n - 1; i++) { - // 内层循环负责进行每趟排序，通过相邻元素的比较和交换来移动较大元素到数组的末尾 - for (int j = 0; j < n - i - 1; j++) { - // 如果前一个元素大于后一个元素，则交换它们的位置 - if (a[j] > a[j + 1]) { - // 交换元素 - int temp = a[j]; - a[j] = a[j + 1]; - a[j + 1] = temp; - } - } - } - // 经过 n-1 趟排序后，数组已经变为有序 -} // end diff --git a/codes/hhj123/15639946.java b/codes/hhj123/15639946.java deleted file mode 100644 index c2afaa2414da1853e4500b02c6de9068b64aeafe..0000000000000000000000000000000000000000 --- a/codes/hhj123/15639946.java +++ /dev/null @@ -1,18 +0,0 @@ -/** - * 冒泡排序函数 - * aa bb cc - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - for(int i = 0; i < n-1 ; i++){ - for (int j = 0;j < n-1-i;j++){ - if(a[j] > a[j+1]){ - int temp = a[j]; - a[j] = a[j+1]; - a[j+1] = temp; - } - } - } - -} //end diff --git a/codes/hhmdsb/15837956.java b/codes/hhmdsb/15837956.java deleted file mode 100644 index 47e0d6efa8bfa49fe95c91537dccda0c09563b63..0000000000000000000000000000000000000000 --- a/codes/hhmdsb/15837956.java +++ /dev/null @@ -1,18 +0,0 @@ -/** - * 冒泡排序函数 - * 功能：对数组进行升序排序 - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int[] a, int n) { - for (int i = 0; i < n - 1; i++) { // 遍历数组，从第一个元素到倒数第二个元素 - for (int j = 0; j < n - 1 - i; j++) { // 每次比较相邻的元素，最后一个元素已经是当前轮的最大值，无需再比较 - if (a[j] > a[j + 1]) { // 如果前一个元素大于后一个元素，则交换它们的位置 - // 交换 a[j] 和 a[j+1] - int temp = a[j]; - a[j] = a[j + 1]; - a[j + 1] = temp; - } - } - } -} // end diff --git a/codes/hjh13525117665/15856794.java b/codes/hjh13525117665/15856794.java deleted file mode 100644 index 271d2f1dfec9c226694fa24afe300e49f150ca51..0000000000000000000000000000000000000000 --- a/codes/hjh13525117665/15856794.java +++ /dev/null @@ -1,18 +0,0 @@ -/** - * 冒泡排序函数 - * 将数组a按照从小到大的顺序排序 - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int[] a, int n) { - for (int i = 0; i < n - 1; i++) { // 外层循环，决定冒泡的趟数 - for (int j = 0; j < n - 1 - i; j++) { // 内层循环，决定每趟比较的次数 - if (a[j] > a[j + 1]) { // 如果当前元素大于下一个元素，则交换它们的位置 - // 交换a[j]和a[j + 1] - int temp = a[j]; - a[j] = a[j + 1]; - a[j + 1] = temp; - } - } - } -} // end diff --git a/codes/hlsscoder/15606370.java b/codes/hlsscoder/15606370.java deleted file mode 100644 index 9de98c3feda56594aba5c4720c49ec34b7158aa0..0000000000000000000000000000000000000000 --- a/codes/hlsscoder/15606370.java +++ /dev/null @@ -1,20 +0,0 @@ -/** - * 冒泡排序函数 - * 对数组进行冒泡排序，使其变得有序 - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int[] a, int n) { - // 外层循环，控制需要排序的轮数 - for (int i = 0; i < n - 1; i++) { - // 内层循环，控制每轮需要比较的次数 - for (int j = 0; j < n - 1 - i; j++) { - // 如果当前元素大于下一个元素，则交换它们的位置 - if (a[j] > a[j + 1]) { - int temp = a[j]; - a[j] = a[j + 1]; - a[j + 1] = temp; - } - } - } -} // end diff --git a/codes/hly123/.keep b/codes/hly123/.keep deleted file mode 100644 index e69de29bb2d1d6434b8b29ae775ad8c2e48c5391..0000000000000000000000000000000000000000 diff --git a/codes/hly123/10984210.java b/codes/hly123/10984210.java deleted file mode 100644 index 9eccfac593dd84bb4c285d230d4de6b8c72a1d65..0000000000000000000000000000000000000000 --- a/codes/hly123/10984210.java +++ /dev/null @@ -1,11 +0,0 @@ -public static void bubbleSort(int [] a, int n) { - for (int i=0 ; ia[j+1]) { - int temp=a[j]; - a[j]=a[j+1]; - a[j+1]=temp; - } - } - } -} diff --git a/codes/hly252984658/.keep b/codes/hly252984658/.keep deleted file mode 100644 index e69de29bb2d1d6434b8b29ae775ad8c2e48c5391..0000000000000000000000000000000000000000 diff --git a/codes/hly252984658/10979977.java b/codes/hly252984658/10979977.java deleted file mode 100644 index 9eccfac593dd84bb4c285d230d4de6b8c72a1d65..0000000000000000000000000000000000000000 --- a/codes/hly252984658/10979977.java +++ /dev/null @@ -1,11 +0,0 @@ -public static void bubbleSort(int [] a, int n) { - for (int i=0 ; ia[j+1]) { - int temp=a[j]; - a[j]=a[j+1]; - a[j+1]=temp; - } - } - } -} diff --git a/codes/hnn111/15577556.java b/codes/hnn111/15577556.java deleted file mode 100644 index 25b3bbe48bce467063cee5629079bc6a1504a0ec..0000000000000000000000000000000000000000 --- a/codes/hnn111/15577556.java +++ /dev/null @@ -1,18 +0,0 @@ -/** - * 冒泡排序函数 - * aa bb cc - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - // 你的代码，使无序数组 a 变得有序 - for(int i = 0; i < n-1 ; i++){ - for (int j = 0;j < n-1-i;j++){ - if(a[j] > a[j+1]){ - int temp = a[j]; - a[j] = a[j+1]; - a[j+1] = temp; - } - } - } -} //end diff --git a/codes/honghongwa/15846459.java b/codes/honghongwa/15846459.java deleted file mode 100644 index 987377810b5beca8eb4bf5eafeee5db45e234a87..0000000000000000000000000000000000000000 --- a/codes/honghongwa/15846459.java +++ /dev/null @@ -1,20 +0,0 @@ -/** - * 冒泡排序函数 - * aa bb cc - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - // 你的代码，使无序数组 a 变得有序 - for(int i = 0; i < n; i++) { - for(int liuy = 0; liuy < n - i - 1; liuy++) { - if(a[liuy] > a[liuy + 1]) { - int temp = a[liuy]; - a [liuy] = a[liuy + 1]; - a[liuy + 1] = temp; - } - } - } - - -} //end,liuy diff --git a/codes/hongshen/.keep b/codes/hongshen/.keep deleted file mode 100644 index e69de29bb2d1d6434b8b29ae775ad8c2e48c5391..0000000000000000000000000000000000000000 diff --git a/codes/hongshen/10039145.java b/codes/hongshen/10039145.java deleted file mode 100644 index 64e1f42376f0de61f9abfeab40d9746c5e337561..0000000000000000000000000000000000000000 --- a/codes/hongshen/10039145.java +++ /dev/null @@ -1,21 +0,0 @@ -/** - * 冒泡排序函数 - * aa bb cc - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - // 你的代码，使无序数组 a 变得有序 - for (int i = 0; i < n - 1; i++) - { - for (int j = 0; j < n - 1 - i; j++) - { - if (a[j] > a[j+1]) - { - int temp = a[j+1]; - a[j+1] = a[j]; - a[j] = temp; - } - } - } -} //end \ No newline at end of file diff --git a/codes/hongxia/15876230.java b/codes/hongxia/15876230.java deleted file mode 100644 index 14984b85ffa2111df883df4858ac150a950766e3..0000000000000000000000000000000000000000 --- a/codes/hongxia/15876230.java +++ /dev/null @@ -1,26 +0,0 @@ -/** - * 冒泡排序函数 - * 通过多次遍历数组，每次比较相邻元素并交换位置，使得较大的元素逐渐“浮”到数组的末尾。 - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - for (int i = 0; i < n - 1; i++) { - // 每一轮排序的标记，用于判断是否有交换发生 - boolean swapped = false; - for (int j = 0; j < n - i - 1; j++) { - // 如果当前元素大于下一个元素，则交换它们的位置 - if (a[j] > a[j + 1]) { - int temp = a[j]; - a[j] = a[j + 1]; - a[j + 1] = temp; - // 标记有交换发生 - swapped = true; - } - } - // 如果这一轮没有发生交换，说明数组已经有序，直接退出循环 - if (!swapped) { - break; - } - } -} //end diff --git a/codes/hongyaya/15683533.java b/codes/hongyaya/15683533.java deleted file mode 100644 index 987377810b5beca8eb4bf5eafeee5db45e234a87..0000000000000000000000000000000000000000 --- a/codes/hongyaya/15683533.java +++ /dev/null @@ -1,20 +0,0 @@ -/** - * 冒泡排序函数 - * aa bb cc - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - // 你的代码，使无序数组 a 变得有序 - for(int i = 0; i < n; i++) { - for(int liuy = 0; liuy < n - i - 1; liuy++) { - if(a[liuy] > a[liuy + 1]) { - int temp = a[liuy]; - a [liuy] = a[liuy + 1]; - a[liuy + 1] = temp; - } - } - } - - -} //end,liuy diff --git a/codes/hongyu551600/15868757.java b/codes/hongyu551600/15868757.java deleted file mode 100644 index 24f513b3219ac31ac3dcffe774647aa7bfdac254..0000000000000000000000000000000000000000 --- a/codes/hongyu551600/15868757.java +++ /dev/null @@ -1,11 +0,0 @@ -public static void bubbleSort(int [] a, int n){ - for (int i = 0; i < n - 1; i++) { - for (int j = 0; j < n - 1 - i; j++) { - if (a[j] > a[j + 1]) { - int temp = a[j]; - a[j] = a[j + 1]; - a[j + 1] = temp; - } - } - } -} diff --git a/codes/hopekai/15586507.java b/codes/hopekai/15586507.java deleted file mode 100644 index ae82e695cbfd360050241c3f1f592658c8c1d4e7..0000000000000000000000000000000000000000 --- a/codes/hopekai/15586507.java +++ /dev/null @@ -1,35 +0,0 @@ -/** - - * 冒泡排序函数 - - * aa bb cc - - * @param a 待排序的数组 - - * @param n 待排序的数组长度 - - */ - -public static void bubbleSort(int [] a, int n){ - - for(int i = 0; i < n-1 ; i++){ - - for (int j = 0;j < n-1-i;j++){ - - if(a[j] > a[j+1]){ - - int temp = a[j]; - - a[j] = a[j+1]; - - a[j+1] = temp; - - } - - } - - } - - - -} //end diff --git a/codes/houhouya/15778311.java b/codes/houhouya/15778311.java deleted file mode 100644 index 987377810b5beca8eb4bf5eafeee5db45e234a87..0000000000000000000000000000000000000000 --- a/codes/houhouya/15778311.java +++ /dev/null @@ -1,20 +0,0 @@ -/** - * 冒泡排序函数 - * aa bb cc - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - // 你的代码，使无序数组 a 变得有序 - for(int i = 0; i < n; i++) { - for(int liuy = 0; liuy < n - i - 1; liuy++) { - if(a[liuy] > a[liuy + 1]) { - int temp = a[liuy]; - a [liuy] = a[liuy + 1]; - a[liuy + 1] = temp; - } - } - } - - -} //end,liuy diff --git a/codes/hua0x522/10375834.java b/codes/hua0x522/10375834.java deleted file mode 100644 index f04a8c13091802663ec364ff5aff01be6a4f33f9..0000000000000000000000000000000000000000 --- a/codes/hua0x522/10375834.java +++ /dev/null @@ -1,20 +0,0 @@ -/** - * 冒泡排序函数 - * aa bb cc - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - // 你的代码，使无序数组 a 变得有序 - for (int i = 0; i < n; i++) { - for (int j = 0; j < n; j++) { - if (j < n-1 && a[j] > a[j+1]) { - int temp = a[j]; - a[j] = a[j+1]; - a[j+1] = temp; - } - } - } - -} //end - diff --git a/codes/huaano/15772611.java b/codes/huaano/15772611.java deleted file mode 100644 index 987377810b5beca8eb4bf5eafeee5db45e234a87..0000000000000000000000000000000000000000 --- a/codes/huaano/15772611.java +++ /dev/null @@ -1,20 +0,0 @@ -/** - * 冒泡排序函数 - * aa bb cc - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - // 你的代码，使无序数组 a 变得有序 - for(int i = 0; i < n; i++) { - for(int liuy = 0; liuy < n - i - 1; liuy++) { - if(a[liuy] > a[liuy + 1]) { - int temp = a[liuy]; - a [liuy] = a[liuy + 1]; - a[liuy + 1] = temp; - } - } - } - - -} //end,liuy diff --git a/codes/hualine/15772389.java b/codes/hualine/15772389.java deleted file mode 100644 index 987377810b5beca8eb4bf5eafeee5db45e234a87..0000000000000000000000000000000000000000 --- a/codes/hualine/15772389.java +++ /dev/null @@ -1,20 +0,0 @@ -/** - * 冒泡排序函数 - * aa bb cc - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - // 你的代码，使无序数组 a 变得有序 - for(int i = 0; i < n; i++) { - for(int liuy = 0; liuy < n - i - 1; liuy++) { - if(a[liuy] > a[liuy + 1]) { - int temp = a[liuy]; - a [liuy] = a[liuy + 1]; - a[liuy + 1] = temp; - } - } - } - - -} //end,liuy diff --git a/codes/huang856/.keep b/codes/huang856/.keep deleted file mode 100644 index e69de29bb2d1d6434b8b29ae775ad8c2e48c5391..0000000000000000000000000000000000000000 diff --git a/codes/huang856/10982875.java b/codes/huang856/10982875.java deleted file mode 100644 index 9eccfac593dd84bb4c285d230d4de6b8c72a1d65..0000000000000000000000000000000000000000 --- a/codes/huang856/10982875.java +++ /dev/null @@ -1,11 +0,0 @@ -public static void bubbleSort(int [] a, int n) { - for (int i=0 ; ia[j+1]) { - int temp=a[j]; - a[j]=a[j+1]; - a[j+1]=temp; - } - } - } -} diff --git a/codes/huangduoyan2024/.I94UY3.java.swp b/codes/huangduoyan2024/.I94UY3.java.swp deleted file mode 100644 index 95d65cb9d367ae30eaa2cf42eaa8960a6eedfe9e..0000000000000000000000000000000000000000 Binary files a/codes/huangduoyan2024/.I94UY3.java.swp and /dev/null differ diff --git a/codes/huangduoyan2024/15343275.java b/codes/huangduoyan2024/15343275.java deleted file mode 100644 index 33f047c9c105c273675449f1bd2f3d9631fb127f..0000000000000000000000000000000000000000 --- a/codes/huangduoyan2024/15343275.java +++ /dev/null @@ -1,12 +0,0 @@ -public static void bubbleSort(int a[], int n) -{ - for (int i = 0; i < n - 1; i++) { - for (int j = n - 1; j > i; j--) { - if (a[j] < a[j - 1]) { - int t = a[j]; - a[j] = a[j - 1]; - a[j - 1] = t; - } - } - } -} diff --git a/codes/huangwenli666/15867725.java b/codes/huangwenli666/15867725.java deleted file mode 100644 index 24f513b3219ac31ac3dcffe774647aa7bfdac254..0000000000000000000000000000000000000000 --- a/codes/huangwenli666/15867725.java +++ /dev/null @@ -1,11 +0,0 @@ -public static void bubbleSort(int [] a, int n){ - for (int i = 0; i < n - 1; i++) { - for (int j = 0; j < n - 1 - i; j++) { - if (a[j] > a[j + 1]) { - int temp = a[j]; - a[j] = a[j + 1]; - a[j + 1] = temp; - } - } - } -} diff --git a/codes/huangxiaoyan/10971566.java b/codes/huangxiaoyan/10971566.java deleted file mode 100644 index deb2438785c696d09e985c35997c2f2bc5445a90..0000000000000000000000000000000000000000 --- a/codes/huangxiaoyan/10971566.java +++ /dev/null @@ -1,18 +0,0 @@ -/** - * 冒泡排序函数 - * aa bb cc - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - // 你的代码，使无序数组 a 变得有序 - for (int i=0 ; ia[k+1]) { - int temp=a[k]; - a[k]=a[k+1]; - a[k+1]=temp; - } - } - } -} //end \ No newline at end of file diff --git a/codes/huangzi/.keep b/codes/huangzi/.keep deleted file mode 100644 index e69de29bb2d1d6434b8b29ae775ad8c2e48c5391..0000000000000000000000000000000000000000 diff --git a/codes/huangzi/15867961.java b/codes/huangzi/15867961.java deleted file mode 100644 index 6426772fb479b07ed3be21ef1867921d1dbb194c..0000000000000000000000000000000000000000 --- a/codes/huangzi/15867961.java +++ /dev/null @@ -1,20 +0,0 @@ -/** - * 冒泡排序函数 - * aa bb cc - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - // 你的代码，使无序数组 a 变得有序 - for(int i = 0; i < n; i++) { - for(int j = 0; j < n - i - 1; j++) { - if(a[j] > a[j + 1]) { - int temp = a[j]; - a [j] = a[j + 1]; - a[j + 1] = temp; - } - } - } - - -} //end \ No newline at end of file diff --git a/codes/huanji1212/.keep b/codes/huanji1212/.keep deleted file mode 100644 index e69de29bb2d1d6434b8b29ae775ad8c2e48c5391..0000000000000000000000000000000000000000 diff --git a/codes/huanji1212/15860624.java b/codes/huanji1212/15860624.java deleted file mode 100644 index 54c5f3869cd16ee9e7c2b77895a39fae63f05dbc..0000000000000000000000000000000000000000 --- a/codes/huanji1212/15860624.java +++ /dev/null @@ -1,20 +0,0 @@ -/** - * 冒泡排序函数 - * aa bb cc - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - // 你的代码，使无序数组 a 变得有序 - for(int i = 0; i < n; i++) { - for(int liuy = 0; liuy < n - i - 1; liuy++) { - if(a[liuy] > a[liuy + 1]) { - int temp = a[liuy]; - a [liuy] = a[liuy + 1]; - a[liuy + 1] = temp; - } - } - } - - -} //end,liuy \ No newline at end of file diff --git a/codes/huanjiyan/15607160.java b/codes/huanjiyan/15607160.java deleted file mode 100644 index ae82e695cbfd360050241c3f1f592658c8c1d4e7..0000000000000000000000000000000000000000 --- a/codes/huanjiyan/15607160.java +++ /dev/null @@ -1,35 +0,0 @@ -/** - - * 冒泡排序函数 - - * aa bb cc - - * @param a 待排序的数组 - - * @param n 待排序的数组长度 - - */ - -public static void bubbleSort(int [] a, int n){ - - for(int i = 0; i < n-1 ; i++){ - - for (int j = 0;j < n-1-i;j++){ - - if(a[j] > a[j+1]){ - - int temp = a[j]; - - a[j] = a[j+1]; - - a[j+1] = temp; - - } - - } - - } - - - -} //end diff --git a/codes/huankuai/.java b/codes/huankuai/.java deleted file mode 100644 index e69de29bb2d1d6434b8b29ae775ad8c2e48c5391..0000000000000000000000000000000000000000 diff --git a/codes/huankuai/9962039.java b/codes/huankuai/9962039.java deleted file mode 100644 index 82b73c8ff8181a822b4e5b9b4a74866761c7b1ca..0000000000000000000000000000000000000000 --- a/codes/huankuai/9962039.java +++ /dev/null @@ -1,20 +0,0 @@ -/** - * 冒泡排序函数 - * aa bb cc - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - // 你的代码，使无序数组 a 变得有序 - for(int i = 0 ; i < n - 1 ; i++){ - for(int j = 0 ; j < n - 1 - i ; j++){ - if(a[j] > a[j + 1]){ - int tmp = a[j]; - a[j] = a[j + 1]; - a[j + 1] = tmp; - } - } - } - -} //end - diff --git a/codes/huliangsheng/.keep b/codes/huliangsheng/.keep deleted file mode 100644 index e69de29bb2d1d6434b8b29ae775ad8c2e48c5391..0000000000000000000000000000000000000000 diff --git a/codes/huliangsheng/15759181.java b/codes/huliangsheng/15759181.java deleted file mode 100644 index d40803fb8fd6db6216a346341ff5180f0b773922..0000000000000000000000000000000000000000 --- a/codes/huliangsheng/15759181.java +++ /dev/null @@ -1,20 +0,0 @@ -/** - * 冒泡排序函数 - * aa bb cc - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - // 你的代码，使无序数组 a 变得有序 - for(int i = 0; i < n; i++) { - for(int j = 0; j < n - i - 1; j++) { - if(a[j] > a[j + 1]) { - int temp = a[j]; - a [j] = a[j + 1]; - a[j + 1] = temp; - } - } - } - - -} //end \ No newline at end of file diff --git a/codes/hunking/.keep b/codes/hunking/.keep deleted file mode 100644 index e69de29bb2d1d6434b8b29ae775ad8c2e48c5391..0000000000000000000000000000000000000000 diff --git a/codes/hunking/15845445.java b/codes/hunking/15845445.java deleted file mode 100644 index 6426772fb479b07ed3be21ef1867921d1dbb194c..0000000000000000000000000000000000000000 --- a/codes/hunking/15845445.java +++ /dev/null @@ -1,20 +0,0 @@ -/** - * 冒泡排序函数 - * aa bb cc - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - // 你的代码，使无序数组 a 变得有序 - for(int i = 0; i < n; i++) { - for(int j = 0; j < n - i - 1; j++) { - if(a[j] > a[j + 1]) { - int temp = a[j]; - a [j] = a[j + 1]; - a[j + 1] = temp; - } - } - } - - -} //end \ No newline at end of file diff --git a/codes/hunzita/.keep b/codes/hunzita/.keep deleted file mode 100644 index e69de29bb2d1d6434b8b29ae775ad8c2e48c5391..0000000000000000000000000000000000000000 diff --git a/codes/hunzita/15850843.java b/codes/hunzita/15850843.java deleted file mode 100644 index 6426772fb479b07ed3be21ef1867921d1dbb194c..0000000000000000000000000000000000000000 --- a/codes/hunzita/15850843.java +++ /dev/null @@ -1,20 +0,0 @@ -/** - * 冒泡排序函数 - * aa bb cc - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - // 你的代码，使无序数组 a 变得有序 - for(int i = 0; i < n; i++) { - for(int j = 0; j < n - i - 1; j++) { - if(a[j] > a[j + 1]) { - int temp = a[j]; - a [j] = a[j + 1]; - a[j + 1] = temp; - } - } - } - - -} //end \ No newline at end of file diff --git a/codes/huoyin/15864042.java b/codes/huoyin/15864042.java deleted file mode 100644 index ae82e695cbfd360050241c3f1f592658c8c1d4e7..0000000000000000000000000000000000000000 --- a/codes/huoyin/15864042.java +++ /dev/null @@ -1,35 +0,0 @@ -/** - - * 冒泡排序函数 - - * aa bb cc - - * @param a 待排序的数组 - - * @param n 待排序的数组长度 - - */ - -public static void bubbleSort(int [] a, int n){ - - for(int i = 0; i < n-1 ; i++){ - - for (int j = 0;j < n-1-i;j++){ - - if(a[j] > a[j+1]){ - - int temp = a[j]; - - a[j] = a[j+1]; - - a[j+1] = temp; - - } - - } - - } - - - -} //end diff --git a/codes/huqi88/15222808.java b/codes/huqi88/15222808.java deleted file mode 100644 index ce2dfba6b2a040d5c8796bd2c0f8a388ff9bda17..0000000000000000000000000000000000000000 --- a/codes/huqi88/15222808.java +++ /dev/null @@ -1,20 +0,0 @@ -/** - * 冒泡排序函数 - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ - public static void bubbleSort(int[] a, int n) { - if (n <= 1) { - return; // 如果数组长度为0或1，则不需要排序 - } - - for (int i = 0; i < n - 1; i++) { // 外层循环控制遍历次数 - for (int j = 0; j < n - i - 1; j++) { // 内层循环控制每次比较的元素 - if (a[j] > a[j + 1]) { // 如果前一个元素大于后一个元素，则交换它们 - int temp = a[j]; - a[j] = a[j + 1]; - a[j + 1] = temp; - } - } - } - } diff --git a/codes/hyk111/15779480.java b/codes/hyk111/15779480.java deleted file mode 100644 index 46da388ec87de9d26aecb462b88a19ce4a728da9..0000000000000000000000000000000000000000 --- a/codes/hyk111/15779480.java +++ /dev/null @@ -1,18 +0,0 @@ -/** - * 冒泡排序函数 - * 通过对相邻元素的比较和交换，将较大的元素逐渐“浮”到数组的末尾，从而完成排序 - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int[] a, int n) { - for (int i = 0; i < n - 1; i++) { // 外层循环控制排序趟数 - for (int j = 0; j < n - i - 1; j++) { // 内层循环控制每趟排序多少次 - // 如果前一个元素大于后一个元素，则交换它们的位置 - if (a[j] > a[j + 1]) { - int temp = a[j]; - a[j] = a[j + 1]; - a[j + 1] = temp; - } - } - } -} // end diff --git a/codes/hyk222/15829718.java b/codes/hyk222/15829718.java deleted file mode 100644 index 46da388ec87de9d26aecb462b88a19ce4a728da9..0000000000000000000000000000000000000000 --- a/codes/hyk222/15829718.java +++ /dev/null @@ -1,18 +0,0 @@ -/** - * 冒泡排序函数 - * 通过对相邻元素的比较和交换，将较大的元素逐渐“浮”到数组的末尾，从而完成排序 - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int[] a, int n) { - for (int i = 0; i < n - 1; i++) { // 外层循环控制排序趟数 - for (int j = 0; j < n - i - 1; j++) { // 内层循环控制每趟排序多少次 - // 如果前一个元素大于后一个元素，则交换它们的位置 - if (a[j] > a[j + 1]) { - int temp = a[j]; - a[j] = a[j + 1]; - a[j + 1] = temp; - } - } - } -} // end diff --git a/codes/hzhong/15527208.java b/codes/hzhong/15527208.java deleted file mode 100644 index a8d0ec5ad76b46db6e86535784ca44b6ebaee312..0000000000000000000000000000000000000000 --- a/codes/hzhong/15527208.java +++ /dev/null @@ -1,18 +0,0 @@ -/** * 冒泡排序函数 - * * aa bb cc * - * @param a 待排序的数组 * - * @param n 待排序的数组长度 */ - -public static void bubbleSort(int[] a, int n) { - for (int i = 0; i < n - 1; i++) { - for (int j = 0; j < n - 1 - i; j++) { - if (a[j] > a[j + 1]) { - // 交换a[j]和a[j+1] - int temp = a[j]; - a[j] = a[j + 1]; - a[j + 1] = temp; - } - } - } -}// end - diff --git a/codes/iHento/15964827.java b/codes/iHento/15964827.java deleted file mode 100644 index a3c6f5d5d41b5bc374c15f571303d8ffd21ce26d..0000000000000000000000000000000000000000 --- a/codes/iHento/15964827.java +++ /dev/null @@ -1,18 +0,0 @@ -/** - * 冒泡排序函数 - * aa bb cc - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - // 你的代码，使无序数组 a 变得有序 - for (int i = 0; i < n; i++) { - for (int j = 0; j < n - i - 1; j++) { - if (a[j] > a[j + 1]) { - int T = a[j]; - a[j] = a[j + 1]; - a[j + 1] = T; - } - } - } -} //end diff --git a/codes/iHento/15965308.java b/codes/iHento/15965308.java deleted file mode 100644 index c11e92d288a1a1e29bd32659b8e8e22d7e1bbf8c..0000000000000000000000000000000000000000 --- a/codes/iHento/15965308.java +++ /dev/null @@ -1,19 +0,0 @@ - /** - * 冒泡排序函数 - * aa bb cc - * - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ - public static void bubbleSort(int[] a, int n) { - // 你的代码，使无序数组 a 变得有序 - for (int i = 0; i < n; i++) { - for (int j = 0; j < n - i - 1; j++) { - if (a[j] > a[j + 1]) { - int T = a[j]; - a[j] = a[j + 1]; - a[j + 1] = T; - } - } - } - } // end diff --git a/codes/idealismer/15406184.java b/codes/idealismer/15406184.java deleted file mode 100644 index eb3d65ef3753e77c86eaf6602b03ae2cd9c2a61e..0000000000000000000000000000000000000000 --- a/codes/idealismer/15406184.java +++ /dev/null @@ -1,26 +0,0 @@ -/** - * 冒泡排序函数 - * 通过比较相邻元素并交换它们（如果需要），将数组a排序为升序。 - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int[] a, int n) { - for (int i = 0; i < n - 1; i++) { - // 创建一个标志位，用于检测数组是否已排序 - boolean swapped = false; - for (int j = 0; j < n - i - 1; j++) { - // 如果当前元素大于下一个元素，则交换它们 - if (a[j] > a[j + 1]) { - int temp = a[j]; - a[j] = a[j + 1]; - a[j + 1] = temp; - // 交换后，标志位设为true - swapped = true; - } - } - // 如果内层循环没有交换任何元素，说明数组已排序完成 - if (!swapped) { - break; - } - } -} // end bubbleSort diff --git a/codes/ignoreme/11207270.java b/codes/ignoreme/11207270.java deleted file mode 100644 index 191de91d18bdb330ab1609aaa3b20eeb19226481..0000000000000000000000000000000000000000 --- a/codes/ignoreme/11207270.java +++ /dev/null @@ -1,11 +0,0 @@ - public static void bubbleSort(int[] a, int n) { - for (int i = 0; i < a.length - 1; i++) { - for (int j = 0; j < a.length - 1 - i; j++) { - if (a[j] > a[j + 1]) { - int temp = a[j + 1]; - a[j + 1] = a[j]; - a[j] = temp; - } - } - } - } \ No newline at end of file diff --git a/codes/ikzsm77/15613401.java b/codes/ikzsm77/15613401.java deleted file mode 100644 index c2afaa2414da1853e4500b02c6de9068b64aeafe..0000000000000000000000000000000000000000 --- a/codes/ikzsm77/15613401.java +++ /dev/null @@ -1,18 +0,0 @@ -/** - * 冒泡排序函数 - * aa bb cc - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - for(int i = 0; i < n-1 ; i++){ - for (int j = 0;j < n-1-i;j++){ - if(a[j] > a[j+1]){ - int temp = a[j]; - a[j] = a[j+1]; - a[j+1] = temp; - } - } - } - -} //end diff --git a/codes/ilove360/9937750.java b/codes/ilove360/9937750.java deleted file mode 100644 index 9061f1f369a9b7ec1ce898807e9db19750b18c46..0000000000000000000000000000000000000000 --- a/codes/ilove360/9937750.java +++ /dev/null @@ -1,27 +0,0 @@ -/** - * 冒泡排序函数 - * aa bb cc - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - // 你的代码，使无序数组 a 变得有序 - int temp = 0 ; - for(int i = 0 ;i< n -1; i++){ - for(int j = 0; ja[j+1]){ - temp = a[j]; - a[j] = a[j+1]; - a[j+1] = temp; - } - } - - } - System.out.println("a排序后："); - - for(int i = 0; i a[j+1]) { - int temp = a[j]; - a[j] = a[j+1]; - a[j+1] = temp; - } - } - } -} //end diff --git a/codes/includebits/.15775863.java.swp b/codes/includebits/.15775863.java.swp deleted file mode 100644 index 1b729bb199aa7ed72e9539f3008f978b1a8d2d63..0000000000000000000000000000000000000000 Binary files a/codes/includebits/.15775863.java.swp and /dev/null differ diff --git a/codes/includebits/15775863.java b/codes/includebits/15775863.java deleted file mode 100644 index efd680da657656c264e76bb1effe14d51aca6052..0000000000000000000000000000000000000000 --- a/codes/includebits/15775863.java +++ /dev/null @@ -1,18 +0,0 @@ -/** - * 冒泡排序函数 - * 该函数用于对给定数组进行冒泡排序 - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - for (int i = 0; i < n - 1; i++) { - for (int j = 0; j < n - 1 - i; j++) { - if (a[j] > a[j + 1]) { - // 交换元素位置 - int temp = a[j]; - a[j] = a[j + 1]; - a[j + 1] = temp; - } - } - } -} //end diff --git a/codes/interceptors/11148333.java b/codes/interceptors/11148333.java deleted file mode 100644 index 1c8889947f924214c71a3c3f202500b4780dc281..0000000000000000000000000000000000000000 --- a/codes/interceptors/11148333.java +++ /dev/null @@ -1,11 +0,0 @@ -public static void bubbleSort(int [] a,int n){ - for(int i = 0; i < n-1 ; i++){ - for (int j = 0;j < n-1-i;j++){ - if(a[j] > a[j+1]){ - int temp = a[j]; - a[j] = a[j+1]; - a[j+1] = temp; - } - } - } -} \ No newline at end of file diff --git a/codes/ivan886/15517024.java b/codes/ivan886/15517024.java deleted file mode 100644 index c2afaa2414da1853e4500b02c6de9068b64aeafe..0000000000000000000000000000000000000000 --- a/codes/ivan886/15517024.java +++ /dev/null @@ -1,18 +0,0 @@ -/** - * 冒泡排序函数 - * aa bb cc - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - for(int i = 0; i < n-1 ; i++){ - for (int j = 0;j < n-1-i;j++){ - if(a[j] > a[j+1]){ - int temp = a[j]; - a[j] = a[j+1]; - a[j+1] = temp; - } - } - } - -} //end diff --git a/codes/jack250/15895412.java b/codes/jack250/15895412.java deleted file mode 100644 index c2afaa2414da1853e4500b02c6de9068b64aeafe..0000000000000000000000000000000000000000 --- a/codes/jack250/15895412.java +++ /dev/null @@ -1,18 +0,0 @@ -/** - * 冒泡排序函数 - * aa bb cc - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - for(int i = 0; i < n-1 ; i++){ - for (int j = 0;j < n-1-i;j++){ - if(a[j] > a[j+1]){ - int temp = a[j]; - a[j] = a[j+1]; - a[j+1] = temp; - } - } - } - -} //end diff --git a/codes/jacksoftware/15864608.java b/codes/jacksoftware/15864608.java deleted file mode 100644 index 8f89cc01cb472e8de5ef9f0aaaa019b0dd426ea5..0000000000000000000000000000000000000000 --- a/codes/jacksoftware/15864608.java +++ /dev/null @@ -1,20 +0,0 @@ -/** - * 冒泡排序函数 - * aa bb cc - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - for (int i = 0; i < n - 1; i++) { - for (int j = 0; j < n - i - 1; j++) { - if (a[j] > a[j + 1]) { - // 交换 a[j] 和 a[j+1] - int temp = a[j]; - a[j] = a[j + 1]; - a[j + 1] = temp; - } - } - - } - -} diff --git a/codes/jackson0007/.keep b/codes/jackson0007/.keep deleted file mode 100644 index e69de29bb2d1d6434b8b29ae775ad8c2e48c5391..0000000000000000000000000000000000000000 diff --git a/codes/jackson0007/15846232.java b/codes/jackson0007/15846232.java deleted file mode 100644 index 6426772fb479b07ed3be21ef1867921d1dbb194c..0000000000000000000000000000000000000000 --- a/codes/jackson0007/15846232.java +++ /dev/null @@ -1,20 +0,0 @@ -/** - * 冒泡排序函数 - * aa bb cc - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - // 你的代码，使无序数组 a 变得有序 - for(int i = 0; i < n; i++) { - for(int j = 0; j < n - i - 1; j++) { - if(a[j] > a[j + 1]) { - int temp = a[j]; - a [j] = a[j + 1]; - a[j + 1] = temp; - } - } - } - - -} //end \ No newline at end of file diff --git a/codes/jacksonstack/15157304.java b/codes/jacksonstack/15157304.java deleted file mode 100644 index fd232d5643a65df16fc2710915a3ad1032974220..0000000000000000000000000000000000000000 --- a/codes/jacksonstack/15157304.java +++ /dev/null @@ -1,32 +0,0 @@ - /** - * 冒泡排序函数 - * more： - * 1. 从上一次交换索引位置开始；部分有序 - * 2. 后续已经有序，退出比较 - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ - public static void bubbleSort(int [] a, int n){ - int last = 0; // 最后一次交换的索引 - int outIndex = n - 1; - int innerIndex = n - 1; - for (int i = 0; i < outIndex; i++) { - // 是否发生交换， 发生 仍未有序； 未发生 已有序 - boolean flag = false; - if (last != 0) { - innerIndex = last; - } - for (int j = 0; j < innerIndex; j++) { - if (a[j] > a[j + 1]) { - int temp = a[j]; - a[j] = a[j + 1]; - a[j + 1] = temp; - flag = true; - last = j; - } - } - if (!flag) { - break; - } - } - } diff --git a/codes/jakobz/18423069.java b/codes/jakobz/18423069.java deleted file mode 100644 index b9fa203693cc44fcb0e7f77f361fbbaa7792f2cb..0000000000000000000000000000000000000000 --- a/codes/jakobz/18423069.java +++ /dev/null @@ -1,18 +0,0 @@ -/** - * 冒泡排序函数 - * aa bb cc - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - // 你的代码，使无序数组 a 变得有序 - for(int i = 0; i < n; i++) { - for(int j = 1; j < n - i; j++) { - if(a[j - 1] > a[j]) { - int tmp = a[j - 1]; - a[j - 1] = a[j]; - a[j] = tmp; - } - } - } -} //end diff --git a/codes/java0111/15636073.java b/codes/java0111/15636073.java deleted file mode 100644 index 855496ea92540342d41f4a245d439472243073cb..0000000000000000000000000000000000000000 --- a/codes/java0111/15636073.java +++ /dev/null @@ -1,19 +0,0 @@ -/** - * 冒泡排序函数 - * aa bb cc - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - // 你的代码，使无序数组 a 变得有序 - for(int i = n - 1; i > 0; i--){ - for(int j = 0; j < i; j++){ - if(a[j] > a[j + 1]){ - int tem = a[j]; - a[j] = a[j + 1]; - a[j + 1] = tem; - } - } - } - -} //end diff --git a/codes/jayjay/9955470.java b/codes/jayjay/9955470.java deleted file mode 100644 index 82b73c8ff8181a822b4e5b9b4a74866761c7b1ca..0000000000000000000000000000000000000000 --- a/codes/jayjay/9955470.java +++ /dev/null @@ -1,20 +0,0 @@ -/** - * 冒泡排序函数 - * aa bb cc - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - // 你的代码，使无序数组 a 变得有序 - for(int i = 0 ; i < n - 1 ; i++){ - for(int j = 0 ; j < n - 1 - i ; j++){ - if(a[j] > a[j + 1]){ - int tmp = a[j]; - a[j] = a[j + 1]; - a[j + 1] = tmp; - } - } - } - -} //end - diff --git a/codes/jbace2/.keep b/codes/jbace2/.keep deleted file mode 100644 index e69de29bb2d1d6434b8b29ae775ad8c2e48c5391..0000000000000000000000000000000000000000 diff --git a/codes/jbace2/10041152.java b/codes/jbace2/10041152.java deleted file mode 100644 index 29d27043d3c8103739e7a1d2a27e77b4cc475876..0000000000000000000000000000000000000000 --- a/codes/jbace2/10041152.java +++ /dev/null @@ -1,23 +0,0 @@ -/** - * 冒泡排序函数 - * aa bb cc - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - // 你的代码，使无序数组 a 变得有序 - for (int i = 0; i < n-1; i++) { - for (int j = 0; j < n-1-i; j++) { - if (a[j] >= a[j+1]) { - int temp = a[j]; - a[j] = a[j+1]; - a[j+1] = temp; - } - } - } - - System.out.print("冒泡排序的结果是： "); - for (int i : a) { - System.out.print(i + " "); - } -} //end \ No newline at end of file diff --git a/codes/jerrywang/.keep b/codes/jerrywang/.keep deleted file mode 100644 index e69de29bb2d1d6434b8b29ae775ad8c2e48c5391..0000000000000000000000000000000000000000 diff --git a/codes/jerrywang/10972482.java b/codes/jerrywang/10972482.java deleted file mode 100644 index 862a031b6f73aac6e6e6656df710e9caa439d4c0..0000000000000000000000000000000000000000 --- a/codes/jerrywang/10972482.java +++ /dev/null @@ -1,18 +0,0 @@ -/** - * 冒泡排序函数 - * aa bb cc - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - // 你的代码，使无序数组 a 变得有序 - for (int m=0 ; ma[q+1]) { - int temp=a[q]; - a[q]=a[q+1]; - a[q+1]=temp; - } - } - } -} //end \ No newline at end of file diff --git a/codes/jerrywang/10972482.java] b/codes/jerrywang/10972482.java] deleted file mode 100644 index e69de29bb2d1d6434b8b29ae775ad8c2e48c5391..0000000000000000000000000000000000000000 diff --git a/codes/jerrywang1982/15623035.java b/codes/jerrywang1982/15623035.java deleted file mode 100644 index c4ea11374b4d2d0fb45b5ea9e552f59e37a38201..0000000000000000000000000000000000000000 --- a/codes/jerrywang1982/15623035.java +++ /dev/null @@ -1,21 +0,0 @@ -/** - * 冒泡排序函数 - * 使用冒泡排序算法对数组进行升序排序 - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int[] a, int n){ - // 外层循环，控制排序的轮数 - for (int i = 0; i < n - 1; i++) { - // 内层循环，负责每轮的比较和交换 - for (int j = 0; j < n - i - 1; j++) { - // 如果当前元素大于下一个元素，则交换它们 - if (a[j] > a[j + 1]) { - // 交换 a[j] 和 a[j+1] - int temp = a[j]; - a[j] = a[j + 1]; - a[j + 1] = temp; - } - } - } -} //end diff --git a/codes/jggttcd55/.keep b/codes/jggttcd55/.keep deleted file mode 100644 index e69de29bb2d1d6434b8b29ae775ad8c2e48c5391..0000000000000000000000000000000000000000 diff --git a/codes/jggttcd55/15828240.java b/codes/jggttcd55/15828240.java deleted file mode 100644 index 6e9861fa3ec6d5a2553cdccd1bb1e977430c671b..0000000000000000000000000000000000000000 --- a/codes/jggttcd55/15828240.java +++ /dev/null @@ -1,19 +0,0 @@ -/** - * 冒泡排序函数 - * aa bb cc - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - // 你的代码，使无序数组 a 变得有序 - for (int i = 0; i < n - 1; i++) { - for (int j = 0; j < n - i - 1; j++) { - if (a[j] > a[j + 1]) { - - int temp = a[j]; - a[j] = a[j + 1]; - a[j + 1] = temp; - } - } - } -} //end \ No newline at end of file diff --git a/codes/jgjfvj767/.keep b/codes/jgjfvj767/.keep deleted file mode 100644 index e69de29bb2d1d6434b8b29ae775ad8c2e48c5391..0000000000000000000000000000000000000000 diff --git a/codes/jgjfvj767/15743251.java b/codes/jgjfvj767/15743251.java deleted file mode 100644 index 96508c1385b4a62859a2adea3c8dfae39051b7cd..0000000000000000000000000000000000000000 --- a/codes/jgjfvj767/15743251.java +++ /dev/null @@ -1,19 +0,0 @@ -/** - * 冒泡排序函数 - * aa bb cc - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - // 你的代码，使无序数组 a 变得有序 - for (int i = 0; i < n - 1; i++) { - for (int j = 0; j < n - i - 1; j++) { - if (a[j] > a[j + 1]) { - - int temp = a[j]; - a[j] = a[j + 1]; - a[j + 1] = temp; - } - } - } -} //end \ No newline at end of file diff --git a/codes/jiacheng/.keep b/codes/jiacheng/.keep deleted file mode 100644 index e69de29bb2d1d6434b8b29ae775ad8c2e48c5391..0000000000000000000000000000000000000000 diff --git a/codes/jiacheng/15830646.java b/codes/jiacheng/15830646.java deleted file mode 100644 index 6426772fb479b07ed3be21ef1867921d1dbb194c..0000000000000000000000000000000000000000 --- a/codes/jiacheng/15830646.java +++ /dev/null @@ -1,20 +0,0 @@ -/** - * 冒泡排序函数 - * aa bb cc - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - // 你的代码，使无序数组 a 变得有序 - for(int i = 0; i < n; i++) { - for(int j = 0; j < n - i - 1; j++) { - if(a[j] > a[j + 1]) { - int temp = a[j]; - a [j] = a[j + 1]; - a[j + 1] = temp; - } - } - } - - -} //end \ No newline at end of file diff --git a/codes/jiacheng02/.keep b/codes/jiacheng02/.keep deleted file mode 100644 index e69de29bb2d1d6434b8b29ae775ad8c2e48c5391..0000000000000000000000000000000000000000 diff --git a/codes/jiacheng02/15830816.java b/codes/jiacheng02/15830816.java deleted file mode 100644 index c3018cab6a0f30e364965e32a922b6f7d039af36..0000000000000000000000000000000000000000 --- a/codes/jiacheng02/15830816.java +++ /dev/null @@ -1,20 +0,0 @@ - /** - * 冒泡排序函数 - * aa bb cc - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ - public static void bubbleSort(int [] a, int n){ - // 你的代码，使无序数组 a 变得有序 - for(int i = 0; i < n; i++) { - for(int j = 0; j < n - i - 1; j++) { - if(a[j] > a[j + 1]) { - int temp = a[j]; - a [j] = a[j + 1]; - a[j + 1] = temp; - } - } - } - - - } //end \ No newline at end of file diff --git a/codes/jianghao/15366705.java b/codes/jianghao/15366705.java deleted file mode 100644 index c2afaa2414da1853e4500b02c6de9068b64aeafe..0000000000000000000000000000000000000000 --- a/codes/jianghao/15366705.java +++ /dev/null @@ -1,18 +0,0 @@ -/** - * 冒泡排序函数 - * aa bb cc - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - for(int i = 0; i < n-1 ; i++){ - for (int j = 0;j < n-1-i;j++){ - if(a[j] > a[j+1]){ - int temp = a[j]; - a[j] = a[j+1]; - a[j+1] = temp; - } - } - } - -} //end diff --git a/codes/jiasrt/15781311.java b/codes/jiasrt/15781311.java deleted file mode 100644 index cac0dcf1e936c4d36670a0ef4f7462c7a3ed3e56..0000000000000000000000000000000000000000 --- a/codes/jiasrt/15781311.java +++ /dev/null @@ -1,28 +0,0 @@ -/** - * 冒泡排序函数 - * aa bb cc - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - if (n <= 1) return; // 如果数组长度小于等于1，不需要排序 - - boolean swapped; - for (int i = 0; i < n - 1; i++) { - swapped = false; - for (int j = 0; j < n - 1 - i; j++) { - if (a[j] > a[j + 1]) { - // 交换a[j]和a[j + 1] - int temp = a[j]; - a[j] = a[j + 1]; - a[j + 1] = temp; - swapped = true; - } - } - // 如果这一轮没有发生交换，说明数组已经有序，退出排序 - if (!swapped) { - break; - } - } -} //end - diff --git a/codes/jiayinzinc/.keep b/codes/jiayinzinc/.keep deleted file mode 100644 index e69de29bb2d1d6434b8b29ae775ad8c2e48c5391..0000000000000000000000000000000000000000 diff --git a/codes/jiayinzinc/15845797.java b/codes/jiayinzinc/15845797.java deleted file mode 100644 index 6e9861fa3ec6d5a2553cdccd1bb1e977430c671b..0000000000000000000000000000000000000000 --- a/codes/jiayinzinc/15845797.java +++ /dev/null @@ -1,19 +0,0 @@ -/** - * 冒泡排序函数 - * aa bb cc - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - // 你的代码，使无序数组 a 变得有序 - for (int i = 0; i < n - 1; i++) { - for (int j = 0; j < n - i - 1; j++) { - if (a[j] > a[j + 1]) { - - int temp = a[j]; - a[j] = a[j + 1]; - a[j + 1] = temp; - } - } - } -} //end \ No newline at end of file diff --git a/codes/jichen/12429463.java b/codes/jichen/12429463.java deleted file mode 100644 index d2207f8580de8965b35821678898ea8c7ae03ab5..0000000000000000000000000000000000000000 --- a/codes/jichen/12429463.java +++ /dev/null @@ -1,18 +0,0 @@ -/** - * 冒泡排序函数 - * aa bb cc - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - // 你的代码，使无序数组 a 变得有序 - for(int i = 0; i < n; i++) { - for(int j = 0; j < n - i - 1; ++j) { - if(a[j] > a[j + 1]) { - int tmp = a[j]; - a[j] = a[j + 1]; - a[j + 1] = tmp; - } - } - } -} //end diff --git a/codes/jideliy89mxp/10942446.java b/codes/jideliy89mxp/10942446.java deleted file mode 100644 index c05a772d83b85c60bdcae220bf3d2ed176d8e54c..0000000000000000000000000000000000000000 --- a/codes/jideliy89mxp/10942446.java +++ /dev/null @@ -1,24 +0,0 @@ -/** - * 冒泡排序函数 - * aa bb cc - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - // 你的代码，使无序数组 a 变得有序 - int temp; - for (int i = 0; i < n - 1; i++) { - int count = 0; - for (int j = 0; j < n - 1 - i; j++) { - if (a[j] > a[j + 1]) { - temp = a[j]; - a[j] = a[j + 1]; - a[j + 1] = temp; - count++; - } - } - if (count == 0) { - break; - } - } -} //end diff --git a/codes/jieming/.keep b/codes/jieming/.keep deleted file mode 100644 index e69de29bb2d1d6434b8b29ae775ad8c2e48c5391..0000000000000000000000000000000000000000 diff --git a/codes/jieming/15831124.java b/codes/jieming/15831124.java deleted file mode 100644 index 6426772fb479b07ed3be21ef1867921d1dbb194c..0000000000000000000000000000000000000000 --- a/codes/jieming/15831124.java +++ /dev/null @@ -1,20 +0,0 @@ -/** - * 冒泡排序函数 - * aa bb cc - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - // 你的代码，使无序数组 a 变得有序 - for(int i = 0; i < n; i++) { - for(int j = 0; j < n - i - 1; j++) { - if(a[j] > a[j + 1]) { - int temp = a[j]; - a [j] = a[j + 1]; - a[j + 1] = temp; - } - } - } - - -} //end \ No newline at end of file diff --git a/codes/jijing/.keep b/codes/jijing/.keep deleted file mode 100644 index e69de29bb2d1d6434b8b29ae775ad8c2e48c5391..0000000000000000000000000000000000000000 diff --git a/codes/jijing/15866624.java b/codes/jijing/15866624.java deleted file mode 100644 index 6426772fb479b07ed3be21ef1867921d1dbb194c..0000000000000000000000000000000000000000 --- a/codes/jijing/15866624.java +++ /dev/null @@ -1,20 +0,0 @@ -/** - * 冒泡排序函数 - * aa bb cc - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - // 你的代码，使无序数组 a 变得有序 - for(int i = 0; i < n; i++) { - for(int j = 0; j < n - i - 1; j++) { - if(a[j] > a[j + 1]) { - int temp = a[j]; - a [j] = a[j + 1]; - a[j + 1] = temp; - } - } - } - - -} //end \ No newline at end of file diff --git a/codes/jingge15116238811/10969429.java b/codes/jingge15116238811/10969429.java deleted file mode 100644 index deb2438785c696d09e985c35997c2f2bc5445a90..0000000000000000000000000000000000000000 --- a/codes/jingge15116238811/10969429.java +++ /dev/null @@ -1,18 +0,0 @@ -/** - * 冒泡排序函数 - * aa bb cc - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - // 你的代码，使无序数组 a 变得有序 - for (int i=0 ; ia[k+1]) { - int temp=a[k]; - a[k]=a[k+1]; - a[k+1]=temp; - } - } - } -} //end \ No newline at end of file diff --git a/codes/jingqing3948/15533535.java b/codes/jingqing3948/15533535.java deleted file mode 100644 index 441eb8963da90b392fc88143884bb8bea1bc72ac..0000000000000000000000000000000000000000 --- a/codes/jingqing3948/15533535.java +++ /dev/null @@ -1,21 +0,0 @@ -/** - * 冒泡排序函数 - * aa bb cc - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - // 你的代码，使无序数组 a 变得有序 - int i,j; - for(i=0;ia[j+1]){ - int temp=a[j]; - a[j]=a[j+1]; - a[j+1]=temp; - } - } - } - - -} //end diff --git a/codes/jinguo/15825503.java b/codes/jinguo/15825503.java deleted file mode 100644 index e6de3002a1d558b551f9585da601ef3b5398aaa6..0000000000000000000000000000000000000000 --- a/codes/jinguo/15825503.java +++ /dev/null @@ -1,19 +0,0 @@ -/** - * 冒泡排序函数 - * 通过重复地遍历要排序的数列，一次比较两个元素，如果他们的顺序错误就把他们交换过来。 - * 遍历数列的工作是重复地进行直到没有再需要交换，也就是说该数列已经排序完成。 - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - for (int i = 0; i < n - 1; i++) { - for (int j = 0; j < n - i - 1; j++) { - // 如果前一个元素大于后一个元素，则交换它们的位置 - if (a[j] > a[j + 1]) { - int temp = a[j]; - a[j] = a[j + 1]; - a[j + 1] = temp; - } - } - } -} //end diff --git a/codes/jinjin1234567/15628228.java b/codes/jinjin1234567/15628228.java deleted file mode 100644 index eb29d98eb24bfc163352191a8009f3fd17064de2..0000000000000000000000000000000000000000 --- a/codes/jinjin1234567/15628228.java +++ /dev/null @@ -1,18 +0,0 @@ -/** - * 冒泡排序函数 - * 依次比较相邻的元素，如果顺序错误就交换它们，遍历数组的工作是重复地进行直到没有再需要交换，也就是说该数组已经排序完成。 - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - for (int i = 0; i < n - 1; i++) { // 外层循环控制需要比较的趟数 - for (int j = 0; j < n - 1 - i; j++) { // 内层循环控制每趟比较的次数 - if (a[j] > a[j + 1]) { // 如果前一个元素大于后一个元素，则交换它们的位置 - // 交换 a[j] 和 a[j+1] - int temp = a[j]; - a[j] = a[j + 1]; - a[j + 1] = temp; - } - } - } -} //end diff --git a/codes/jinpeng/.keep b/codes/jinpeng/.keep deleted file mode 100644 index e69de29bb2d1d6434b8b29ae775ad8c2e48c5391..0000000000000000000000000000000000000000 diff --git a/codes/jinpeng/15794435.java b/codes/jinpeng/15794435.java deleted file mode 100644 index 6426772fb479b07ed3be21ef1867921d1dbb194c..0000000000000000000000000000000000000000 --- a/codes/jinpeng/15794435.java +++ /dev/null @@ -1,20 +0,0 @@ -/** - * 冒泡排序函数 - * aa bb cc - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - // 你的代码，使无序数组 a 变得有序 - for(int i = 0; i < n; i++) { - for(int j = 0; j < n - i - 1; j++) { - if(a[j] > a[j + 1]) { - int temp = a[j]; - a [j] = a[j + 1]; - a[j + 1] = temp; - } - } - } - - -} //end \ No newline at end of file diff --git a/codes/jinshi/.keep b/codes/jinshi/.keep deleted file mode 100644 index e69de29bb2d1d6434b8b29ae775ad8c2e48c5391..0000000000000000000000000000000000000000 diff --git a/codes/jinshi/15846626.java b/codes/jinshi/15846626.java deleted file mode 100644 index 6426772fb479b07ed3be21ef1867921d1dbb194c..0000000000000000000000000000000000000000 --- a/codes/jinshi/15846626.java +++ /dev/null @@ -1,20 +0,0 @@ -/** - * 冒泡排序函数 - * aa bb cc - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - // 你的代码，使无序数组 a 变得有序 - for(int i = 0; i < n; i++) { - for(int j = 0; j < n - i - 1; j++) { - if(a[j] > a[j + 1]) { - int temp = a[j]; - a [j] = a[j + 1]; - a[j + 1] = temp; - } - } - } - - -} //end \ No newline at end of file diff --git a/codes/jinxin177/15759096.java b/codes/jinxin177/15759096.java deleted file mode 100644 index 76cbddd876f8669466e0a2651682cee667741713..0000000000000000000000000000000000000000 --- a/codes/jinxin177/15759096.java +++ /dev/null @@ -1,20 +0,0 @@ -/** - * 冒泡排序函数 - * aa bb cc - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - // 你的代码，使无序数组 a 变得有序 - for(int i = 0; i < n; i++) { - for(int b = 0; b < n - i - 1; b++) { - if(a[b] > a[b + 1]) { - int temp = a[b]; - a [b] = a[b + 1]; - a[b + 1] = temp; - } - } - } - - -} //end diff --git a/codes/jinya123/15684545.java b/codes/jinya123/15684545.java deleted file mode 100644 index 987377810b5beca8eb4bf5eafeee5db45e234a87..0000000000000000000000000000000000000000 --- a/codes/jinya123/15684545.java +++ /dev/null @@ -1,20 +0,0 @@ -/** - * 冒泡排序函数 - * aa bb cc - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - // 你的代码，使无序数组 a 变得有序 - for(int i = 0; i < n; i++) { - for(int liuy = 0; liuy < n - i - 1; liuy++) { - if(a[liuy] > a[liuy + 1]) { - int temp = a[liuy]; - a [liuy] = a[liuy + 1]; - a[liuy + 1] = temp; - } - } - } - - -} //end,liuy diff --git a/codes/jinyuan/.keep b/codes/jinyuan/.keep deleted file mode 100644 index e69de29bb2d1d6434b8b29ae775ad8c2e48c5391..0000000000000000000000000000000000000000 diff --git a/codes/jinyuan/15867508.java b/codes/jinyuan/15867508.java deleted file mode 100644 index 6426772fb479b07ed3be21ef1867921d1dbb194c..0000000000000000000000000000000000000000 --- a/codes/jinyuan/15867508.java +++ /dev/null @@ -1,20 +0,0 @@ -/** - * 冒泡排序函数 - * aa bb cc - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - // 你的代码，使无序数组 a 变得有序 - for(int i = 0; i < n; i++) { - for(int j = 0; j < n - i - 1; j++) { - if(a[j] > a[j + 1]) { - int temp = a[j]; - a [j] = a[j + 1]; - a[j + 1] = temp; - } - } - } - - -} //end \ No newline at end of file diff --git a/codes/jiucai131/11476990.java b/codes/jiucai131/11476990.java deleted file mode 100644 index 1c8889947f924214c71a3c3f202500b4780dc281..0000000000000000000000000000000000000000 --- a/codes/jiucai131/11476990.java +++ /dev/null @@ -1,11 +0,0 @@ -public static void bubbleSort(int [] a,int n){ - for(int i = 0; i < n-1 ; i++){ - for (int j = 0;j < n-1-i;j++){ - if(a[j] > a[j+1]){ - int temp = a[j]; - a[j] = a[j+1]; - a[j+1] = temp; - } - } - } -} \ No newline at end of file diff --git a/codes/jiujiu/15555981.java b/codes/jiujiu/15555981.java deleted file mode 100644 index ccf5e94f6a37103e978629635e2244c0aa664f0e..0000000000000000000000000000000000000000 --- a/codes/jiujiu/15555981.java +++ /dev/null @@ -1,21 +0,0 @@ -/** - * 冒泡排序函数 - * 将无序数组通过冒泡排序算法变得有序 - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int[] a, int n) { - // 外层循环控制排序趟数 - for (int i = 0; i < n - 1; i++) { - // 内层循环负责每次趟的比较和交换 - for (int j = 0; j < n - i - 1; j++) { - // 如果前一个元素比后一个元素大，则交换它们的位置 - if (a[j] > a[j + 1]) { - int temp = a[j]; - a[j] = a[j + 1]; - a[j + 1] = temp; - } - } - } - // 数组a现在已经变得有序 -} //end diff --git a/codes/jiujiuhaizi/.keep b/codes/jiujiuhaizi/.keep deleted file mode 100644 index e69de29bb2d1d6434b8b29ae775ad8c2e48c5391..0000000000000000000000000000000000000000 diff --git a/codes/jiujiuhaizi/10972159.java b/codes/jiujiuhaizi/10972159.java deleted file mode 100644 index 4879af620f6837399326a7c38fab9ec28e177ad6..0000000000000000000000000000000000000000 --- a/codes/jiujiuhaizi/10972159.java +++ /dev/null @@ -1,20 +0,0 @@ -/** - * 冒泡排序函数 - * aa bb cc - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - // 你的代码，使无序数组 a 变得有序 - for(int i=0;ia[j+1]){ - n=a[j]; - a[j]=a[j+1]; - a[j+1]=n; - } - } - } - for(int i=0;i a[j + 1]) { - // 交换元素 - int temp = a[j]; - a[j] = a[j + 1]; - a[j + 1] = temp; - } - } - } -} //end diff --git a/codes/jkgao007/10515263.java b/codes/jkgao007/10515263.java deleted file mode 100644 index e712e076ad44564097e182dc460ddc5a9ccad945..0000000000000000000000000000000000000000 --- a/codes/jkgao007/10515263.java +++ /dev/null @@ -1,23 +0,0 @@ -/** - * 冒泡排序函数 - * aa bb cc - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - // 你的代码，使无序数组 a 变得有序 - for (int i = 0; i < n-1; i++) { - for (int j = 0; j < n-1-i; j++) { - if (a[j] >= a[j+1]) { - int temp = a[j]; - a[j] = a[j+1]; - a[j+1] = temp; - } - } - } - - System.out.print("冒泡排序的结果是： "); - for (int i : a) { - System.out.print(i + " "); - } -} //end diff --git a/codes/jkxllj/15631418.java b/codes/jkxllj/15631418.java deleted file mode 100644 index d24a24b804f48d74cbe4f2ea3b9ff381b7fb476d..0000000000000000000000000000000000000000 --- a/codes/jkxllj/15631418.java +++ /dev/null @@ -1,19 +0,0 @@ - -/** - * 冒泡排序函数 - * aa bb cc - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - // 你的代码，使无序数组 a 变得有序 - for (int i=0;ia[j+1]){ - int temp=a[j+1]; - a[j+1]=a[j]; - a[j]=temp; - } - } - } -} //end diff --git a/codes/jmdajiang/.keep b/codes/jmdajiang/.keep deleted file mode 100644 index e69de29bb2d1d6434b8b29ae775ad8c2e48c5391..0000000000000000000000000000000000000000 diff --git a/codes/jmdajiang/15764743.java b/codes/jmdajiang/15764743.java deleted file mode 100644 index 6426772fb479b07ed3be21ef1867921d1dbb194c..0000000000000000000000000000000000000000 --- a/codes/jmdajiang/15764743.java +++ /dev/null @@ -1,20 +0,0 @@ -/** - * 冒泡排序函数 - * aa bb cc - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - // 你的代码，使无序数组 a 变得有序 - for(int i = 0; i < n; i++) { - for(int j = 0; j < n - i - 1; j++) { - if(a[j] > a[j + 1]) { - int temp = a[j]; - a [j] = a[j + 1]; - a[j + 1] = temp; - } - } - } - - -} //end \ No newline at end of file diff --git a/codes/jokemanfire/11650604.java b/codes/jokemanfire/11650604.java deleted file mode 100644 index 62d1c299a5756f3dedf258cb9ec3e5ca352c73d9..0000000000000000000000000000000000000000 --- a/codes/jokemanfire/11650604.java +++ /dev/null @@ -1,13 +0,0 @@ -public static void bubbleSort(int []a,int n) -{ - for(int i = 0 ;i< a.length -1; i++){ - for(int j = 0; ja[j+1]){ - int temp = a[j]; - a[j] = a[j+1]; - a[j+1] = temp; - } - } - - } -} diff --git a/codes/jony2258/15804822.java b/codes/jony2258/15804822.java deleted file mode 100644 index ce4123f36198ecb034f9ba60dd9025622afaf314..0000000000000000000000000000000000000000 --- a/codes/jony2258/15804822.java +++ /dev/null @@ -1,18 +0,0 @@ -/** - * 冒泡排序函数 - * 通过相邻元素两两比较和交换，使得每一轮过后最大（或最小）的元素被交换到序列末尾 - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - for (int i = 0; i < n - 1; i++) { // 外层循环控制排序的轮数 - for (int j = 0; j < n - 1 - i; j++) { // 内层循环控制每轮的比较次数 - if (a[j] > a[j + 1]) { // 如果前一个元素大于后一个元素，则交换它们 - // 交换 a[j] 和 a[j+1] - int temp = a[j]; - a[j] = a[j + 1]; - a[j + 1] = temp; - } - } - } -} //end diff --git a/codes/joohwan/16200342.java b/codes/joohwan/16200342.java deleted file mode 100644 index 044bc48abdde713488e6d017da0b2f958c241d68..0000000000000000000000000000000000000000 --- a/codes/joohwan/16200342.java +++ /dev/null @@ -1,18 +0,0 @@ -/** - * 冒泡排序函数 - * aa bb cc - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - for (int i = 0; i < n - 1; i++) { - for (int j = 0; j < n - i - 1; j++) { - if (a[j] > a[j + 1]) { - int temp = a[j]; - a[j] = a[j + 1]; - a[j + 1] = temp; - } - } - } -} //end - diff --git a/codes/jpq110/.java b/codes/jpq110/.java deleted file mode 100644 index e69de29bb2d1d6434b8b29ae775ad8c2e48c5391..0000000000000000000000000000000000000000 diff --git a/codes/jpq110/15848383.java b/codes/jpq110/15848383.java deleted file mode 100644 index ab3d8f390cfa4cee1947d39872e75bac48b3058a..0000000000000000000000000000000000000000 --- a/codes/jpq110/15848383.java +++ /dev/null @@ -1,11 +0,0 @@ -public static void bubbleSort(int [] a, int n) { - for (int i=0 ; ia[j+1]) { - int temp=a[j]; - a[j]=a[j+1]; - a[j+1]=temp; - } - } - } -} diff --git a/codes/juanmaola/15776278.java b/codes/juanmaola/15776278.java deleted file mode 100644 index a73834e9835a08c8638f1d13214eacc12771f0ca..0000000000000000000000000000000000000000 --- a/codes/juanmaola/15776278.java +++ /dev/null @@ -1,26 +0,0 @@ -/** - * 冒泡排序函数 - * 通过相邻元素之间的比较和交换，将无序数组变为有序数组 - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - for (int i = 0; i < n - 1; i++) { - // 标记变量，用于优化，如果在一趟排序中没有交换，则数组已经有序 - boolean swapped = false; - for (int j = 0; j < n - i - 1; j++) { - // 如果前一个元素大于后一个元素，则交换它们 - if (a[j] > a[j + 1]) { - int temp = a[j]; - a[j] = a[j + 1]; - a[j + 1] = temp; - // 发生了交换，将标记设为true - swapped = true; - } - } - // 如果在内层循环中没有发生交换，则数组已经有序，提前退出 - if (!swapped) { - break; - } - } -} //end diff --git a/codes/juking/10340196.java b/codes/juking/10340196.java deleted file mode 100644 index 2427354dd0779383a567a842590db45bece9e707..0000000000000000000000000000000000000000 --- a/codes/juking/10340196.java +++ /dev/null @@ -1,19 +0,0 @@ -/** - * 冒泡排序函数 - * aa bb cc - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] array, int n){ - // 你的代码，使无序数组 array 变得有序 - for (int i = 0; i < n; i++) { - for (int j = 0; j < n - 1; j++) { - if (array[j] > array[j + 1]) { - // Swap the elements - int temp = array[j]; - array[j] = array[j + 1]; - array[j + 1] = temp; - } - } - } -} diff --git a/codes/jyz1092752421/15867277.java b/codes/jyz1092752421/15867277.java deleted file mode 100644 index 24f513b3219ac31ac3dcffe774647aa7bfdac254..0000000000000000000000000000000000000000 --- a/codes/jyz1092752421/15867277.java +++ /dev/null @@ -1,11 +0,0 @@ -public static void bubbleSort(int [] a, int n){ - for (int i = 0; i < n - 1; i++) { - for (int j = 0; j < n - 1 - i; j++) { - if (a[j] > a[j + 1]) { - int temp = a[j]; - a[j] = a[j + 1]; - a[j + 1] = temp; - } - } - } -} diff --git a/codes/k8scat/11864664.java b/codes/k8scat/11864664.java deleted file mode 100644 index 43bde320f7dbaab334959abe6c825e0a8acc65ea..0000000000000000000000000000000000000000 --- a/codes/k8scat/11864664.java +++ /dev/null @@ -1,12 +0,0 @@ -public static void bubbleSort(int[] arr, int n) { - for (int i = 0; i < n - 1; i++) { - for (int j = 0; j < n - i - 1; j++) { - if (arr[j] > arr[j + 1]) { - // 交换arr[j]和arr[j+1] - int temp = arr[j]; - arr[j] = arr[j + 1]; - arr[j + 1] = temp; - } - } - } -} diff --git a/codes/kaiSYJ/15488956.java b/codes/kaiSYJ/15488956.java deleted file mode 100644 index cc79a00958d5e633e4c62561a6d0bb958dc799b2..0000000000000000000000000000000000000000 --- a/codes/kaiSYJ/15488956.java +++ /dev/null @@ -1,28 +0,0 @@ -/** - * 冒泡排序函数 - * 通过比较相邻的元素来工作，如果它们的顺序错误就把它们交换过来。 - * 遍历数组的工作是重复地进行直到没有再需要交换，也就是说该数组已经排序完成。 - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int[] a, int n) { - for (int i = 0; i < n - 1; i++) { - // 标记变量，用于检测在一次遍历中是否发生了交换 - boolean swapped = false; - for (int j = 0; j < n - i - 1; j++) { - // 如果当前元素大于下一个元素，则交换它们 - if (a[j] > a[j + 1]) { - // 交换元素 - int temp = a[j]; - a[j] = a[j + 1]; - a[j + 1] = temp; - // 标记发生了交换 - swapped = true; - } - } - // 如果在一次遍历中没有发生交换，说明数组已经有序，可以提前结束 - if (!swapped) { - break; - } - } -} //end diff --git a/codes/kaiSYJ/15589878.java b/codes/kaiSYJ/15589878.java deleted file mode 100644 index 1e66d7f4d6dd0480ff1b73795b5f74b9af709b25..0000000000000000000000000000000000000000 --- a/codes/kaiSYJ/15589878.java +++ /dev/null @@ -1,18 +0,0 @@ -/** - * 冒泡排序函数 - * 功能：对数组进行冒泡排序 - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - for (int i = 0; i < n - 1; i++) { - for (int j = 0; j < n - 1 - i; j++) { - // 如果前一个元素大于后一个元素，则交换它们的位置 - if (a[j] > a[j + 1]) { - int temp = a[j]; - a[j] = a[j + 1]; - a[j + 1] = temp; - } - } - } -} //end diff --git a/codes/kakki1003/18431839.java b/codes/kakki1003/18431839.java deleted file mode 100644 index 6062f3d52bb60e1e03320ac7eb414fcb446e39ae..0000000000000000000000000000000000000000 --- a/codes/kakki1003/18431839.java +++ /dev/null @@ -1,19 +0,0 @@ -/** - * 冒泡排序函数 - * aa bb cc - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - // 你的代码，使无序数组 a 变得有序 - for(int i = 0; i < n; i++){ - for(int j = 0; j < n - i - 1; j++){ - if(a[j] > a[j + 1]){ - int tmp = a[j]; - a[j] = a[j + 1]; - a[j + 1] = tmp; - } - } - } -} -//end diff --git a/codes/kangwang/11615067.java b/codes/kangwang/11615067.java deleted file mode 100644 index 7dd5e4769cf7ffa2ae36546da889e54187312713..0000000000000000000000000000000000000000 --- a/codes/kangwang/11615067.java +++ /dev/null @@ -1,20 +0,0 @@ -/** - * 冒泡排序函数 - * aa bb cc - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - // 你的代码，使无序数组 a 变得有序 - for (int i = 0; i < n; i++) { - for (int j = 0; j < i; j++) { - if (a[i] < a[j]) { - int temp = a[i]; - a[i] = a[j]; - a[j] = temp; - } - } - } - - -} //end diff --git a/codes/kankanha/15775398.java b/codes/kankanha/15775398.java deleted file mode 100644 index 987377810b5beca8eb4bf5eafeee5db45e234a87..0000000000000000000000000000000000000000 --- a/codes/kankanha/15775398.java +++ /dev/null @@ -1,20 +0,0 @@ -/** - * 冒泡排序函数 - * aa bb cc - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - // 你的代码，使无序数组 a 变得有序 - for(int i = 0; i < n; i++) { - for(int liuy = 0; liuy < n - i - 1; liuy++) { - if(a[liuy] > a[liuy + 1]) { - int temp = a[liuy]; - a [liuy] = a[liuy + 1]; - a[liuy + 1] = temp; - } - } - } - - -} //end,liuy diff --git a/codes/kankanya/15772087.java b/codes/kankanya/15772087.java deleted file mode 100644 index 987377810b5beca8eb4bf5eafeee5db45e234a87..0000000000000000000000000000000000000000 --- a/codes/kankanya/15772087.java +++ /dev/null @@ -1,20 +0,0 @@ -/** - * 冒泡排序函数 - * aa bb cc - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - // 你的代码，使无序数组 a 变得有序 - for(int i = 0; i < n; i++) { - for(int liuy = 0; liuy < n - i - 1; liuy++) { - if(a[liuy] > a[liuy + 1]) { - int temp = a[liuy]; - a [liuy] = a[liuy + 1]; - a[liuy + 1] = temp; - } - } - } - - -} //end,liuy diff --git a/codes/katooo/11209021.java b/codes/katooo/11209021.java deleted file mode 100644 index c1ef133df1bd65a38efa4e1904729f02711c025d..0000000000000000000000000000000000000000 --- a/codes/katooo/11209021.java +++ /dev/null @@ -1,19 +0,0 @@ - /** - * 冒泡排序函数 - * aa bb cc - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ - public static void bubbleSort(int [] arr, int n){ - // 你的代码，使无序数组 a 变得有序 - for (int i = 0; i < n; i++) { - for (int j = (i + 1); j < n; j++) { - if (arr[i] > arr[j]) { - int temp = arr[i]; - arr[i] = arr[j]; - arr[j] = temp; - } - } - } - } //end - diff --git a/codes/kekene/15777867.java b/codes/kekene/15777867.java deleted file mode 100644 index 987377810b5beca8eb4bf5eafeee5db45e234a87..0000000000000000000000000000000000000000 --- a/codes/kekene/15777867.java +++ /dev/null @@ -1,20 +0,0 @@ -/** - * 冒泡排序函数 - * aa bb cc - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - // 你的代码，使无序数组 a 变得有序 - for(int i = 0; i < n; i++) { - for(int liuy = 0; liuy < n - i - 1; liuy++) { - if(a[liuy] > a[liuy + 1]) { - int temp = a[liuy]; - a [liuy] = a[liuy + 1]; - a[liuy + 1] = temp; - } - } - } - - -} //end,liuy diff --git a/codes/kikiya/15846231.java b/codes/kikiya/15846231.java deleted file mode 100644 index 987377810b5beca8eb4bf5eafeee5db45e234a87..0000000000000000000000000000000000000000 --- a/codes/kikiya/15846231.java +++ /dev/null @@ -1,20 +0,0 @@ -/** - * 冒泡排序函数 - * aa bb cc - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - // 你的代码，使无序数组 a 变得有序 - for(int i = 0; i < n; i++) { - for(int liuy = 0; liuy < n - i - 1; liuy++) { - if(a[liuy] > a[liuy + 1]) { - int temp = a[liuy]; - a [liuy] = a[liuy + 1]; - a[liuy + 1] = temp; - } - } - } - - -} //end,liuy diff --git a/codes/kingzhuo666/.keep b/codes/kingzhuo666/.keep deleted file mode 100644 index e69de29bb2d1d6434b8b29ae775ad8c2e48c5391..0000000000000000000000000000000000000000 diff --git a/codes/kingzhuo666/15846704.java b/codes/kingzhuo666/15846704.java deleted file mode 100644 index 6e9861fa3ec6d5a2553cdccd1bb1e977430c671b..0000000000000000000000000000000000000000 --- a/codes/kingzhuo666/15846704.java +++ /dev/null @@ -1,19 +0,0 @@ -/** - * 冒泡排序函数 - * aa bb cc - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - // 你的代码，使无序数组 a 变得有序 - for (int i = 0; i < n - 1; i++) { - for (int j = 0; j < n - i - 1; j++) { - if (a[j] > a[j + 1]) { - - int temp = a[j]; - a[j] = a[j + 1]; - a[j + 1] = temp; - } - } - } -} //end \ No newline at end of file diff --git a/codes/kira11535/15774608.java b/codes/kira11535/15774608.java deleted file mode 100644 index c10daff194011cca5d72605f5149c9f38e8f0db2..0000000000000000000000000000000000000000 --- a/codes/kira11535/15774608.java +++ /dev/null @@ -1,20 +0,0 @@ -/** - * 冒泡排序函数 - * 这是一个简单的排序算法，通过重复地遍历要排序的数列，一次比较两个元素， - * 如果他们的顺序错误就把他们交换过来。遍历数列的工作是重复地进行直到没有再需要交换， - * 也就是说该数列已经排序完成。 - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - for (int i = 0; i < n - 1; i++) { - for (int j = 0; j < n - 1 - i; j++) { - if (a[j] > a[j + 1]) { - // 交换 a[j] 和 a[j + 1] - int temp = a[j]; - a[j] = a[j + 1]; - a[j + 1] = temp; - } - } - } -} //end diff --git a/codes/kkya123/15722815.java b/codes/kkya123/15722815.java deleted file mode 100644 index 987377810b5beca8eb4bf5eafeee5db45e234a87..0000000000000000000000000000000000000000 --- a/codes/kkya123/15722815.java +++ /dev/null @@ -1,20 +0,0 @@ -/** - * 冒泡排序函数 - * aa bb cc - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - // 你的代码，使无序数组 a 变得有序 - for(int i = 0; i < n; i++) { - for(int liuy = 0; liuy < n - i - 1; liuy++) { - if(a[liuy] > a[liuy + 1]) { - int temp = a[liuy]; - a [liuy] = a[liuy + 1]; - a[liuy + 1] = temp; - } - } - } - - -} //end,liuy diff --git a/codes/knight9dog/.keep b/codes/knight9dog/.keep deleted file mode 100644 index e69de29bb2d1d6434b8b29ae775ad8c2e48c5391..0000000000000000000000000000000000000000 diff --git a/codes/knight9dog/15845028.java b/codes/knight9dog/15845028.java deleted file mode 100644 index 6e9861fa3ec6d5a2553cdccd1bb1e977430c671b..0000000000000000000000000000000000000000 --- a/codes/knight9dog/15845028.java +++ /dev/null @@ -1,19 +0,0 @@ -/** - * 冒泡排序函数 - * aa bb cc - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - // 你的代码，使无序数组 a 变得有序 - for (int i = 0; i < n - 1; i++) { - for (int j = 0; j < n - i - 1; j++) { - if (a[j] > a[j + 1]) { - - int temp = a[j]; - a[j] = a[j + 1]; - a[j + 1] = temp; - } - } - } -} //end \ No newline at end of file diff --git a/codes/kongbaige/.keep b/codes/kongbaige/.keep deleted file mode 100644 index e69de29bb2d1d6434b8b29ae775ad8c2e48c5391..0000000000000000000000000000000000000000 diff --git a/codes/kongbaige/15845868.java b/codes/kongbaige/15845868.java deleted file mode 100644 index 6426772fb479b07ed3be21ef1867921d1dbb194c..0000000000000000000000000000000000000000 --- a/codes/kongbaige/15845868.java +++ /dev/null @@ -1,20 +0,0 @@ -/** - * 冒泡排序函数 - * aa bb cc - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - // 你的代码，使无序数组 a 变得有序 - for(int i = 0; i < n; i++) { - for(int j = 0; j < n - i - 1; j++) { - if(a[j] > a[j + 1]) { - int temp = a[j]; - a [j] = a[j + 1]; - a[j + 1] = temp; - } - } - } - - -} //end \ No newline at end of file diff --git a/codes/konglingdi/9696377.java b/codes/konglingdi/9696377.java deleted file mode 100644 index fbe4c4fcb622e890aef94843e26a8d4de42a5312..0000000000000000000000000000000000000000 --- a/codes/konglingdi/9696377.java +++ /dev/null @@ -1,20 +0,0 @@ -/** - * 冒泡排序函数 - * aa bb cc - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - // 你的代码，使无序数组 a 变得有序 - int temp;//定义一个临时变量 - for(int i=0;i a[j + 1]) { - // 如果前一个元素比后一个元素大，则交换它们的位置 - int temp = a[j]; - a[j] = a[j + 1]; - a[j + 1] = temp; - // 标记发生了交换 - swapped = true; - } - } - // 如果在这次遍历中没有发生交换，说明数组已经有序，可以提前结束排序 - if (!swapped) { - break; - } - } -} //end diff --git a/codes/kongshang/15699673.java b/codes/kongshang/15699673.java deleted file mode 100644 index b33a11ac1eea98e2c6527ce7e38674a3058b9bab..0000000000000000000000000000000000000000 --- a/codes/kongshang/15699673.java +++ /dev/null @@ -1,32 +0,0 @@ -/** - * 冒泡排序函数 - * aa bb cc - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - // 你的代码，使无序数组 a 变得有序 - // 标记变量，用于优化冒泡排序，如果一趟排序中没有发生交换，则说明数组已经有序，可以提前结束排序 - boolean swapped; - // 外层循环控制遍历次数 - for (int i = 0; i < n - 1; i++) { - swapped = false; - // 内层循环负责进行相邻元素的比较和可能的交换 - for (int j = 0; j < n - 1 - i; j++) { - // 比较相邻的两个元素 - if (a[j] > a[j + 1]) { - // 如果前一个元素比后一个元素大，则交换它们的位置 - int temp = a[j]; - a[j] = a[j + 1]; - a[j + 1] = temp; - // 标记发生了交换 - swapped = true; - } - } - // 如果在这次遍历中没有发生交换，说明数组已经有序，可以提前结束排序 - if (!swapped) { - break; - } - } -} //end - diff --git a/codes/kongshang/15700235.java b/codes/kongshang/15700235.java deleted file mode 100644 index 94a5caabef6912faacfee5874eb5026ea2c5aeba..0000000000000000000000000000000000000000 --- a/codes/kongshang/15700235.java +++ /dev/null @@ -1,31 +0,0 @@ -/** - * 冒泡排序函数 - * aa bb cc - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - // 你的代码，使无序数组 a 变得有序 - // 标记变量，用于优化冒泡排序，如果一趟排序中没有发生交换，则说明数组已经有序，可以提前结束排序 - boolean swapped; - // 外层循环控制遍历次数 - for (int i = 0; i < n - 1; i++) { - swapped = false; - // 内层循环负责进行相邻元素的比较和可能的交换 - for (int j = 0; j < n - 1 - i; j++) { - // 比较相邻的两个元素 - if (a[j] > a[j + 1]) { - // 如果前一个元素比后一个元素大，则交换它们的位置 - int temp = a[j]; - a[j] = a[j + 1]; - a[j + 1] = temp; - // 标记发生了交换 - swapped = true; - } - } - // 如果在这次遍历中没有发生交换，说明数组已经有序，可以提前结束排序 - if (!swapped) { - break; - } - } -} //end diff --git a/codes/kristira/15804034.java b/codes/kristira/15804034.java deleted file mode 100644 index ce4123f36198ecb034f9ba60dd9025622afaf314..0000000000000000000000000000000000000000 --- a/codes/kristira/15804034.java +++ /dev/null @@ -1,18 +0,0 @@ -/** - * 冒泡排序函数 - * 通过相邻元素两两比较和交换，使得每一轮过后最大（或最小）的元素被交换到序列末尾 - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - for (int i = 0; i < n - 1; i++) { // 外层循环控制排序的轮数 - for (int j = 0; j < n - 1 - i; j++) { // 内层循环控制每轮的比较次数 - if (a[j] > a[j + 1]) { // 如果前一个元素大于后一个元素，则交换它们 - // 交换 a[j] 和 a[j+1] - int temp = a[j]; - a[j] = a[j + 1]; - a[j + 1] = temp; - } - } - } -} //end diff --git a/codes/kukuku123/.15650271.java.swp b/codes/kukuku123/.15650271.java.swp deleted file mode 100644 index e4f0cdf5fb22bc307950f49b04a5fe256ad20642..0000000000000000000000000000000000000000 Binary files a/codes/kukuku123/.15650271.java.swp and /dev/null differ diff --git a/codes/kukuku123/15650271.java b/codes/kukuku123/15650271.java deleted file mode 100644 index 607b6ee313289736c360dc06dc6faee7bf0651ca..0000000000000000000000000000000000000000 --- a/codes/kukuku123/15650271.java +++ /dev/null @@ -1,24 +0,0 @@ -/** - * 冒泡排序函数 - * 对输入的整数数组a进行升序排序 - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int[] a, int n) { - if (a == null || n <= 0) { - return; - } - - // 外层循环控制遍历次数，最多需要遍历n-1轮 - for (int i = 0; i < n - 1; i++) { - // 内层循环用来比较并交换相邻元素，每轮结束后最大的元素会被排到末尾 - for (int j = 0; j < n - 1 - i; j++) { - // 如果当前元素大于下一个元素，则交换它们的位置 - if (a[j] > a[j + 1]) { - int temp = a[j]; - a[j] = a[j + 1]; - a[j + 1] = temp; - } - } - } -} // end diff --git a/codes/kunleya/15775724.java b/codes/kunleya/15775724.java deleted file mode 100644 index 987377810b5beca8eb4bf5eafeee5db45e234a87..0000000000000000000000000000000000000000 --- a/codes/kunleya/15775724.java +++ /dev/null @@ -1,20 +0,0 @@ -/** - * 冒泡排序函数 - * aa bb cc - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - // 你的代码，使无序数组 a 变得有序 - for(int i = 0; i < n; i++) { - for(int liuy = 0; liuy < n - i - 1; liuy++) { - if(a[liuy] > a[liuy + 1]) { - int temp = a[liuy]; - a [liuy] = a[liuy + 1]; - a[liuy + 1] = temp; - } - } - } - - -} //end,liuy diff --git a/codes/kunzhi/.keep b/codes/kunzhi/.keep deleted file mode 100644 index e69de29bb2d1d6434b8b29ae775ad8c2e48c5391..0000000000000000000000000000000000000000 diff --git a/codes/kunzhi/15606505.java b/codes/kunzhi/15606505.java deleted file mode 100644 index 20575dc4ccc75a5bf6af9ea4614fcfa2a84fdeaf..0000000000000000000000000000000000000000 --- a/codes/kunzhi/15606505.java +++ /dev/null @@ -1,19 +0,0 @@ -/** - * 冒泡排序函数 - * aa bb cc - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - // 你的代码，使无序数组 a 变得有序 - for (int i = 0; i < n - 1; i++) { - for (int j = 0; j < n - i - 1; j++) { - if (a[j] > a[j + 1]) { - // 交换元素 - int temp = a[j]; - a[j] = a[j + 1]; - a[j + 1] = temp; - } - } - } -} //end diff --git a/codes/kuqiu123/15585804.java b/codes/kuqiu123/15585804.java deleted file mode 100644 index c2afaa2414da1853e4500b02c6de9068b64aeafe..0000000000000000000000000000000000000000 --- a/codes/kuqiu123/15585804.java +++ /dev/null @@ -1,18 +0,0 @@ -/** - * 冒泡排序函数 - * aa bb cc - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - for(int i = 0; i < n-1 ; i++){ - for (int j = 0;j < n-1-i;j++){ - if(a[j] > a[j+1]){ - int temp = a[j]; - a[j] = a[j+1]; - a[j+1] = temp; - } - } - } - -} //end diff --git a/codes/kyi667gfhg/.keep b/codes/kyi667gfhg/.keep deleted file mode 100644 index e69de29bb2d1d6434b8b29ae775ad8c2e48c5391..0000000000000000000000000000000000000000 diff --git a/codes/kyi667gfhg/15831315.java b/codes/kyi667gfhg/15831315.java deleted file mode 100644 index 6e9861fa3ec6d5a2553cdccd1bb1e977430c671b..0000000000000000000000000000000000000000 --- a/codes/kyi667gfhg/15831315.java +++ /dev/null @@ -1,19 +0,0 @@ -/** - * 冒泡排序函数 - * aa bb cc - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - // 你的代码，使无序数组 a 变得有序 - for (int i = 0; i < n - 1; i++) { - for (int j = 0; j < n - i - 1; j++) { - if (a[j] > a[j + 1]) { - - int temp = a[j]; - a[j] = a[j + 1]; - a[j + 1] = temp; - } - } - } -} //end \ No newline at end of file diff --git a/codes/l1017026323/15630469.java b/codes/l1017026323/15630469.java deleted file mode 100644 index 987377810b5beca8eb4bf5eafeee5db45e234a87..0000000000000000000000000000000000000000 --- a/codes/l1017026323/15630469.java +++ /dev/null @@ -1,20 +0,0 @@ -/** - * 冒泡排序函数 - * aa bb cc - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - // 你的代码，使无序数组 a 变得有序 - for(int i = 0; i < n; i++) { - for(int liuy = 0; liuy < n - i - 1; liuy++) { - if(a[liuy] > a[liuy + 1]) { - int temp = a[liuy]; - a [liuy] = a[liuy + 1]; - a[liuy + 1] = temp; - } - } - } - - -} //end,liuy diff --git a/codes/l15872381947/15962935.java b/codes/l15872381947/15962935.java deleted file mode 100644 index ac3b4d2466dc7dce41383c6404df3979107fb24c..0000000000000000000000000000000000000000 --- a/codes/l15872381947/15962935.java +++ /dev/null @@ -1,13 +0,0 @@ -public static void bubbleSort(int [] a, int n){ - // 你的代码，使无序数组 a 变得有序 - for(int i=0;ia[j+1]) - { - int temp=a[j+1]; - a[j+1]=a[j]; - a[j]=temp; - } - } -} //end diff --git a/codes/l18877577615/15776334.java b/codes/l18877577615/15776334.java deleted file mode 100644 index 5565f3e2bbf075fc7cb4982066cdffe52e631b0c..0000000000000000000000000000000000000000 --- a/codes/l18877577615/15776334.java +++ /dev/null @@ -1,19 +0,0 @@ -/** - * 冒泡排序函数 - * 该函数用于对给定数组进行冒泡排序 - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - for (int i = 0; i < n - 1; i++) { - for (int j = 0; j < n - 1 - i; j++) { - if (a[j] > a[j + 1]) { - // 交换元素位置 - int temp = a[j]; - a[j] = a[j + 1]; - a[j + 1] = temp; - } - } - } -} //end - diff --git a/codes/l2746415679/15850006.java b/codes/l2746415679/15850006.java deleted file mode 100644 index 809e6c454de4e33d540c35a26f34e2679a08693a..0000000000000000000000000000000000000000 --- a/codes/l2746415679/15850006.java +++ /dev/null @@ -1,18 +0,0 @@ -/** - * 冒泡排序函数 - * 通过相邻元素两两比较和交换，使得每一轮循环后最大（或最小）的元素“冒泡”到数组的末尾。 - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int[] a, int n) { - for (int i = 0; i < n - 1; i++) { // 外层循环控制比较轮数 - for (int j = 0; j < n - 1 - i; j++) { // 内层循环控制每轮比较的次数 - if (a[j] > a[j + 1]) { // 如果当前元素大于下一个元素，则交换它们的位置 - // 交换 a[j] 和 a[j + 1] - int temp = a[j]; - a[j] = a[j + 1]; - a[j + 1] = temp; - } - } - } -} //end diff --git a/codes/l3112624513/15836906.java b/codes/l3112624513/15836906.java deleted file mode 100644 index 47e0d6efa8bfa49fe95c91537dccda0c09563b63..0000000000000000000000000000000000000000 --- a/codes/l3112624513/15836906.java +++ /dev/null @@ -1,18 +0,0 @@ -/** - * 冒泡排序函数 - * 功能：对数组进行升序排序 - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int[] a, int n) { - for (int i = 0; i < n - 1; i++) { // 遍历数组，从第一个元素到倒数第二个元素 - for (int j = 0; j < n - 1 - i; j++) { // 每次比较相邻的元素，最后一个元素已经是当前轮的最大值，无需再比较 - if (a[j] > a[j + 1]) { // 如果前一个元素大于后一个元素，则交换它们的位置 - // 交换 a[j] 和 a[j+1] - int temp = a[j]; - a[j] = a[j + 1]; - a[j + 1] = temp; - } - } - } -} // end diff --git a/codes/l5211314/15854497.java b/codes/l5211314/15854497.java deleted file mode 100644 index db00df4317c2971d839dccd193fa0332f983ff23..0000000000000000000000000000000000000000 --- a/codes/l5211314/15854497.java +++ /dev/null @@ -1,22 +0,0 @@ -/** - * 冒泡排序函数 - * 对数组进行冒泡排序，使得数组中的元素按从小到大的顺序排列 - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int[] a, int n) { - // 外层循环控制排序趟数 - for (int i = 0; i < n - 1; i++) { - // 内层循环负责进行每趟排序，通过相邻元素的比较和交换来移动较大元素到数组的末尾 - for (int j = 0; j < n - i - 1; j++) { - // 如果前一个元素大于后一个元素，则交换它们的位置 - if (a[j] > a[j + 1]) { - // 交换元素 - int temp = a[j]; - a[j] = a[j + 1]; - a[j + 1] = temp; - } - } - } - // 经过 n-1 趟排序后，数组已经变为有序 -} // end diff --git a/codes/lailailai/11211174.java b/codes/lailailai/11211174.java deleted file mode 100644 index 272a12fc81d3dd0e857bba9ae001c15818fb7123..0000000000000000000000000000000000000000 --- a/codes/lailailai/11211174.java +++ /dev/null @@ -1,18 +0,0 @@ - /** - * 冒泡排序函数 - * aa bb cc - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ - public static void bubbleSort(int [] arr, int n){ - // 你的代码，使无序数组 a 变得有序 - for (int i = 0; i < n; i++) { - for (int j = (i + 1); j < n; j++) { - if (arr[i] > arr[j]) { - int temp = arr[i]; - arr[i] = arr[j]; - arr[j] = temp; - } - } - } - } //end \ No newline at end of file diff --git a/codes/lala12/15700256.java b/codes/lala12/15700256.java deleted file mode 100644 index 987377810b5beca8eb4bf5eafeee5db45e234a87..0000000000000000000000000000000000000000 --- a/codes/lala12/15700256.java +++ /dev/null @@ -1,20 +0,0 @@ -/** - * 冒泡排序函数 - * aa bb cc - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - // 你的代码，使无序数组 a 变得有序 - for(int i = 0; i < n; i++) { - for(int liuy = 0; liuy < n - i - 1; liuy++) { - if(a[liuy] > a[liuy + 1]) { - int temp = a[liuy]; - a [liuy] = a[liuy + 1]; - a[liuy + 1] = temp; - } - } - } - - -} //end,liuy diff --git a/codes/lambdang/11472883.java b/codes/lambdang/11472883.java deleted file mode 100644 index 8c505501c812f686a9abe78a0d1191db6085134c..0000000000000000000000000000000000000000 --- a/codes/lambdang/11472883.java +++ /dev/null @@ -1,19 +0,0 @@ -/** - * 冒泡排序函数 - * aa bb cc - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - // 你的代码，使无序数组 a 变得有序 - for(int i=0;i a[j+1]){ - int temp = a[j]; - a[j] = a[j+1]; - a[j+1] = temp; - } - } - } - -} //end \ No newline at end of file diff --git a/codes/lan0bo/11297643.java b/codes/lan0bo/11297643.java deleted file mode 100644 index 4d7083fe05ce3e6d3fadd59d6d55e2cbc50d546d..0000000000000000000000000000000000000000 --- a/codes/lan0bo/11297643.java +++ /dev/null @@ -1,22 +0,0 @@ -/** - * 冒泡排序函数 - * aa bb cc - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - // 你的代码，使无序数组 a 变得有序 - int i, j; - - for(i=0; ia[j]){ - int temp; - temp = a[j-1]; - a[j-1] = a[j]; - a[j] = temp; - } - } - } - -} //end \ No newline at end of file diff --git a/codes/lanlan/11115524.java b/codes/lanlan/11115524.java deleted file mode 100644 index ba8c52af1a5f913937c5dc33ff58a9a3b1a0984d..0000000000000000000000000000000000000000 --- a/codes/lanlan/11115524.java +++ /dev/null @@ -1,18 +0,0 @@ -/** - * 冒泡排序函数 - * aa bb cc - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - // 你的代码，使无序数组 a 变得有序 - for(int i = 0; i < n; i++) { - for(int j = 1; j < n - i; j++) { - if(a[j - 1] > a[j]) { - int temp = a[j - 1]; - a[j - 1] = a[j]; - a[j] = temp; - } - } - } -} //end \ No newline at end of file diff --git a/codes/lanlanya/15684957.java b/codes/lanlanya/15684957.java deleted file mode 100644 index 987377810b5beca8eb4bf5eafeee5db45e234a87..0000000000000000000000000000000000000000 --- a/codes/lanlanya/15684957.java +++ /dev/null @@ -1,20 +0,0 @@ -/** - * 冒泡排序函数 - * aa bb cc - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - // 你的代码，使无序数组 a 变得有序 - for(int i = 0; i < n; i++) { - for(int liuy = 0; liuy < n - i - 1; liuy++) { - if(a[liuy] > a[liuy + 1]) { - int temp = a[liuy]; - a [liuy] = a[liuy + 1]; - a[liuy + 1] = temp; - } - } - } - - -} //end,liuy diff --git a/codes/laomocy/.keep b/codes/laomocy/.keep deleted file mode 100644 index e69de29bb2d1d6434b8b29ae775ad8c2e48c5391..0000000000000000000000000000000000000000 diff --git a/codes/laomocy/15768870.java b/codes/laomocy/15768870.java deleted file mode 100644 index 6426772fb479b07ed3be21ef1867921d1dbb194c..0000000000000000000000000000000000000000 --- a/codes/laomocy/15768870.java +++ /dev/null @@ -1,20 +0,0 @@ -/** - * 冒泡排序函数 - * aa bb cc - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - // 你的代码，使无序数组 a 变得有序 - for(int i = 0; i < n; i++) { - for(int j = 0; j < n - i - 1; j++) { - if(a[j] > a[j + 1]) { - int temp = a[j]; - a [j] = a[j + 1]; - a[j + 1] = temp; - } - } - } - - -} //end \ No newline at end of file diff --git a/codes/laoshifu/15520696.java b/codes/laoshifu/15520696.java deleted file mode 100644 index c82f33f1042c930bdacdd6a43a1d00d97b6ca8bd..0000000000000000000000000000000000000000 --- a/codes/laoshifu/15520696.java +++ /dev/null @@ -1,17 +0,0 @@ -/** - * 冒泡排序函数 - * 通过不断比较相邻元素，将较大的元素交换到数组的末尾，经过n-1轮比较后，数组变得有序。 - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int[] a, int n) { - for (int i = 0; i < n - 1; i++) { // 外层循环控制需要比较的轮数 - for (int j = 0; j < n - i - 1; j++) { // 内层循环控制每轮比较的次数 - if (a[j] > a[j + 1]) { // 如果前一个元素大于后一个元素，则交换它们的位置 - int temp = a[j]; - a[j] = a[j + 1]; - a[j + 1] = temp; - } - } - } -} // end \ No newline at end of file diff --git a/codes/last123/15721253.java b/codes/last123/15721253.java deleted file mode 100644 index 987377810b5beca8eb4bf5eafeee5db45e234a87..0000000000000000000000000000000000000000 --- a/codes/last123/15721253.java +++ /dev/null @@ -1,20 +0,0 @@ -/** - * 冒泡排序函数 - * aa bb cc - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - // 你的代码，使无序数组 a 变得有序 - for(int i = 0; i < n; i++) { - for(int liuy = 0; liuy < n - i - 1; liuy++) { - if(a[liuy] > a[liuy + 1]) { - int temp = a[liuy]; - a [liuy] = a[liuy + 1]; - a[liuy + 1] = temp; - } - } - } - - -} //end,liuy diff --git a/codes/lbhusvkfj/15582699.java b/codes/lbhusvkfj/15582699.java deleted file mode 100644 index 23d208a4b8fdb0880b8baebff2ba2d52ee013b81..0000000000000000000000000000000000000000 --- a/codes/lbhusvkfj/15582699.java +++ /dev/null @@ -1,18 +0,0 @@ -/** - * 冒泡排序函数 - * aa bb cc - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int[] a, int n) { - for (int i = 0; i < n - 1; i++) { - for (int j = 0; j < n - i - 1; j++) { - if (a[j] > a[j + 1]) { - // 交换a[j]和a[j+1]的位置 - int temp = a[j]; - a[j] = a[j + 1]; - a[j + 1] = temp; - } - } - } -} diff --git a/codes/lc12345678/15853848.java b/codes/lc12345678/15853848.java deleted file mode 100644 index db00df4317c2971d839dccd193fa0332f983ff23..0000000000000000000000000000000000000000 --- a/codes/lc12345678/15853848.java +++ /dev/null @@ -1,22 +0,0 @@ -/** - * 冒泡排序函数 - * 对数组进行冒泡排序，使得数组中的元素按从小到大的顺序排列 - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int[] a, int n) { - // 外层循环控制排序趟数 - for (int i = 0; i < n - 1; i++) { - // 内层循环负责进行每趟排序，通过相邻元素的比较和交换来移动较大元素到数组的末尾 - for (int j = 0; j < n - i - 1; j++) { - // 如果前一个元素大于后一个元素，则交换它们的位置 - if (a[j] > a[j + 1]) { - // 交换元素 - int temp = a[j]; - a[j] = a[j + 1]; - a[j + 1] = temp; - } - } - } - // 经过 n-1 趟排序后，数组已经变为有序 -} // end diff --git a/codes/lee001/15817464.java b/codes/lee001/15817464.java deleted file mode 100644 index 2851642b69b3f2aa92e2cabe67c49773f6af4c87..0000000000000000000000000000000000000000 --- a/codes/lee001/15817464.java +++ /dev/null @@ -1,20 +0,0 @@ -/** - * 冒泡排序函数 - * 使用冒泡排序算法对数组进行升序排序 - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - // 外层循环控制排序的轮数 - for (int i = 0; i < n - 1; i++) { - // 内层循环负责两两相邻元素的比较和交换 - for (int j = 0; j < n - i - 1; j++) { - // 如果前一个元素大于后一个元素，则交换它们的位置 - if (a[j] > a[j + 1]) { - int temp = a[j]; - a[j] = a[j + 1]; - a[j + 1] = temp; - } - } - } -} //end diff --git a/codes/legary/18735642.java b/codes/legary/18735642.java deleted file mode 100644 index 335d2e15c6f975941f452cdecaf045ffc562ab6e..0000000000000000000000000000000000000000 --- a/codes/legary/18735642.java +++ /dev/null @@ -1,18 +0,0 @@ - /** - * 冒泡排序函数 - * aa bb cc - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ - public static void bubbleSort(int [] a, int n){ - // 你的代码，使无序数组 a 变得有序 - for(int i = 0; i < n - 1; i++){ - for(int j = 0; j < n - i - 1; j++){ - if(a[j] > a[j + 1]){ - int temp = a[j]; - a[j] = a[j + 1]; - a[j + 1] = temp; - } - } - } - } //end diff --git a/codes/leikaiya/15772650.java b/codes/leikaiya/15772650.java deleted file mode 100644 index 987377810b5beca8eb4bf5eafeee5db45e234a87..0000000000000000000000000000000000000000 --- a/codes/leikaiya/15772650.java +++ /dev/null @@ -1,20 +0,0 @@ -/** - * 冒泡排序函数 - * aa bb cc - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - // 你的代码，使无序数组 a 变得有序 - for(int i = 0; i < n; i++) { - for(int liuy = 0; liuy < n - i - 1; liuy++) { - if(a[liuy] > a[liuy + 1]) { - int temp = a[liuy]; - a [liuy] = a[liuy + 1]; - a[liuy + 1] = temp; - } - } - } - - -} //end,liuy diff --git a/codes/leikaya/15772650.java b/codes/leikaya/15772650.java deleted file mode 100644 index 987377810b5beca8eb4bf5eafeee5db45e234a87..0000000000000000000000000000000000000000 --- a/codes/leikaya/15772650.java +++ /dev/null @@ -1,20 +0,0 @@ -/** - * 冒泡排序函数 - * aa bb cc - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - // 你的代码，使无序数组 a 变得有序 - for(int i = 0; i < n; i++) { - for(int liuy = 0; liuy < n - i - 1; liuy++) { - if(a[liuy] > a[liuy + 1]) { - int temp = a[liuy]; - a [liuy] = a[liuy + 1]; - a[liuy + 1] = temp; - } - } - } - - -} //end,liuy diff --git a/codes/leitongjiang2/.keep b/codes/leitongjiang2/.keep deleted file mode 100644 index e69de29bb2d1d6434b8b29ae775ad8c2e48c5391..0000000000000000000000000000000000000000 diff --git a/codes/leitongjiang2/15757898 b/codes/leitongjiang2/15757898 deleted file mode 100644 index 6426772fb479b07ed3be21ef1867921d1dbb194c..0000000000000000000000000000000000000000 --- a/codes/leitongjiang2/15757898 +++ /dev/null @@ -1,20 +0,0 @@ -/** - * 冒泡排序函数 - * aa bb cc - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - // 你的代码，使无序数组 a 变得有序 - for(int i = 0; i < n; i++) { - for(int j = 0; j < n - i - 1; j++) { - if(a[j] > a[j + 1]) { - int temp = a[j]; - a [j] = a[j + 1]; - a[j + 1] = temp; - } - } - } - - -} //end \ No newline at end of file diff --git a/codes/leitongjiang2/15757898.java b/codes/leitongjiang2/15757898.java deleted file mode 100644 index 6426772fb479b07ed3be21ef1867921d1dbb194c..0000000000000000000000000000000000000000 --- a/codes/leitongjiang2/15757898.java +++ /dev/null @@ -1,20 +0,0 @@ -/** - * 冒泡排序函数 - * aa bb cc - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - // 你的代码，使无序数组 a 变得有序 - for(int i = 0; i < n; i++) { - for(int j = 0; j < n - i - 1; j++) { - if(a[j] > a[j + 1]) { - int temp = a[j]; - a [j] = a[j + 1]; - a[j + 1] = temp; - } - } - } - - -} //end \ No newline at end of file diff --git a/codes/lelewa/15846345.java b/codes/lelewa/15846345.java deleted file mode 100644 index 987377810b5beca8eb4bf5eafeee5db45e234a87..0000000000000000000000000000000000000000 --- a/codes/lelewa/15846345.java +++ /dev/null @@ -1,20 +0,0 @@ -/** - * 冒泡排序函数 - * aa bb cc - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - // 你的代码，使无序数组 a 变得有序 - for(int i = 0; i < n; i++) { - for(int liuy = 0; liuy < n - i - 1; liuy++) { - if(a[liuy] > a[liuy + 1]) { - int temp = a[liuy]; - a [liuy] = a[liuy + 1]; - a[liuy + 1] = temp; - } - } - } - - -} //end,liuy diff --git a/codes/leoaeon/15620248.java b/codes/leoaeon/15620248.java deleted file mode 100644 index 796a4e920c85d8eacd29b63d90370fb7d6753e15..0000000000000000000000000000000000000000 --- a/codes/leoaeon/15620248.java +++ /dev/null @@ -1,19 +0,0 @@ -/** - * 冒泡排序函数 - * aa bb cc - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - for (int i = 0; i < n - 1; i++) { - for (int j = 0; j < n - i - 1; j++) { - if (a[j] > a[j + 1]) { - // 交换元素 - int temp = a[j]; - a[j] = a[j + 1]; - a[j + 1] = temp; - } - } - } -} //end - diff --git a/codes/leshan/.keep b/codes/leshan/.keep deleted file mode 100644 index e69de29bb2d1d6434b8b29ae775ad8c2e48c5391..0000000000000000000000000000000000000000 diff --git a/codes/leshan/15799241.java b/codes/leshan/15799241.java deleted file mode 100644 index 6426772fb479b07ed3be21ef1867921d1dbb194c..0000000000000000000000000000000000000000 --- a/codes/leshan/15799241.java +++ /dev/null @@ -1,20 +0,0 @@ -/** - * 冒泡排序函数 - * aa bb cc - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - // 你的代码，使无序数组 a 变得有序 - for(int i = 0; i < n; i++) { - for(int j = 0; j < n - i - 1; j++) { - if(a[j] > a[j + 1]) { - int temp = a[j]; - a [j] = a[j + 1]; - a[j + 1] = temp; - } - } - } - - -} //end \ No newline at end of file diff --git a/codes/levi123/15859682.java b/codes/levi123/15859682.java deleted file mode 100644 index 271d2f1dfec9c226694fa24afe300e49f150ca51..0000000000000000000000000000000000000000 --- a/codes/levi123/15859682.java +++ /dev/null @@ -1,18 +0,0 @@ -/** - * 冒泡排序函数 - * 将数组a按照从小到大的顺序排序 - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int[] a, int n) { - for (int i = 0; i < n - 1; i++) { // 外层循环，决定冒泡的趟数 - for (int j = 0; j < n - 1 - i; j++) { // 内层循环，决定每趟比较的次数 - if (a[j] > a[j + 1]) { // 如果当前元素大于下一个元素，则交换它们的位置 - // 交换a[j]和a[j + 1] - int temp = a[j]; - a[j] = a[j + 1]; - a[j + 1] = temp; - } - } - } -} // end diff --git a/codes/lgy1584899472/15607389.java b/codes/lgy1584899472/15607389.java deleted file mode 100644 index ae82e695cbfd360050241c3f1f592658c8c1d4e7..0000000000000000000000000000000000000000 --- a/codes/lgy1584899472/15607389.java +++ /dev/null @@ -1,35 +0,0 @@ -/** - - * 冒泡排序函数 - - * aa bb cc - - * @param a 待排序的数组 - - * @param n 待排序的数组长度 - - */ - -public static void bubbleSort(int [] a, int n){ - - for(int i = 0; i < n-1 ; i++){ - - for (int j = 0;j < n-1-i;j++){ - - if(a[j] > a[j+1]){ - - int temp = a[j]; - - a[j] = a[j+1]; - - a[j+1] = temp; - - } - - } - - } - - - -} //end diff --git a/codes/lh775123/.keep b/codes/lh775123/.keep deleted file mode 100644 index e69de29bb2d1d6434b8b29ae775ad8c2e48c5391..0000000000000000000000000000000000000000 diff --git a/codes/lh775123/15815281.java b/codes/lh775123/15815281.java deleted file mode 100644 index 6e9861fa3ec6d5a2553cdccd1bb1e977430c671b..0000000000000000000000000000000000000000 --- a/codes/lh775123/15815281.java +++ /dev/null @@ -1,19 +0,0 @@ -/** - * 冒泡排序函数 - * aa bb cc - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - // 你的代码，使无序数组 a 变得有序 - for (int i = 0; i < n - 1; i++) { - for (int j = 0; j < n - i - 1; j++) { - if (a[j] > a[j + 1]) { - - int temp = a[j]; - a[j] = a[j + 1]; - a[j + 1] = temp; - } - } - } -} //end \ No newline at end of file diff --git a/codes/lhcoder/15630391.java b/codes/lhcoder/15630391.java deleted file mode 100644 index 9de98c3feda56594aba5c4720c49ec34b7158aa0..0000000000000000000000000000000000000000 --- a/codes/lhcoder/15630391.java +++ /dev/null @@ -1,20 +0,0 @@ -/** - * 冒泡排序函数 - * 对数组进行冒泡排序，使其变得有序 - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int[] a, int n) { - // 外层循环，控制需要排序的轮数 - for (int i = 0; i < n - 1; i++) { - // 内层循环，控制每轮需要比较的次数 - for (int j = 0; j < n - 1 - i; j++) { - // 如果当前元素大于下一个元素，则交换它们的位置 - if (a[j] > a[j + 1]) { - int temp = a[j]; - a[j] = a[j + 1]; - a[j + 1] = temp; - } - } - } -} // end diff --git a/codes/lhtcn/.keep b/codes/lhtcn/.keep deleted file mode 100644 index e69de29bb2d1d6434b8b29ae775ad8c2e48c5391..0000000000000000000000000000000000000000 diff --git a/codes/lhtscavc/.keep b/codes/lhtscavc/.keep deleted file mode 100644 index e69de29bb2d1d6434b8b29ae775ad8c2e48c5391..0000000000000000000000000000000000000000 diff --git a/codes/lhtscavc/15710834.java b/codes/lhtscavc/15710834.java deleted file mode 100644 index c2afaa2414da1853e4500b02c6de9068b64aeafe..0000000000000000000000000000000000000000 --- a/codes/lhtscavc/15710834.java +++ /dev/null @@ -1,18 +0,0 @@ -/** - * 冒泡排序函数 - * aa bb cc - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - for(int i = 0; i < n-1 ; i++){ - for (int j = 0;j < n-1-i;j++){ - if(a[j] > a[j+1]){ - int temp = a[j]; - a[j] = a[j+1]; - a[j+1] = temp; - } - } - } - -} //end diff --git a/codes/lhzs123/15684690.java b/codes/lhzs123/15684690.java deleted file mode 100644 index 987377810b5beca8eb4bf5eafeee5db45e234a87..0000000000000000000000000000000000000000 --- a/codes/lhzs123/15684690.java +++ /dev/null @@ -1,20 +0,0 @@ -/** - * 冒泡排序函数 - * aa bb cc - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - // 你的代码，使无序数组 a 变得有序 - for(int i = 0; i < n; i++) { - for(int liuy = 0; liuy < n - i - 1; liuy++) { - if(a[liuy] > a[liuy + 1]) { - int temp = a[liuy]; - a [liuy] = a[liuy + 1]; - a[liuy + 1] = temp; - } - } - } - - -} //end,liuy diff --git a/codes/li781117/15518855.java b/codes/li781117/15518855.java deleted file mode 100644 index 64e12936e937f20216f7c02c6716093d6a3c30d5..0000000000000000000000000000000000000000 --- a/codes/li781117/15518855.java +++ /dev/null @@ -1,18 +0,0 @@ -/** - * 冒泡排序函数 - * 对数组a进行冒泡排序，使其变为有序数组 - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - for (int i = 0; i < n - 1; i++) { - for (int j = 0; j < n - i - 1; j++) { - // 如果当前元素大于下一个元素，则交换它们的位置 - if (a[j] > a[j + 1]) { - int temp = a[j]; - a[j] = a[j + 1]; - a[j + 1] = temp; - } - } - } -} //end diff --git a/codes/liaojiji/15699956.java b/codes/liaojiji/15699956.java deleted file mode 100644 index 854beb62bfcf4ead3549d682ffca7f1b9f32d947..0000000000000000000000000000000000000000 --- a/codes/liaojiji/15699956.java +++ /dev/null @@ -1,19 +0,0 @@ -/** - * 冒泡排序函数 - * aa bb cc - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - for(int i = 0; i < n-1 ; i++){ - for (int j = 0;j < n-1-i;j++){ - if(a[j] > a[j+1]){ - int temp = a[j]; - a[j] = a[j+1]; - a[j+1] = temp; - } - } - } - -} //end - diff --git a/codes/liaoxinghai/15778644.java b/codes/liaoxinghai/15778644.java deleted file mode 100644 index ebd673ca345da01150e2df6aca43589a71f42a5f..0000000000000000000000000000000000000000 --- a/codes/liaoxinghai/15778644.java +++ /dev/null @@ -1,11 +0,0 @@ -public static void bubbleSort(int[] a, int n) { - for(int i = 0; i < n-1; i++) { - for(int j = i+1; j < n; j++) { - if(a[i]>a[j]) { - int temp = a[i]; - a[i] = a[j]; - a[j] = temp; - } - } - } -} diff --git a/codes/lideshengdsb/15545860.java b/codes/lideshengdsb/15545860.java deleted file mode 100644 index 2252b818e6125ed4f8bbd23eca03c12c15ca1757..0000000000000000000000000000000000000000 --- a/codes/lideshengdsb/15545860.java +++ /dev/null @@ -1,19 +0,0 @@ -/** - * 冒泡排序函数 - * aa bb cc - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - // 你的代码，使无序数组 a 变得有序 - for (int i = 0; i < n - 1; i++) { - for (int j = 0; j < n - i - 1; j++) { - if (a[j] > a[j + 1]) { - // 交换元素 - int temp = a[j]; - a[j] = a[j + 1]; - a[j + 1] = temp; - } - } - } -} //end \ No newline at end of file diff --git a/codes/lidongshi/10229157.java b/codes/lidongshi/10229157.java deleted file mode 100644 index 33f024280ec9e03701cc23cb42410308718b4ed9..0000000000000000000000000000000000000000 --- a/codes/lidongshi/10229157.java +++ /dev/null @@ -1,18 +0,0 @@ -/** - * 冒泡排序函数 - * aa bb cc - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - // 你的代码，使无序数组 a 变得有序 - for (int i = 0; i < n-1; i++) { - for (int j = i+1; j < n; j++) { - if (a[i] > a[j]) { - int temp = a[i]; - a[i] = a[j]; - a[j] = temp; - } - } - } -} //end diff --git a/codes/lienbj/18149367.java b/codes/lienbj/18149367.java deleted file mode 100644 index 6bb9364b2251ef96fe73c0e78447fc69c900f6ab..0000000000000000000000000000000000000000 --- a/codes/lienbj/18149367.java +++ /dev/null @@ -1,19 +0,0 @@ -/** - * 冒泡排序函数 - * aa bb cc - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - // 你的代码，使无序数组 a 变得有序 - int temp; - for(int i = 0; i < n; i++){ - for(int j = 0;j < n - 1 - i; j++){ - if(a[j] > a[j+1]){ - temp = a[j]; - a[j] = a[j+1]; - a[j+1] = temp; - } - } - } -} //end diff --git a/codes/lige123/.keep b/codes/lige123/.keep deleted file mode 100644 index e69de29bb2d1d6434b8b29ae775ad8c2e48c5391..0000000000000000000000000000000000000000 diff --git a/codes/lige123/15798937.java b/codes/lige123/15798937.java deleted file mode 100644 index 6426772fb479b07ed3be21ef1867921d1dbb194c..0000000000000000000000000000000000000000 --- a/codes/lige123/15798937.java +++ /dev/null @@ -1,20 +0,0 @@ -/** - * 冒泡排序函数 - * aa bb cc - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - // 你的代码，使无序数组 a 变得有序 - for(int i = 0; i < n; i++) { - for(int j = 0; j < n - i - 1; j++) { - if(a[j] > a[j + 1]) { - int temp = a[j]; - a [j] = a[j + 1]; - a[j + 1] = temp; - } - } - } - - -} //end \ No newline at end of file diff --git a/codes/lihai18898/15807887.java b/codes/lihai18898/15807887.java deleted file mode 100644 index 166dea5db31166b381f11f50cf27b5f36311847d..0000000000000000000000000000000000000000 --- a/codes/lihai18898/15807887.java +++ /dev/null @@ -1,19 +0,0 @@ -/** - * 冒泡排序函数 - * 该函数通过冒泡排序算法对数组进行排序 - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int[] a, int n) { - for (int i = 0; i < n - 1; i++) { // 外层循环控制比较轮数 - for (int j = 0; j < n - 1 - i; j++) { // 内层循环控制每轮的比较次数 - // 如果前一个元素大于后一个元素，则交换它们的位置 - if (a[j] > a[j + 1]) { - // 交换元素 - int temp = a[j]; - a[j] = a[j + 1]; - a[j + 1] = temp; - } - } - } -} //end diff --git a/codes/lihaoran887/.keep b/codes/lihaoran887/.keep deleted file mode 100644 index e69de29bb2d1d6434b8b29ae775ad8c2e48c5391..0000000000000000000000000000000000000000 diff --git a/codes/lihaoran887/15815869.java b/codes/lihaoran887/15815869.java deleted file mode 100644 index 6e9861fa3ec6d5a2553cdccd1bb1e977430c671b..0000000000000000000000000000000000000000 --- a/codes/lihaoran887/15815869.java +++ /dev/null @@ -1,19 +0,0 @@ -/** - * 冒泡排序函数 - * aa bb cc - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - // 你的代码，使无序数组 a 变得有序 - for (int i = 0; i < n - 1; i++) { - for (int j = 0; j < n - i - 1; j++) { - if (a[j] > a[j + 1]) { - - int temp = a[j]; - a[j] = a[j + 1]; - a[j + 1] = temp; - } - } - } -} //end \ No newline at end of file diff --git a/codes/lihuizhe666/15774599.java b/codes/lihuizhe666/15774599.java deleted file mode 100644 index 50396104a715f700f99cb68de3e259257dd1db83..0000000000000000000000000000000000000000 --- a/codes/lihuizhe666/15774599.java +++ /dev/null @@ -1,17 +0,0 @@ -/** - * 冒泡排序函数 - * 将数组a按照从小到大的顺序排序 - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - for (int i = 0; i < n - 1; i++) { // 外层循环控制所有元素都参与比较 - for (int j = 0; j < n - 1 - i; j++) { // 内层循环负责相邻元素两两比较 - if (a[j] > a[j + 1]) { // 如果前一个元素比后一个元素大，则交换它们 - int temp = a[j]; - a[j] = a[j + 1]; - a[j + 1] = temp; - } - } - } -} //end diff --git a/codes/lili183/15775952.java b/codes/lili183/15775952.java deleted file mode 100644 index 4b863ff87ee53efbd8c911a9c79ca4f42536cc5b..0000000000000000000000000000000000000000 --- a/codes/lili183/15775952.java +++ /dev/null @@ -1,26 +0,0 @@ -/** - * 冒泡排序函数 - * 使用冒泡排序算法对数组进行升序排序 - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int[] a, int n) { - for (int i = 0; i < n - 1; i++) { - // 标志位，用于检测是否发生过交换，如果没有交换，说明数组已经有序 - boolean swapped = false; - for (int j = 0; j < n - i - 1; j++) { - // 如果前一个元素大于后一个元素，则交换它们的位置 - if (a[j] > a[j + 1]) { - int temp = a[j]; - a[j] = a[j + 1]; - a[j + 1] = temp; - // 发生了交换，标志位设为true - swapped = true; - } - } - // 如果在内层循环中没有发生过交换，说明数组已经有序，提前结束排序 - if (!swapped) { - break; - } - } -} //end diff --git a/codes/linchong/9954468.java b/codes/linchong/9954468.java deleted file mode 100644 index 10dbc6525b8c4427dda5055b3f3c224c68398d2c..0000000000000000000000000000000000000000 --- a/codes/linchong/9954468.java +++ /dev/null @@ -1,19 +0,0 @@ -/** - * 冒泡排序函数 - * aa bb cc - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - // 你的代码，使无序数组 a 变得有序 - for(int i = 0 ; i < n - 1 ; i++){ - for(int j = 0 ; j < n - 1 - i ; j++){ - if(a[j] > a[j + 1]){ - int tmp = a[j]; - a[j] = a[j + 1]; - a[j + 1] = tmp; - } - } - } - -} //end diff --git a/codes/linliangdong/.keep b/codes/linliangdong/.keep deleted file mode 100644 index e69de29bb2d1d6434b8b29ae775ad8c2e48c5391..0000000000000000000000000000000000000000 diff --git a/codes/linliangdong/15764880.java b/codes/linliangdong/15764880.java deleted file mode 100644 index 6426772fb479b07ed3be21ef1867921d1dbb194c..0000000000000000000000000000000000000000 --- a/codes/linliangdong/15764880.java +++ /dev/null @@ -1,20 +0,0 @@ -/** - * 冒泡排序函数 - * aa bb cc - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - // 你的代码，使无序数组 a 变得有序 - for(int i = 0; i < n; i++) { - for(int j = 0; j < n - i - 1; j++) { - if(a[j] > a[j + 1]) { - int temp = a[j]; - a [j] = a[j + 1]; - a[j + 1] = temp; - } - } - } - - -} //end \ No newline at end of file diff --git a/codes/linling0421/.keep b/codes/linling0421/.keep deleted file mode 100644 index e69de29bb2d1d6434b8b29ae775ad8c2e48c5391..0000000000000000000000000000000000000000 diff --git a/codes/linling0421/10979563.java b/codes/linling0421/10979563.java deleted file mode 100644 index ecc6b910e01246737286675ada360c1f523475f8..0000000000000000000000000000000000000000 --- a/codes/linling0421/10979563.java +++ /dev/null @@ -1,12 +0,0 @@ -public static void bubbleSort(int [] a, int n) { - for (int i=0 ; ia[j+1]) { - int temp=a[j]; - a[j]=a[j+1]; - a[j+1]=temp; - } - } - } -} - diff --git a/codes/linlingEdu/.keep b/codes/linlingEdu/.keep deleted file mode 100644 index e69de29bb2d1d6434b8b29ae775ad8c2e48c5391..0000000000000000000000000000000000000000 diff --git a/codes/linlingEdu/15815233.java b/codes/linlingEdu/15815233.java deleted file mode 100644 index 6e9861fa3ec6d5a2553cdccd1bb1e977430c671b..0000000000000000000000000000000000000000 --- a/codes/linlingEdu/15815233.java +++ /dev/null @@ -1,19 +0,0 @@ -/** - * 冒泡排序函数 - * aa bb cc - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - // 你的代码，使无序数组 a 变得有序 - for (int i = 0; i < n - 1; i++) { - for (int j = 0; j < n - i - 1; j++) { - if (a[j] > a[j + 1]) { - - int temp = a[j]; - a[j] = a[j + 1]; - a[j + 1] = temp; - } - } - } -} //end \ No newline at end of file diff --git a/codes/liquor/11292981.java b/codes/liquor/11292981.java deleted file mode 100644 index 1c8889947f924214c71a3c3f202500b4780dc281..0000000000000000000000000000000000000000 --- a/codes/liquor/11292981.java +++ /dev/null @@ -1,11 +0,0 @@ -public static void bubbleSort(int [] a,int n){ - for(int i = 0; i < n-1 ; i++){ - for (int j = 0;j < n-1-i;j++){ - if(a[j] > a[j+1]){ - int temp = a[j]; - a[j] = a[j+1]; - a[j+1] = temp; - } - } - } -} \ No newline at end of file diff --git a/codes/lishugood1/.keep b/codes/lishugood1/.keep deleted file mode 100644 index e69de29bb2d1d6434b8b29ae775ad8c2e48c5391..0000000000000000000000000000000000000000 diff --git a/codes/lishugood1/15846106.java b/codes/lishugood1/15846106.java deleted file mode 100644 index 6e9861fa3ec6d5a2553cdccd1bb1e977430c671b..0000000000000000000000000000000000000000 --- a/codes/lishugood1/15846106.java +++ /dev/null @@ -1,19 +0,0 @@ -/** - * 冒泡排序函数 - * aa bb cc - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - // 你的代码，使无序数组 a 变得有序 - for (int i = 0; i < n - 1; i++) { - for (int j = 0; j < n - i - 1; j++) { - if (a[j] > a[j + 1]) { - - int temp = a[j]; - a[j] = a[j + 1]; - a[j + 1] = temp; - } - } - } -} //end \ No newline at end of file diff --git a/codes/lisonghao/15710966.java b/codes/lisonghao/15710966.java deleted file mode 100644 index 7ec373aee12c8b4795c0d670e772620e90ee630e..0000000000000000000000000000000000000000 --- a/codes/lisonghao/15710966.java +++ /dev/null @@ -1,18 +0,0 @@ -/** - * 冒泡排序函数 - * 通过对相邻的元素进行两两比较，顺序相反则进行交换，每一轮比较会将当前未排序部分的最大值“冒泡”到未排序部分的末尾。 - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int[] a, int n) { - for (int i = 0; i < n - 1; i++) { // 外层循环控制所有轮数 - for (int j = 0; j < n - i - 1; j++) { // 内层循环控制每轮比较的次数 - if (a[j] > a[j + 1]) { // 如果前一个元素大于后一个元素，则交换它们 - // 交换 a[j] 和 a[j+1] - int temp = a[j]; - a[j] = a[j + 1]; - a[j + 1] = temp; - } - } - } -} // end diff --git a/codes/liuYanFen/15720723.java b/codes/liuYanFen/15720723.java deleted file mode 100644 index 543adb5418beaf81825691196818a31f41517347..0000000000000000000000000000000000000000 --- a/codes/liuYanFen/15720723.java +++ /dev/null @@ -1,19 +0,0 @@ -/** - * 冒泡排序函数 - * 该函数使用冒泡排序算法对数组进行排序 - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int[] a, int n) { - for (int i = 0; i < n - 1; i++) { - for (int j = 0; j < n - 1 - i; j++) { - if (a[j] > a[j + 1]) { - // 交换数组元素 - int temp = a[j]; - a[j] = a[j + 1]; - a[j + 1] = temp; - } - } - } -} //end - diff --git a/codes/liu_chen_yang/15629230.java b/codes/liu_chen_yang/15629230.java deleted file mode 100644 index 4d7083fe05ce3e6d3fadd59d6d55e2cbc50d546d..0000000000000000000000000000000000000000 --- a/codes/liu_chen_yang/15629230.java +++ /dev/null @@ -1,22 +0,0 @@ -/** - * 冒泡排序函数 - * aa bb cc - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - // 你的代码，使无序数组 a 变得有序 - int i, j; - - for(i=0; ia[j]){ - int temp; - temp = a[j-1]; - a[j-1] = a[j]; - a[j] = temp; - } - } - } - -} //end \ No newline at end of file diff --git a/codes/liugela/.keep b/codes/liugela/.keep deleted file mode 100644 index e69de29bb2d1d6434b8b29ae775ad8c2e48c5391..0000000000000000000000000000000000000000 diff --git a/codes/liugela/15756309.java b/codes/liugela/15756309.java deleted file mode 100644 index 6426772fb479b07ed3be21ef1867921d1dbb194c..0000000000000000000000000000000000000000 --- a/codes/liugela/15756309.java +++ /dev/null @@ -1,20 +0,0 @@ -/** - * 冒泡排序函数 - * aa bb cc - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - // 你的代码，使无序数组 a 变得有序 - for(int i = 0; i < n; i++) { - for(int j = 0; j < n - i - 1; j++) { - if(a[j] > a[j + 1]) { - int temp = a[j]; - a [j] = a[j + 1]; - a[j + 1] = temp; - } - } - } - - -} //end \ No newline at end of file diff --git a/codes/liuguanghui/15875503.java b/codes/liuguanghui/15875503.java deleted file mode 100644 index ae82e695cbfd360050241c3f1f592658c8c1d4e7..0000000000000000000000000000000000000000 --- a/codes/liuguanghui/15875503.java +++ /dev/null @@ -1,35 +0,0 @@ -/** - - * 冒泡排序函数 - - * aa bb cc - - * @param a 待排序的数组 - - * @param n 待排序的数组长度 - - */ - -public static void bubbleSort(int [] a, int n){ - - for(int i = 0; i < n-1 ; i++){ - - for (int j = 0;j < n-1-i;j++){ - - if(a[j] > a[j+1]){ - - int temp = a[j]; - - a[j] = a[j+1]; - - a[j+1] = temp; - - } - - } - - } - - - -} //end diff --git a/codes/liuguangsen0409/15717549.java b/codes/liuguangsen0409/15717549.java deleted file mode 100644 index 0b2f43927cdd5e8f9f9e916fd1e2ab5cbcc69f53..0000000000000000000000000000000000000000 --- a/codes/liuguangsen0409/15717549.java +++ /dev/null @@ -1,17 +0,0 @@ -/** - * 冒泡排序函数 - * 功能：对数组a进行升序排序 - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int[] a, int n) { - for (int i = 0; i < n - 1; i++) { // 外层循环控制排序趟数 - for (int j = 0; j < n - i - 1; j++) { // 内层循环控制每一趟排序多少次 - if (a[j] > a[j + 1]) { // 如果前一个数比后一个数大，则交换它们的位置 - int temp = a[j]; - a[j] = a[j + 1]; - a[j + 1] = temp; - } - } - } -} // end diff --git a/codes/liujiayi/10517239.java b/codes/liujiayi/10517239.java deleted file mode 100644 index a66b179edfb3ce05000cf74958cf3d7d2793828e..0000000000000000000000000000000000000000 --- a/codes/liujiayi/10517239.java +++ /dev/null @@ -1,18 +0,0 @@ -/** - * 冒泡排序函数 - * aa bb cc - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - // 你的代码，使无序数组 a 变得有序 - for(int i = 0; i < n; i++) { - for(int j = 1; j < n - i; j++) { - if(a[j - 1] > a[j]) { - int temp = a[j - 1]; - a[j - 1] = a[j]; - a[j] = temp; - } - } - } -} //end diff --git a/codes/liujin_long/15778303.java b/codes/liujin_long/15778303.java deleted file mode 100644 index 2252b818e6125ed4f8bbd23eca03c12c15ca1757..0000000000000000000000000000000000000000 --- a/codes/liujin_long/15778303.java +++ /dev/null @@ -1,19 +0,0 @@ -/** - * 冒泡排序函数 - * aa bb cc - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - // 你的代码，使无序数组 a 变得有序 - for (int i = 0; i < n - 1; i++) { - for (int j = 0; j < n - i - 1; j++) { - if (a[j] > a[j + 1]) { - // 交换元素 - int temp = a[j]; - a[j] = a[j + 1]; - a[j + 1] = temp; - } - } - } -} //end \ No newline at end of file diff --git a/codes/liulink/15774650.java b/codes/liulink/15774650.java deleted file mode 100644 index bd0ba76337e821ab49d132d93947e1cbe6612c17..0000000000000000000000000000000000000000 --- a/codes/liulink/15774650.java +++ /dev/null @@ -1,18 +0,0 @@ -/** - * 冒泡排序函数 - * 将一个整数数组按照从小到大的顺序进行排序 - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int[] a, int n) { - for (int i = 0; i < n - 1; i++) { - for (int j = 0; j < n - 1 - i; j++) { - // 如果前一个元素比后一个元素大，则交换它们的位置 - if (a[j] > a[j + 1]) { - int temp = a[j]; - a[j] = a[j + 1]; - a[j + 1] = temp; - } - } - } -} //end diff --git a/codes/liuyctt12/15630469.java b/codes/liuyctt12/15630469.java deleted file mode 100644 index 987377810b5beca8eb4bf5eafeee5db45e234a87..0000000000000000000000000000000000000000 --- a/codes/liuyctt12/15630469.java +++ /dev/null @@ -1,20 +0,0 @@ -/** - * 冒泡排序函数 - * aa bb cc - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - // 你的代码，使无序数组 a 变得有序 - for(int i = 0; i < n; i++) { - for(int liuy = 0; liuy < n - i - 1; liuy++) { - if(a[liuy] > a[liuy + 1]) { - int temp = a[liuy]; - a [liuy] = a[liuy + 1]; - a[liuy + 1] = temp; - } - } - } - - -} //end,liuy diff --git a/codes/liuyiyi/15714289.java b/codes/liuyiyi/15714289.java deleted file mode 100644 index 987377810b5beca8eb4bf5eafeee5db45e234a87..0000000000000000000000000000000000000000 --- a/codes/liuyiyi/15714289.java +++ /dev/null @@ -1,20 +0,0 @@ -/** - * 冒泡排序函数 - * aa bb cc - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - // 你的代码，使无序数组 a 变得有序 - for(int i = 0; i < n; i++) { - for(int liuy = 0; liuy < n - i - 1; liuy++) { - if(a[liuy] > a[liuy + 1]) { - int temp = a[liuy]; - a [liuy] = a[liuy + 1]; - a[liuy + 1] = temp; - } - } - } - - -} //end,liuy diff --git a/codes/liuyupeng999/.keep b/codes/liuyupeng999/.keep deleted file mode 100644 index e69de29bb2d1d6434b8b29ae775ad8c2e48c5391..0000000000000000000000000000000000000000 diff --git a/codes/liuyupeng999/15845114.java b/codes/liuyupeng999/15845114.java deleted file mode 100644 index 6e9861fa3ec6d5a2553cdccd1bb1e977430c671b..0000000000000000000000000000000000000000 --- a/codes/liuyupeng999/15845114.java +++ /dev/null @@ -1,19 +0,0 @@ -/** - * 冒泡排序函数 - * aa bb cc - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - // 你的代码，使无序数组 a 变得有序 - for (int i = 0; i < n - 1; i++) { - for (int j = 0; j < n - i - 1; j++) { - if (a[j] > a[j + 1]) { - - int temp = a[j]; - a[j] = a[j + 1]; - a[j + 1] = temp; - } - } - } -} //end \ No newline at end of file diff --git a/codes/liuyuxuan666/.keep b/codes/liuyuxuan666/.keep deleted file mode 100644 index e69de29bb2d1d6434b8b29ae775ad8c2e48c5391..0000000000000000000000000000000000000000 diff --git a/codes/liuyuxuan666/15815202.java b/codes/liuyuxuan666/15815202.java deleted file mode 100644 index 6e9861fa3ec6d5a2553cdccd1bb1e977430c671b..0000000000000000000000000000000000000000 --- a/codes/liuyuxuan666/15815202.java +++ /dev/null @@ -1,19 +0,0 @@ -/** - * 冒泡排序函数 - * aa bb cc - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - // 你的代码，使无序数组 a 变得有序 - for (int i = 0; i < n - 1; i++) { - for (int j = 0; j < n - i - 1; j++) { - if (a[j] > a[j + 1]) { - - int temp = a[j]; - a[j] = a[j + 1]; - a[j + 1] = temp; - } - } - } -} //end \ No newline at end of file diff --git a/codes/liwei2496/11466656.java b/codes/liwei2496/11466656.java deleted file mode 100644 index 272a12fc81d3dd0e857bba9ae001c15818fb7123..0000000000000000000000000000000000000000 --- a/codes/liwei2496/11466656.java +++ /dev/null @@ -1,18 +0,0 @@ - /** - * 冒泡排序函数 - * aa bb cc - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ - public static void bubbleSort(int [] arr, int n){ - // 你的代码，使无序数组 a 变得有序 - for (int i = 0; i < n; i++) { - for (int j = (i + 1); j < n; j++) { - if (arr[i] > arr[j]) { - int temp = arr[i]; - arr[i] = arr[j]; - arr[j] = temp; - } - } - } - } //end \ No newline at end of file diff --git a/codes/lixiang1996/15516370.java b/codes/lixiang1996/15516370.java deleted file mode 100644 index de06d4bd1b80b0f522dcc6e320151ef767941bd8..0000000000000000000000000000000000000000 --- a/codes/lixiang1996/15516370.java +++ /dev/null @@ -1,17 +0,0 @@ -/** - * 冒泡排序函数 - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int[] a, int n) { - for (int i = 0; i < n - 1; i++) { - for (int j = 0; j < n - i - 1; j++) { - if (a[j] > a[j + 1]) { - // 交换 a[j] 和 a[j + 1] - int temp = a[j]; - a[j] = a[j + 1]; - a[j + 1] = temp; - } - } - } -} diff --git a/codes/liyanfen/15875628.java b/codes/liyanfen/15875628.java deleted file mode 100644 index ae82e695cbfd360050241c3f1f592658c8c1d4e7..0000000000000000000000000000000000000000 --- a/codes/liyanfen/15875628.java +++ /dev/null @@ -1,35 +0,0 @@ -/** - - * 冒泡排序函数 - - * aa bb cc - - * @param a 待排序的数组 - - * @param n 待排序的数组长度 - - */ - -public static void bubbleSort(int [] a, int n){ - - for(int i = 0; i < n-1 ; i++){ - - for (int j = 0;j < n-1-i;j++){ - - if(a[j] > a[j+1]){ - - int temp = a[j]; - - a[j] = a[j+1]; - - a[j+1] = temp; - - } - - } - - } - - - -} //end diff --git a/codes/liyanfen1/15607550.java b/codes/liyanfen1/15607550.java deleted file mode 100644 index ae82e695cbfd360050241c3f1f592658c8c1d4e7..0000000000000000000000000000000000000000 --- a/codes/liyanfen1/15607550.java +++ /dev/null @@ -1,35 +0,0 @@ -/** - - * 冒泡排序函数 - - * aa bb cc - - * @param a 待排序的数组 - - * @param n 待排序的数组长度 - - */ - -public static void bubbleSort(int [] a, int n){ - - for(int i = 0; i < n-1 ; i++){ - - for (int j = 0;j < n-1-i;j++){ - - if(a[j] > a[j+1]){ - - int temp = a[j]; - - a[j] = a[j+1]; - - a[j+1] = temp; - - } - - } - - } - - - -} //end diff --git a/codes/liyanyan/15864049.java b/codes/liyanyan/15864049.java deleted file mode 100644 index ae82e695cbfd360050241c3f1f592658c8c1d4e7..0000000000000000000000000000000000000000 --- a/codes/liyanyan/15864049.java +++ /dev/null @@ -1,35 +0,0 @@ -/** - - * 冒泡排序函数 - - * aa bb cc - - * @param a 待排序的数组 - - * @param n 待排序的数组长度 - - */ - -public static void bubbleSort(int [] a, int n){ - - for(int i = 0; i < n-1 ; i++){ - - for (int j = 0;j < n-1-i;j++){ - - if(a[j] > a[j+1]){ - - int temp = a[j]; - - a[j] = a[j+1]; - - a[j+1] = temp; - - } - - } - - } - - - -} //end diff --git a/codes/liyou041/15836638.java b/codes/liyou041/15836638.java deleted file mode 100644 index 46e1fc3655b1a3b16826f66a2542b6fbd37d27f3..0000000000000000000000000000000000000000 --- a/codes/liyou041/15836638.java +++ /dev/null @@ -1,18 +0,0 @@ -/** - * 冒泡排序函数 - * 通过不断地交换相邻的两个元素（如果它们的顺序错误）来对数组进行排序 - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - for (int i = 0; i < n - 1; i++) { - for (int j = 0; j < n - 1 - i; j++) { - if (a[j] > a[j + 1]) { - // 交换 a[j] 和 a[j+1] - int temp = a[j]; - a[j] = a[j + 1]; - a[j + 1] = temp; - } - } - } -} //end diff --git "a/codes/liyou041/\345\244\215\345\210\266\347\232\204" "b/codes/liyou041/\345\244\215\345\210\266\347\232\204" deleted file mode 100644 index 46e1fc3655b1a3b16826f66a2542b6fbd37d27f3..0000000000000000000000000000000000000000 --- "a/codes/liyou041/\345\244\215\345\210\266\347\232\204" +++ /dev/null @@ -1,18 +0,0 @@ -/** - * 冒泡排序函数 - * 通过不断地交换相邻的两个元素（如果它们的顺序错误）来对数组进行排序 - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - for (int i = 0; i < n - 1; i++) { - for (int j = 0; j < n - 1 - i; j++) { - if (a[j] > a[j + 1]) { - // 交换 a[j] 和 a[j+1] - int temp = a[j]; - a[j] = a[j + 1]; - a[j + 1] = temp; - } - } - } -} //end diff --git a/codes/lj18263537279/.keep b/codes/lj18263537279/.keep deleted file mode 100644 index e69de29bb2d1d6434b8b29ae775ad8c2e48c5391..0000000000000000000000000000000000000000 diff --git a/codes/lj18263537279/10972375.java b/codes/lj18263537279/10972375.java deleted file mode 100644 index 9eccfac593dd84bb4c285d230d4de6b8c72a1d65..0000000000000000000000000000000000000000 --- a/codes/lj18263537279/10972375.java +++ /dev/null @@ -1,11 +0,0 @@ -public static void bubbleSort(int [] a, int n) { - for (int i=0 ; ia[j+1]) { - int temp=a[j]; - a[j]=a[j+1]; - a[j+1]=temp; - } - } - } -} diff --git a/codes/ljc13512881480/15775859.java b/codes/ljc13512881480/15775859.java deleted file mode 100644 index fb4ccc5dbb35b66a54843cd0439f6f09c921821f..0000000000000000000000000000000000000000 --- a/codes/ljc13512881480/15775859.java +++ /dev/null @@ -1,21 +0,0 @@ -/** - * 冒泡排序函数 - * 该函数通过冒泡排序算法对待排序的数组进行升序排序 - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - // 外层循环控制排序的轮数 - for (int i = 0; i < n - 1; i++) { - // 内层循环控制每一轮的比较次数 - for (int j = 0; j < n - i - 1; j++) { - // 如果前一个元素大于后一个元素，则交换它们的位置 - if (a[j] > a[j + 1]) { - // 交换 a[j] 和 a[j+1] - int temp = a[j]; - a[j] = a[j + 1]; - a[j + 1] = temp; - } - } - } -} //end diff --git a/codes/ll13174074984/.keep b/codes/ll13174074984/.keep deleted file mode 100644 index e69de29bb2d1d6434b8b29ae775ad8c2e48c5391..0000000000000000000000000000000000000000 diff --git a/codes/ll13174074984/10972293.java b/codes/ll13174074984/10972293.java deleted file mode 100644 index 9eccfac593dd84bb4c285d230d4de6b8c72a1d65..0000000000000000000000000000000000000000 --- a/codes/ll13174074984/10972293.java +++ /dev/null @@ -1,11 +0,0 @@ -public static void bubbleSort(int [] a, int n) { - for (int i=0 ; ia[j+1]) { - int temp=a[j]; - a[j]=a[j+1]; - a[j+1]=temp; - } - } - } -} diff --git a/codes/ll13808780223/15790801.java b/codes/ll13808780223/15790801.java deleted file mode 100644 index 33be1b95e65b4aac0ebce48bfeb09323f568c4f7..0000000000000000000000000000000000000000 --- a/codes/ll13808780223/15790801.java +++ /dev/null @@ -1,19 +0,0 @@ -/** -* 冒泡排序函数 -* aa bb cc -* @param a 待排序的数组 -* @param n 待排序的数组长度 -*/ -public static void bubbleSort(int [] a, int n){ -// 你的代码，使无序数组 a 变得有序 -for (int i = 0; i < n - 1; i++) { -for (int j = 0; j < n - i - 1; j++) { -if (a[j] > a[j + 1]) { -// 交换元素 -int temp = a[j]; -a[j] = a[j + 1]; -a[j + 1] = temp; -} -} -} -} //end diff --git a/codes/lmc666/15632201.java b/codes/lmc666/15632201.java deleted file mode 100644 index 20575dc4ccc75a5bf6af9ea4614fcfa2a84fdeaf..0000000000000000000000000000000000000000 --- a/codes/lmc666/15632201.java +++ /dev/null @@ -1,19 +0,0 @@ -/** - * 冒泡排序函数 - * aa bb cc - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - // 你的代码，使无序数组 a 变得有序 - for (int i = 0; i < n - 1; i++) { - for (int j = 0; j < n - i - 1; j++) { - if (a[j] > a[j + 1]) { - // 交换元素 - int temp = a[j]; - a[j] = a[j + 1]; - a[j + 1] = temp; - } - } - } -} //end diff --git a/codes/lodyn123/15488861.java b/codes/lodyn123/15488861.java deleted file mode 100644 index f55efd315e5f3fd7e4cdbf3d11557610ec6333b5..0000000000000000000000000000000000000000 --- a/codes/lodyn123/15488861.java +++ /dev/null @@ -1,14 +0,0 @@ - public static void bubbleSort(int [] a, int n){ - // 你的代码，使无序数组 a 变得有序 - for(int i = 0;i < n -1;i++) { - for(int j = 0;j < n - i -1;j++) { - if(a[j] > a[j+1]) { - int temp = a[j]; - a[j] = a[j + 1]; - a[j + 1] = temp; - } - } - - } - - } //end diff --git a/codes/logic111/.keep b/codes/logic111/.keep deleted file mode 100644 index e69de29bb2d1d6434b8b29ae775ad8c2e48c5391..0000000000000000000000000000000000000000 diff --git a/codes/logic111/15819546.java b/codes/logic111/15819546.java deleted file mode 100644 index 6426772fb479b07ed3be21ef1867921d1dbb194c..0000000000000000000000000000000000000000 --- a/codes/logic111/15819546.java +++ /dev/null @@ -1,20 +0,0 @@ -/** - * 冒泡排序函数 - * aa bb cc - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - // 你的代码，使无序数组 a 变得有序 - for(int i = 0; i < n; i++) { - for(int j = 0; j < n - i - 1; j++) { - if(a[j] > a[j + 1]) { - int temp = a[j]; - a [j] = a[j + 1]; - a[j + 1] = temp; - } - } - } - - -} //end \ No newline at end of file diff --git a/codes/lolitot/.keep b/codes/lolitot/.keep deleted file mode 100644 index e69de29bb2d1d6434b8b29ae775ad8c2e48c5391..0000000000000000000000000000000000000000 diff --git a/codes/lolitot/10040248.java b/codes/lolitot/10040248.java deleted file mode 100644 index 29d27043d3c8103739e7a1d2a27e77b4cc475876..0000000000000000000000000000000000000000 --- a/codes/lolitot/10040248.java +++ /dev/null @@ -1,23 +0,0 @@ -/** - * 冒泡排序函数 - * aa bb cc - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - // 你的代码，使无序数组 a 变得有序 - for (int i = 0; i < n-1; i++) { - for (int j = 0; j < n-1-i; j++) { - if (a[j] >= a[j+1]) { - int temp = a[j]; - a[j] = a[j+1]; - a[j+1] = temp; - } - } - } - - System.out.print("冒泡排序的结果是： "); - for (int i : a) { - System.out.print(i + " "); - } -} //end \ No newline at end of file diff --git a/codes/long22/11031968.java b/codes/long22/11031968.java deleted file mode 100644 index 4d3191cfa222c1b44ce622a958ebf742e1bf4958..0000000000000000000000000000000000000000 --- a/codes/long22/11031968.java +++ /dev/null @@ -1,21 +0,0 @@ -/** - * 冒泡排序函数 - * aa bb cc - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a,int n){ - int temp =0; - for(int i = 0;ia[j+1]){ - temp = a[j]; - a[j] = a[j+1]; - a[j+1] = temp; - } - } - } - - - -} diff --git a/codes/long93/15676797.java b/codes/long93/15676797.java deleted file mode 100644 index e19af71f108d7db632940367ec2223352b2c268c..0000000000000000000000000000000000000000 --- a/codes/long93/15676797.java +++ /dev/null @@ -1,23 +0,0 @@ -/** - * 冒泡排序函数 - * 通过重复遍历待排序的数组，比较相邻的元素并交换它们（如果它们在错误的顺序）， - * 直到没有更多的交换需要，即该数组已经排序。 - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int[] a, int n) { - for (int i = 0; i < n - 1; i++) { // 外层循环控制排序的趟数 - boolean swapped = false; // 用于标记某一趟是否发生了交换 - for (int j = 0; j < n - i - 1; j++) { // 内层循环控制每一趟排序多少次 - if (a[j] > a[j + 1]) { // 如果前一个元素大于后一个元素，则交换它们 - int temp = a[j]; - a[j] = a[j + 1]; - a[j + 1] = temp; - swapped = true; // 标记发生了交换 - } - } - if (!swapped) { // 如果某一趟没有发生交换，说明数组已经有序，可以提前退出 - break; - } - } -} // end diff --git a/codes/longquefeng/15835894.java b/codes/longquefeng/15835894.java deleted file mode 100644 index ae82e695cbfd360050241c3f1f592658c8c1d4e7..0000000000000000000000000000000000000000 --- a/codes/longquefeng/15835894.java +++ /dev/null @@ -1,35 +0,0 @@ -/** - - * 冒泡排序函数 - - * aa bb cc - - * @param a 待排序的数组 - - * @param n 待排序的数组长度 - - */ - -public static void bubbleSort(int [] a, int n){ - - for(int i = 0; i < n-1 ; i++){ - - for (int j = 0;j < n-1-i;j++){ - - if(a[j] > a[j+1]){ - - int temp = a[j]; - - a[j] = a[j+1]; - - a[j+1] = temp; - - } - - } - - } - - - -} //end diff --git a/codes/longxiqwe1/.keep b/codes/longxiqwe1/.keep deleted file mode 100644 index e69de29bb2d1d6434b8b29ae775ad8c2e48c5391..0000000000000000000000000000000000000000 diff --git a/codes/longxiqwe1/15842971.java b/codes/longxiqwe1/15842971.java deleted file mode 100644 index 6e9861fa3ec6d5a2553cdccd1bb1e977430c671b..0000000000000000000000000000000000000000 --- a/codes/longxiqwe1/15842971.java +++ /dev/null @@ -1,19 +0,0 @@ -/** - * 冒泡排序函数 - * aa bb cc - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - // 你的代码，使无序数组 a 变得有序 - for (int i = 0; i < n - 1; i++) { - for (int j = 0; j < n - i - 1; j++) { - if (a[j] > a[j + 1]) { - - int temp = a[j]; - a[j] = a[j + 1]; - a[j + 1] = temp; - } - } - } -} //end \ No newline at end of file diff --git a/codes/longxixi/18735649.java b/codes/longxixi/18735649.java deleted file mode 100644 index 7a195dcf2f7c3474a436d4c12820d304fa95c405..0000000000000000000000000000000000000000 --- a/codes/longxixi/18735649.java +++ /dev/null @@ -1,30 +0,0 @@ -/** - * 冒泡排序函数 - * aa bb cc - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - // 你的代码，使无序数组 a 变得有序 - - for( int i = 0; i < n-1; i++){ - for( int j = 0; j < n-i-1; j++){ - if(a[j]>a[j+1]){ - int b=a[j]; - a[j]=a[j+1]; - a[j+1]=b; - - } - - - - - } - - - - - } - - -} //end diff --git a/codes/loveer/15720497.java b/codes/loveer/15720497.java deleted file mode 100644 index 987377810b5beca8eb4bf5eafeee5db45e234a87..0000000000000000000000000000000000000000 --- a/codes/loveer/15720497.java +++ /dev/null @@ -1,20 +0,0 @@ -/** - * 冒泡排序函数 - * aa bb cc - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - // 你的代码，使无序数组 a 变得有序 - for(int i = 0; i < n; i++) { - for(int liuy = 0; liuy < n - i - 1; liuy++) { - if(a[liuy] > a[liuy + 1]) { - int temp = a[liuy]; - a [liuy] = a[liuy + 1]; - a[liuy + 1] = temp; - } - } - } - - -} //end,liuy diff --git a/codes/lovemeatsss/.keep b/codes/lovemeatsss/.keep deleted file mode 100644 index e69de29bb2d1d6434b8b29ae775ad8c2e48c5391..0000000000000000000000000000000000000000 diff --git a/codes/lovemeatsss/15841023.java b/codes/lovemeatsss/15841023.java deleted file mode 100644 index 6e9861fa3ec6d5a2553cdccd1bb1e977430c671b..0000000000000000000000000000000000000000 --- a/codes/lovemeatsss/15841023.java +++ /dev/null @@ -1,19 +0,0 @@ -/** - * 冒泡排序函数 - * aa bb cc - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - // 你的代码，使无序数组 a 变得有序 - for (int i = 0; i < n - 1; i++) { - for (int j = 0; j < n - i - 1; j++) { - if (a[j] > a[j + 1]) { - - int temp = a[j]; - a[j] = a[j + 1]; - a[j + 1] = temp; - } - } - } -} //end \ No newline at end of file diff --git a/codes/loveta1/15852677.java b/codes/loveta1/15852677.java deleted file mode 100644 index db00df4317c2971d839dccd193fa0332f983ff23..0000000000000000000000000000000000000000 --- a/codes/loveta1/15852677.java +++ /dev/null @@ -1,22 +0,0 @@ -/** - * 冒泡排序函数 - * 对数组进行冒泡排序，使得数组中的元素按从小到大的顺序排列 - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int[] a, int n) { - // 外层循环控制排序趟数 - for (int i = 0; i < n - 1; i++) { - // 内层循环负责进行每趟排序，通过相邻元素的比较和交换来移动较大元素到数组的末尾 - for (int j = 0; j < n - i - 1; j++) { - // 如果前一个元素大于后一个元素，则交换它们的位置 - if (a[j] > a[j + 1]) { - // 交换元素 - int temp = a[j]; - a[j] = a[j + 1]; - a[j + 1] = temp; - } - } - } - // 经过 n-1 趟排序后，数组已经变为有序 -} // end diff --git a/codes/lovewang/11307245.java b/codes/lovewang/11307245.java deleted file mode 100644 index 9e7534d4b41cf071c848fa4d5c08c6519526b6e3..0000000000000000000000000000000000000000 --- a/codes/lovewang/11307245.java +++ /dev/null @@ -1,18 +0,0 @@ -/** - * 冒泡 排序 函数 - * aa bb cc - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - // 你的代码，使无序数组 a 变得有序 - for (int i = 0; i < n; i++) { - for (int j = 0; j < i; j++) { - if (a[i] < a[j]) { - int t = a[i]; - a[i] = a[j]; - a[j] = t; - } - } - } -}//end \ No newline at end of file diff --git a/codes/lovingcode3/.keep b/codes/lovingcode3/.keep deleted file mode 100644 index e69de29bb2d1d6434b8b29ae775ad8c2e48c5391..0000000000000000000000000000000000000000 diff --git a/codes/lovingcode3/15844469.java b/codes/lovingcode3/15844469.java deleted file mode 100644 index 6e9861fa3ec6d5a2553cdccd1bb1e977430c671b..0000000000000000000000000000000000000000 --- a/codes/lovingcode3/15844469.java +++ /dev/null @@ -1,19 +0,0 @@ -/** - * 冒泡排序函数 - * aa bb cc - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - // 你的代码，使无序数组 a 变得有序 - for (int i = 0; i < n - 1; i++) { - for (int j = 0; j < n - i - 1; j++) { - if (a[j] > a[j + 1]) { - - int temp = a[j]; - a[j] = a[j + 1]; - a[j + 1] = temp; - } - } - } -} //end \ No newline at end of file diff --git a/codes/lovscene/11290992.java b/codes/lovscene/11290992.java deleted file mode 100644 index cacd12f1e4e4360dd1ffa22f3741e376110bcde4..0000000000000000000000000000000000000000 --- a/codes/lovscene/11290992.java +++ /dev/null @@ -1,18 +0,0 @@ -/** - * 冒泡排序函数 - * aa bb cc - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - // 你的代码，使无序数组 a 变得有序 - for(int i=0;ia[j+1]){ - a[j] = a[j]+a[j+1]; - a[j+1] = a[j]-a[j+1]; - a[j] = a[j]-a[j+1]; - } - } - } -} //end \ No newline at end of file diff --git a/codes/lsl990410/15777331.java b/codes/lsl990410/15777331.java deleted file mode 100644 index 4be0c0163b46720340957c8a2366e1a801240bd2..0000000000000000000000000000000000000000 --- a/codes/lsl990410/15777331.java +++ /dev/null @@ -1,18 +0,0 @@ -/** - * 冒泡排序函数 - * 通过相邻元素两两比较，如果顺序错误则交换，直到没有需要交换的元素为止 - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - for (int i = 0; i < n - 1; i++) { - for (int j = 0; j < n - i - 1; j++) { - if (a[j] > a[j + 1]) { - // 交换位置 - int temp = a[j]; - a[j] = a[j + 1]; - a[j + 1] = temp; - } - } - } -} //end diff --git a/codes/lsmir2/13427738.java b/codes/lsmir2/13427738.java deleted file mode 100644 index 9038393a2b67fc9b2569a8986b2b9b4b08804347..0000000000000000000000000000000000000000 --- a/codes/lsmir2/13427738.java +++ /dev/null @@ -1,41 +0,0 @@ -/** - * 冒泡排序函数 - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int[] a, int n) { - if (n <= 1) { - return; - } - - /* 最后一次交换的位置 */ - int lastExchangeIndex = 0; - /* 无序数列的边界，每次只需要比较到这里即可退出循环 */ - int sortedBorder = n - 1; - - for (int i = 0; i < n; i++) { - /* 提前退出冒泡循环的标志位 */ - boolean swapped = false; - - for (int j = 0; j < sortedBorder; j++) { - if (a[j] > a[j + 1]) { - /* 交换元素 */ - int tmp = a[j]; - a[j] = a[j + 1]; - a[j + 1] = tmp; - - /* 更新最后一次交换的位置 */ - lastExchangeIndex = j; - swapped = true; - } - } - - /* 更新无序数列的边界 */ - sortedBorder = lastExchangeIndex; - - /* 如果一次循环中没有发生元素交换，说明已经排序完成，提前退出 */ - if (!swapped) { - break; - } - } -} diff --git a/codes/lsnjxkw634/15836665.java b/codes/lsnjxkw634/15836665.java deleted file mode 100644 index d0e7038df81a1dcd40ba57e5267839caad594f03..0000000000000000000000000000000000000000 --- a/codes/lsnjxkw634/15836665.java +++ /dev/null @@ -1,19 +0,0 @@ -/** - * 冒泡排序函数 - * 冒泡排序是一种简单的排序算法，它重复地遍历要排序的数列，一次比较两个元素，如果他们的顺序错误就把他们交换过来。 - * 遍历数列的工作是重复地进行直到没有再需要交换，也就是说该数列已经排序完成。 - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - for (int i = 0; i < n - 1; i++) { // 外层循环控制比较的次数 - for (int j = 0; j < n - 1 - i; j++) { // 内层循环控制每一轮比较的次数 - // 如果前一个元素比后一个元素大，则交换它们的位置 - if (a[j] > a[j + 1]) { - int temp = a[j]; - a[j] = a[j + 1]; - a[j + 1] = temp; - } - } - } -} //end diff --git a/codes/lsnjxkw635/15847008.java b/codes/lsnjxkw635/15847008.java deleted file mode 100644 index 809e6c454de4e33d540c35a26f34e2679a08693a..0000000000000000000000000000000000000000 --- a/codes/lsnjxkw635/15847008.java +++ /dev/null @@ -1,18 +0,0 @@ -/** - * 冒泡排序函数 - * 通过相邻元素两两比较和交换，使得每一轮循环后最大（或最小）的元素“冒泡”到数组的末尾。 - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int[] a, int n) { - for (int i = 0; i < n - 1; i++) { // 外层循环控制比较轮数 - for (int j = 0; j < n - 1 - i; j++) { // 内层循环控制每轮比较的次数 - if (a[j] > a[j + 1]) { // 如果当前元素大于下一个元素，则交换它们的位置 - // 交换 a[j] 和 a[j + 1] - int temp = a[j]; - a[j] = a[j + 1]; - a[j + 1] = temp; - } - } - } -} //end diff --git a/codes/ltq0319/15757963.java b/codes/ltq0319/15757963.java deleted file mode 100644 index 7ce620c3e5da73497f3bd1c48010bf1366a3fe53..0000000000000000000000000000000000000000 --- a/codes/ltq0319/15757963.java +++ /dev/null @@ -1,28 +0,0 @@ -/** - * 冒泡排序函数 - * 将无序数组通过冒泡排序算法变为有序数组 - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - for (int i = 0; i < n - 1; i++) { - // 设置一个标志位，用于优化算法，减少不必要的比较 - boolean swapped = false; - for (int j = 0; j < n - i - 1; j++) { - // 如果前一个元素比后一个元素大，则交换它们的位置 - if (a[j] > a[j + 1]) { - int temp = a[j]; - a[j] = a[j + 1]; - a[j + 1] = temp; - // 如果有元素交换，则标志位设为true - swapped = true; - } - } - // 如果没有元素交换，说明数组已经有序，可以提前结束排序 - if (!swapped) { - break; - } - } -} //end - - diff --git a/codes/luo111/15754678.java b/codes/luo111/15754678.java deleted file mode 100644 index c2afaa2414da1853e4500b02c6de9068b64aeafe..0000000000000000000000000000000000000000 --- a/codes/luo111/15754678.java +++ /dev/null @@ -1,18 +0,0 @@ -/** - * 冒泡排序函数 - * aa bb cc - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - for(int i = 0; i < n-1 ; i++){ - for (int j = 0;j < n-1-i;j++){ - if(a[j] > a[j+1]){ - int temp = a[j]; - a[j] = a[j+1]; - a[j+1] = temp; - } - } - } - -} //end diff --git a/codes/luogege/15634607.java b/codes/luogege/15634607.java deleted file mode 100644 index d8a8b6b86bb96853f7c34e5655e91c18cbd91eb6..0000000000000000000000000000000000000000 --- a/codes/luogege/15634607.java +++ /dev/null @@ -1,20 +0,0 @@ -/** - * 冒泡排序函数 - * aa bb cc - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - // 你的代码，使无序数组 a 变得有序 - for(int i = 0; i < n; i++) { - for(int luoluo = 0; luoluo < n - i - 1; luoluo++) { - if(a[luoluo] > a[luoluo + 1]) { - int temp = a[luoluo]; - a [luoluo] = a[luoluo + 1]; - a[luoluo + 1] = temp; - } - } - } - - -} //end,luoluo \ No newline at end of file diff --git a/codes/luoluo123/15634481.java b/codes/luoluo123/15634481.java deleted file mode 100644 index 6d56cc245b65789ffc55510e1407e393e8fa8a7a..0000000000000000000000000000000000000000 --- a/codes/luoluo123/15634481.java +++ /dev/null @@ -1,20 +0,0 @@ -/** - * 冒泡排序函数 - * aa bb cc - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - // 你的代码，使无序数组 a 变得有序 - for(int i = 0; i < n; i++) { - for(int luoluo = 0; luoluo < n - i - 1; luoluo++) { - if(a[luoluo] > a[luoluo + 1]) { - int temp = a[luoluo]; - a [luoluo] = a[luoluo + 1]; - a[luoluo + 1] = temp; - } - } - } - - -} //end,luoluo diff --git a/codes/luowei/15609646.java b/codes/luowei/15609646.java deleted file mode 100644 index 43375d79244ec8f0010facb911b0ecb805e05a72..0000000000000000000000000000000000000000 --- a/codes/luowei/15609646.java +++ /dev/null @@ -1,19 +0,0 @@ - /** - * 冒泡排序函数 - * aa bb cc - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ - public static void bubbleSort(int [] a, int n){ - // 你的代码，使无序数组 a 变得有序 - for (int i = 0; i < n; i++) { - for (int j = 0; j < n - i - 1; j++) { - if (a[j] > a[j + 1]) { - int temp = a[j]; - a[j] = a[j + 1]; - a[j + 1] = temp; - } - } - } - - } //end diff --git a/codes/luox12/15700214.java b/codes/luox12/15700214.java deleted file mode 100644 index 987377810b5beca8eb4bf5eafeee5db45e234a87..0000000000000000000000000000000000000000 --- a/codes/luox12/15700214.java +++ /dev/null @@ -1,20 +0,0 @@ -/** - * 冒泡排序函数 - * aa bb cc - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - // 你的代码，使无序数组 a 变得有序 - for(int i = 0; i < n; i++) { - for(int liuy = 0; liuy < n - i - 1; liuy++) { - if(a[liuy] > a[liuy + 1]) { - int temp = a[liuy]; - a [liuy] = a[liuy + 1]; - a[liuy + 1] = temp; - } - } - } - - -} //end,liuy diff --git a/codes/luv3704/15810371.java b/codes/luv3704/15810371.java deleted file mode 100644 index 166dea5db31166b381f11f50cf27b5f36311847d..0000000000000000000000000000000000000000 --- a/codes/luv3704/15810371.java +++ /dev/null @@ -1,19 +0,0 @@ -/** - * 冒泡排序函数 - * 该函数通过冒泡排序算法对数组进行排序 - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int[] a, int n) { - for (int i = 0; i < n - 1; i++) { // 外层循环控制比较轮数 - for (int j = 0; j < n - 1 - i; j++) { // 内层循环控制每轮的比较次数 - // 如果前一个元素大于后一个元素，则交换它们的位置 - if (a[j] > a[j + 1]) { - // 交换元素 - int temp = a[j]; - a[j] = a[j + 1]; - a[j + 1] = temp; - } - } - } -} //end diff --git a/codes/luzhanheng2023/12213445.java b/codes/luzhanheng2023/12213445.java deleted file mode 100644 index 4ad17961517430007d1a719aed3e103b4c9133ce..0000000000000000000000000000000000000000 --- a/codes/luzhanheng2023/12213445.java +++ /dev/null @@ -1,18 +0,0 @@ -/** - * 冒泡排序函数 - * aa bb cc - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - // 你的代码，使无序数组 a 变得有序 - for (int i = 0; i < a.length; i++) { - for (int j = i+1; j < a.length; j++) { - if (a[i] > a[j]) { - int t = a[i]; - a[i] = a[j]; - a[j] = t; - } - } - } - } \ No newline at end of file diff --git a/codes/lvbin2/.keep b/codes/lvbin2/.keep deleted file mode 100644 index e69de29bb2d1d6434b8b29ae775ad8c2e48c5391..0000000000000000000000000000000000000000 diff --git a/codes/lvbin2/15758178.java b/codes/lvbin2/15758178.java deleted file mode 100644 index 6426772fb479b07ed3be21ef1867921d1dbb194c..0000000000000000000000000000000000000000 --- a/codes/lvbin2/15758178.java +++ /dev/null @@ -1,20 +0,0 @@ -/** - * 冒泡排序函数 - * aa bb cc - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - // 你的代码，使无序数组 a 变得有序 - for(int i = 0; i < n; i++) { - for(int j = 0; j < n - i - 1; j++) { - if(a[j] > a[j + 1]) { - int temp = a[j]; - a [j] = a[j + 1]; - a[j + 1] = temp; - } - } - } - - -} //end \ No newline at end of file diff --git a/codes/lvlv123/15693242.java b/codes/lvlv123/15693242.java deleted file mode 100644 index 515548eef4bc997e70c18f45d615c42e68ad4647..0000000000000000000000000000000000000000 --- a/codes/lvlv123/15693242.java +++ /dev/null @@ -1,19 +0,0 @@ -/** - * 冒泡排序函数 - * 通过多次遍历数组，每次比较相邻的元素，如果它们的顺序错误就把它们交换过来。 - * 遍历数组的工作是重复地进行直到没有再需要交换，也就是说该数组已经排序完成。 - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int[] a, int n) { - for (int i = 0; i < n - 1; i++) { // 外层循环控制遍历次数 - for (int j = 0; j < n - 1 - i; j++) { // 内层循环负责具体的元素比较和交换 - if (a[j] > a[j + 1]) { // 如果前一个元素大于后一个元素，则交换它们 - // 使用临时变量进行交换 - int temp = a[j]; - a[j] = a[j + 1]; - a[j + 1] = temp; - } - } - } -} // end diff --git a/codes/lvrui233/15855727.java b/codes/lvrui233/15855727.java deleted file mode 100644 index ae82e695cbfd360050241c3f1f592658c8c1d4e7..0000000000000000000000000000000000000000 --- a/codes/lvrui233/15855727.java +++ /dev/null @@ -1,35 +0,0 @@ -/** - - * 冒泡排序函数 - - * aa bb cc - - * @param a 待排序的数组 - - * @param n 待排序的数组长度 - - */ - -public static void bubbleSort(int [] a, int n){ - - for(int i = 0; i < n-1 ; i++){ - - for (int j = 0;j < n-1-i;j++){ - - if(a[j] > a[j+1]){ - - int temp = a[j]; - - a[j] = a[j+1]; - - a[j+1] = temp; - - } - - } - - } - - - -} //end diff --git a/codes/lvxl111/15528312.java b/codes/lvxl111/15528312.java deleted file mode 100644 index c2afaa2414da1853e4500b02c6de9068b64aeafe..0000000000000000000000000000000000000000 --- a/codes/lvxl111/15528312.java +++ /dev/null @@ -1,18 +0,0 @@ -/** - * 冒泡排序函数 - * aa bb cc - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - for(int i = 0; i < n-1 ; i++){ - for (int j = 0;j < n-1-i;j++){ - if(a[j] > a[j+1]){ - int temp = a[j]; - a[j] = a[j+1]; - a[j+1] = temp; - } - } - } - -} //end diff --git a/codes/lx1122334/12138905.java b/codes/lx1122334/12138905.java deleted file mode 100644 index 8501963bbb87f4b03299f60e8aba7a3af3251f61..0000000000000000000000000000000000000000 --- a/codes/lx1122334/12138905.java +++ /dev/null @@ -1,18 +0,0 @@ -/** - * 冒泡排序函数 - * aa bb cc - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int[] a, int n) { - for (int i = 0; i < n - 1; i++) { - for (int j = 0; j < n - i - 1; j++) { - if (a[j] > a[j + 1]) { - int temp = a[j]; - a[j] = a[j + 1]; - a[j + 1] = temp; - } - } - } -} //end - diff --git a/codes/lx13579/15807637.java b/codes/lx13579/15807637.java deleted file mode 100644 index 24f513b3219ac31ac3dcffe774647aa7bfdac254..0000000000000000000000000000000000000000 --- a/codes/lx13579/15807637.java +++ /dev/null @@ -1,11 +0,0 @@ -public static void bubbleSort(int [] a, int n){ - for (int i = 0; i < n - 1; i++) { - for (int j = 0; j < n - 1 - i; j++) { - if (a[j] > a[j + 1]) { - int temp = a[j]; - a[j] = a[j + 1]; - a[j + 1] = temp; - } - } - } -} diff --git a/codes/lxnb666/14201242.java b/codes/lxnb666/14201242.java deleted file mode 100644 index 10dbc6525b8c4427dda5055b3f3c224c68398d2c..0000000000000000000000000000000000000000 --- a/codes/lxnb666/14201242.java +++ /dev/null @@ -1,19 +0,0 @@ -/** - * 冒泡排序函数 - * aa bb cc - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - // 你的代码，使无序数组 a 变得有序 - for(int i = 0 ; i < n - 1 ; i++){ - for(int j = 0 ; j < n - 1 - i ; j++){ - if(a[j] > a[j + 1]){ - int tmp = a[j]; - a[j] = a[j + 1]; - a[j + 1] = tmp; - } - } - } - -} //end diff --git a/codes/lxsq1905951174/15775065.java b/codes/lxsq1905951174/15775065.java deleted file mode 100644 index 9ff97f57535893c5b7ae72a4805263f5ed5eabc3..0000000000000000000000000000000000000000 --- a/codes/lxsq1905951174/15775065.java +++ /dev/null @@ -1,20 +0,0 @@ -/** - * 冒泡排序函数 - * 将数组a中的元素按照从小到大的顺序排序 - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - // 外层循环控制排序的趟数 - for (int i = 0; i < n - 1; i++) { - // 内层循环控制每趟排序的次数 - for (int j = 0; j < n - 1 - i; j++) { - // 如果当前元素大于下一个元素，则交换它们的位置 - if (a[j] > a[j + 1]) { - int temp = a[j]; - a[j] = a[j + 1]; - a[j + 1] = temp; - } - } - } -} //end diff --git a/codes/ly614155/15775591.java b/codes/ly614155/15775591.java deleted file mode 100644 index 4b863ff87ee53efbd8c911a9c79ca4f42536cc5b..0000000000000000000000000000000000000000 --- a/codes/ly614155/15775591.java +++ /dev/null @@ -1,26 +0,0 @@ -/** - * 冒泡排序函数 - * 使用冒泡排序算法对数组进行升序排序 - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int[] a, int n) { - for (int i = 0; i < n - 1; i++) { - // 标志位，用于检测是否发生过交换，如果没有交换，说明数组已经有序 - boolean swapped = false; - for (int j = 0; j < n - i - 1; j++) { - // 如果前一个元素大于后一个元素，则交换它们的位置 - if (a[j] > a[j + 1]) { - int temp = a[j]; - a[j] = a[j + 1]; - a[j + 1] = temp; - // 发生了交换，标志位设为true - swapped = true; - } - } - // 如果在内层循环中没有发生过交换，说明数组已经有序，提前结束排序 - if (!swapped) { - break; - } - } -} //end diff --git a/codes/lynlon/12376594.java b/codes/lynlon/12376594.java deleted file mode 100644 index 4631f6cf74c4c376ce4f2c20f917e9f801f87be7..0000000000000000000000000000000000000000 --- a/codes/lynlon/12376594.java +++ /dev/null @@ -1,19 +0,0 @@ -/** - * 冒泡排序函数 - * aa bb cc - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - // 你的代码，使无序数组 a 变得有序 - int temp; - for(int i=0;ia[j+1]){ - temp=a[j]; - a[j]=a[j+1]; - a[j+1]=temp; - } - } - } -} //end diff --git a/codes/lyx123123/15775949.java b/codes/lyx123123/15775949.java deleted file mode 100644 index fef69f9a4689d60117db6fe3544f8d4c74a1420c..0000000000000000000000000000000000000000 --- a/codes/lyx123123/15775949.java +++ /dev/null @@ -1,22 +0,0 @@ -/** - * 冒泡排序函数 - * aa bb cc - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - - for(int i=0;ia[j+1]) - { - int temp=a[j]; - a[j]=a[j+1]; - a[j+1]=temp; - } - } - } - -} diff --git a/codes/lyxgitee1/.keep b/codes/lyxgitee1/.keep deleted file mode 100644 index e69de29bb2d1d6434b8b29ae775ad8c2e48c5391..0000000000000000000000000000000000000000 diff --git a/codes/lyxgitee1/15815289.java b/codes/lyxgitee1/15815289.java deleted file mode 100644 index 6e9861fa3ec6d5a2553cdccd1bb1e977430c671b..0000000000000000000000000000000000000000 --- a/codes/lyxgitee1/15815289.java +++ /dev/null @@ -1,19 +0,0 @@ -/** - * 冒泡排序函数 - * aa bb cc - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - // 你的代码，使无序数组 a 变得有序 - for (int i = 0; i < n - 1; i++) { - for (int j = 0; j < n - i - 1; j++) { - if (a[j] > a[j + 1]) { - - int temp = a[j]; - a[j] = a[j + 1]; - a[j + 1] = temp; - } - } - } -} //end \ No newline at end of file diff --git a/codes/lzf1123/15542355.java b/codes/lzf1123/15542355.java deleted file mode 100644 index ae82e695cbfd360050241c3f1f592658c8c1d4e7..0000000000000000000000000000000000000000 --- a/codes/lzf1123/15542355.java +++ /dev/null @@ -1,35 +0,0 @@ -/** - - * 冒泡排序函数 - - * aa bb cc - - * @param a 待排序的数组 - - * @param n 待排序的数组长度 - - */ - -public static void bubbleSort(int [] a, int n){ - - for(int i = 0; i < n-1 ; i++){ - - for (int j = 0;j < n-1-i;j++){ - - if(a[j] > a[j+1]){ - - int temp = a[j]; - - a[j] = a[j+1]; - - a[j+1] = temp; - - } - - } - - } - - - -} //end diff --git a/codes/lzr565520/15742467.java b/codes/lzr565520/15742467.java deleted file mode 100644 index 2252b818e6125ed4f8bbd23eca03c12c15ca1757..0000000000000000000000000000000000000000 --- a/codes/lzr565520/15742467.java +++ /dev/null @@ -1,19 +0,0 @@ -/** - * 冒泡排序函数 - * aa bb cc - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - // 你的代码，使无序数组 a 变得有序 - for (int i = 0; i < n - 1; i++) { - for (int j = 0; j < n - i - 1; j++) { - if (a[j] > a[j + 1]) { - // 交换元素 - int temp = a[j]; - a[j] = a[j + 1]; - a[j + 1] = temp; - } - } - } -} //end \ No newline at end of file diff --git a/codes/m88888686/11201957.java b/codes/m88888686/11201957.java deleted file mode 100644 index 4d7083fe05ce3e6d3fadd59d6d55e2cbc50d546d..0000000000000000000000000000000000000000 --- a/codes/m88888686/11201957.java +++ /dev/null @@ -1,22 +0,0 @@ -/** - * 冒泡排序函数 - * aa bb cc - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - // 你的代码，使无序数组 a 变得有序 - int i, j; - - for(i=0; ia[j]){ - int temp; - temp = a[j-1]; - a[j-1] = a[j]; - a[j] = temp; - } - } - } - -} //end \ No newline at end of file diff --git a/codes/ma17533610893/15816305.java b/codes/ma17533610893/15816305.java deleted file mode 100644 index 8a9fb77715574062dc84306babe1fe613d81637f..0000000000000000000000000000000000000000 --- a/codes/ma17533610893/15816305.java +++ /dev/null @@ -1,18 +0,0 @@ -/** - * 冒泡排序函数 - * 使用冒泡排序算法对数组进行升序排序 - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - for (int i = 0; i < n - 1; i++) { - for (int j = 0; j < n - i - 1; j++) { - // 如果前一个元素大于后一个元素，则交换它们的位置 - if (a[j] > a[j + 1]) { - int temp = a[j]; - a[j] = a[j + 1]; - a[j + 1] = temp; - } - } - } -} //end diff --git a/codes/ma_yin/15529443.java b/codes/ma_yin/15529443.java deleted file mode 100644 index 61c422b629e86de0017a8c4de128f6973bd290c9..0000000000000000000000000000000000000000 --- a/codes/ma_yin/15529443.java +++ /dev/null @@ -1,19 +0,0 @@ -/** - * 冒泡排序函数 - * aa bb cc - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - // 你的代码，使无序数组 a 变得有序 - for (int i = 0; i < n - 1; i++) { - for (int j = 0; j < n - i - 1; j++) { - if (a[j] > a[j + 1]) { - // 交换元素 - int temp = a[j]; - a[j] = a[j + 1]; - a[j + 1] = temp; - } - } - } -} //end \ No newline at end of file diff --git a/codes/mabofu/10606075.java b/codes/mabofu/10606075.java deleted file mode 100644 index 2fd061282a80d9eeaf57831e9e371f129c3915f4..0000000000000000000000000000000000000000 --- a/codes/mabofu/10606075.java +++ /dev/null @@ -1,25 +0,0 @@ -/** - * 冒泡排序函数 - * aa bb cc - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - // 你的代码，使无序数组 a 变得有序 - for (int i = 1; i < a.length; i++) { - boolean flag = true; - for (int j = 0; j < a.length - 1; j++) { - if (a[j] > a[j + 1]) { - int tmp = a[j]; - a[j] = a[j + 1]; - a[j + 1] = tmp; - flag = false; - } - } - if (flag) { - break; - } - } - -} //end - diff --git a/codes/macw_379/15655907.java b/codes/macw_379/15655907.java deleted file mode 100644 index 09d26b4c17225cab897586309217bbdab55ab152..0000000000000000000000000000000000000000 --- a/codes/macw_379/15655907.java +++ /dev/null @@ -1,18 +0,0 @@ -/** - * 冒泡排序函数 - * 依次比较相邻的元素，如果它们的顺序错误就把它们交换过来 - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - for (int i = 0; i < n - 1; i++) { // 外层循环，控制排序趟数 - for (int j = 0; j < n - 1 - i; j++) { // 内层循环，控制每一趟排序多少次 - // 如果前一个元素大于后一个元素，则交换位置 - if (a[j] > a[j + 1]) { - int temp = a[j]; // 使用临时变量进行交换 - a[j] = a[j + 1]; - a[j + 1] = temp; - } - } - } -} //end diff --git a/codes/mafuqiang/10166179.java b/codes/mafuqiang/10166179.java deleted file mode 100644 index 4b18be751186d0fdb6fb1f93c30403590a8ea1be..0000000000000000000000000000000000000000 --- a/codes/mafuqiang/10166179.java +++ /dev/null @@ -1,21 +0,0 @@ -/** - * 冒泡排序函数 - * aa bb cc - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - // 你的代码，使无序数组 a 变得有序 - - int temp; - for(int i=0;ia[j+1]){ - temp=a[j]; - a[j]=a[j+1]; - a[j+1]=temp; - } - } - } - -} //end diff --git a/codes/mahaoliang/15538747.java b/codes/mahaoliang/15538747.java deleted file mode 100644 index e125768f7a0efc8ad7be883af8dc49704ed77a31..0000000000000000000000000000000000000000 --- a/codes/mahaoliang/15538747.java +++ /dev/null @@ -1,17 +0,0 @@ -/** - * 冒泡排序函数 - * - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int[] a, int n) { - for (int i = 0; i < n - 1; i++) { - for (int j = 0; j < n - 1 - i; j++) { - if (a[j] > a[j + 1]) { - int temp = a[j]; - a[j] = a[j + 1]; - a[j + 1] = temp; - } - } - } -} //end \ No newline at end of file diff --git a/codes/mahaoliang/15540967.java b/codes/mahaoliang/15540967.java deleted file mode 100644 index 4d6e2d6a741fcb972e0013229d90dd1bfeb282bd..0000000000000000000000000000000000000000 --- a/codes/mahaoliang/15540967.java +++ /dev/null @@ -1,17 +0,0 @@ -/** - * 冒泡排序函数 - * - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int[] a, int n) { - for (int i = 0; i < n - 1; i++) { - for (int j = 0; j < n - 1 - i; j++) { - if (a[j] > a[j + 1]) { - int temp = a[j]; - a[j] = a[j + 1]; - a[j + 1] = temp; - } - } - } -} //end diff --git a/codes/maisaki/15487137.java b/codes/maisaki/15487137.java deleted file mode 100644 index 6a3fea3736126b68d3f99379af3c5a4cf2e5360a..0000000000000000000000000000000000000000 --- a/codes/maisaki/15487137.java +++ /dev/null @@ -1,20 +0,0 @@ -/** - * 冒泡排序函数 - * aa bb cc - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - // 你的代码，使无序数组 a 变得有序 - int i, j; - for (i = 0; i < n-1; i++) { - for (j = 0; j < n-1-i; j++) { - if (a[j] > a[j+1]) { - int t = a[j]; - a[j] = a[j+1]; - a[j+1] = t; - } - } - } - -} //end diff --git a/codes/maiswemlilo1/11241067.java b/codes/maiswemlilo1/11241067.java deleted file mode 100644 index 272a12fc81d3dd0e857bba9ae001c15818fb7123..0000000000000000000000000000000000000000 --- a/codes/maiswemlilo1/11241067.java +++ /dev/null @@ -1,18 +0,0 @@ - /** - * 冒泡排序函数 - * aa bb cc - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ - public static void bubbleSort(int [] arr, int n){ - // 你的代码，使无序数组 a 变得有序 - for (int i = 0; i < n; i++) { - for (int j = (i + 1); j < n; j++) { - if (arr[i] > arr[j]) { - int temp = arr[i]; - arr[i] = arr[j]; - arr[j] = temp; - } - } - } - } //end \ No newline at end of file diff --git a/codes/manbaoutsi/.keep b/codes/manbaoutsi/.keep deleted file mode 100644 index e69de29bb2d1d6434b8b29ae775ad8c2e48c5391..0000000000000000000000000000000000000000 diff --git a/codes/manbaoutsi/15845869.java b/codes/manbaoutsi/15845869.java deleted file mode 100644 index 6e9861fa3ec6d5a2553cdccd1bb1e977430c671b..0000000000000000000000000000000000000000 --- a/codes/manbaoutsi/15845869.java +++ /dev/null @@ -1,19 +0,0 @@ -/** - * 冒泡排序函数 - * aa bb cc - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - // 你的代码，使无序数组 a 变得有序 - for (int i = 0; i < n - 1; i++) { - for (int j = 0; j < n - i - 1; j++) { - if (a[j] > a[j + 1]) { - - int temp = a[j]; - a[j] = a[j + 1]; - a[j + 1] = temp; - } - } - } -} //end \ No newline at end of file diff --git a/codes/manyuemei/15869904.java b/codes/manyuemei/15869904.java deleted file mode 100644 index 24f513b3219ac31ac3dcffe774647aa7bfdac254..0000000000000000000000000000000000000000 --- a/codes/manyuemei/15869904.java +++ /dev/null @@ -1,11 +0,0 @@ -public static void bubbleSort(int [] a, int n){ - for (int i = 0; i < n - 1; i++) { - for (int j = 0; j < n - 1 - i; j++) { - if (a[j] > a[j + 1]) { - int temp = a[j]; - a[j] = a[j + 1]; - a[j + 1] = temp; - } - } - } -} diff --git a/codes/maqingshan123/15622329.java b/codes/maqingshan123/15622329.java deleted file mode 100644 index 51a5e05b9f16f21ec609dc7eb8402d040e6734d0..0000000000000000000000000000000000000000 --- a/codes/maqingshan123/15622329.java +++ /dev/null @@ -1,18 +0,0 @@ -/** - * 冒泡排序函数 - * 将数组a从小到大进行排序 - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - for (int i = 0; i < n - 1; i++) { // 外层循环控制需要排序的趟数 - for (int j = 0; j < n - i - 1; j++) { // 内层循环控制每一趟排序多少次 - if (a[j] > a[j + 1]) { // 如果前面的数比后面的数大，则交换它们的位置 - int temp = a[j]; - a[j] = a[j + 1]; - a[j + 1] = temp; - } - } - } -} //end - diff --git a/codes/matrixHall/.keep b/codes/matrixHall/.keep deleted file mode 100644 index e69de29bb2d1d6434b8b29ae775ad8c2e48c5391..0000000000000000000000000000000000000000 diff --git a/codes/matrixHall/15815802.java b/codes/matrixHall/15815802.java deleted file mode 100644 index 6e9861fa3ec6d5a2553cdccd1bb1e977430c671b..0000000000000000000000000000000000000000 --- a/codes/matrixHall/15815802.java +++ /dev/null @@ -1,19 +0,0 @@ -/** - * 冒泡排序函数 - * aa bb cc - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - // 你的代码，使无序数组 a 变得有序 - for (int i = 0; i < n - 1; i++) { - for (int j = 0; j < n - i - 1; j++) { - if (a[j] > a[j + 1]) { - - int temp = a[j]; - a[j] = a[j + 1]; - a[j + 1] = temp; - } - } - } -} //end \ No newline at end of file diff --git a/codes/matrixsquad/.keep b/codes/matrixsquad/.keep deleted file mode 100644 index e69de29bb2d1d6434b8b29ae775ad8c2e48c5391..0000000000000000000000000000000000000000 diff --git a/codes/matrixsquad/15774031.java b/codes/matrixsquad/15774031.java deleted file mode 100644 index 6426772fb479b07ed3be21ef1867921d1dbb194c..0000000000000000000000000000000000000000 --- a/codes/matrixsquad/15774031.java +++ /dev/null @@ -1,20 +0,0 @@ -/** - * 冒泡排序函数 - * aa bb cc - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - // 你的代码，使无序数组 a 变得有序 - for(int i = 0; i < n; i++) { - for(int j = 0; j < n - i - 1; j++) { - if(a[j] > a[j + 1]) { - int temp = a[j]; - a [j] = a[j + 1]; - a[j + 1] = temp; - } - } - } - - -} //end \ No newline at end of file diff --git a/codes/maxsky010/15734024.java b/codes/maxsky010/15734024.java deleted file mode 100644 index 7ec373aee12c8b4795c0d670e772620e90ee630e..0000000000000000000000000000000000000000 --- a/codes/maxsky010/15734024.java +++ /dev/null @@ -1,18 +0,0 @@ -/** - * 冒泡排序函数 - * 通过对相邻的元素进行两两比较，顺序相反则进行交换，每一轮比较会将当前未排序部分的最大值“冒泡”到未排序部分的末尾。 - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int[] a, int n) { - for (int i = 0; i < n - 1; i++) { // 外层循环控制所有轮数 - for (int j = 0; j < n - i - 1; j++) { // 内层循环控制每轮比较的次数 - if (a[j] > a[j + 1]) { // 如果前一个元素大于后一个元素，则交换它们 - // 交换 a[j] 和 a[j+1] - int temp = a[j]; - a[j] = a[j + 1]; - a[j + 1] = temp; - } - } - } -} // end diff --git a/codes/mcfly001/11350844.java b/codes/mcfly001/11350844.java deleted file mode 100644 index cacd12f1e4e4360dd1ffa22f3741e376110bcde4..0000000000000000000000000000000000000000 --- a/codes/mcfly001/11350844.java +++ /dev/null @@ -1,18 +0,0 @@ -/** - * 冒泡排序函数 - * aa bb cc - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - // 你的代码，使无序数组 a 变得有序 - for(int i=0;ia[j+1]){ - a[j] = a[j]+a[j+1]; - a[j+1] = a[j]-a[j+1]; - a[j] = a[j]-a[j+1]; - } - } - } -} //end \ No newline at end of file diff --git a/codes/meiyaya/15775357.java b/codes/meiyaya/15775357.java deleted file mode 100644 index 987377810b5beca8eb4bf5eafeee5db45e234a87..0000000000000000000000000000000000000000 --- a/codes/meiyaya/15775357.java +++ /dev/null @@ -1,20 +0,0 @@ -/** - * 冒泡排序函数 - * aa bb cc - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - // 你的代码，使无序数组 a 变得有序 - for(int i = 0; i < n; i++) { - for(int liuy = 0; liuy < n - i - 1; liuy++) { - if(a[liuy] > a[liuy + 1]) { - int temp = a[liuy]; - a [liuy] = a[liuy + 1]; - a[liuy + 1] = temp; - } - } - } - - -} //end,liuy diff --git a/codes/memuqee/11238999.java b/codes/memuqee/11238999.java deleted file mode 100644 index 24b49b4b1fd01d1f21be8b362a582158452e41d3..0000000000000000000000000000000000000000 --- a/codes/memuqee/11238999.java +++ /dev/null @@ -1,19 +0,0 @@ -/** - * 冒泡排序函数 - * aa bb cc - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - // 你的代码，使无序数组 a 变得有序 - for(int i = 0 ; i < n - 1 ; i++){ - for(int j = 0 ; j < n - 1 - i ; j++){ - if(a[j] > a[j + 1]){ - int tmp = a[j]; - a[j] = a[j + 1]; - a[j + 1] = tmp; - } - } - } - -} //end \ No newline at end of file diff --git a/codes/meng123/15699639.java b/codes/meng123/15699639.java deleted file mode 100644 index 987377810b5beca8eb4bf5eafeee5db45e234a87..0000000000000000000000000000000000000000 --- a/codes/meng123/15699639.java +++ /dev/null @@ -1,20 +0,0 @@ -/** - * 冒泡排序函数 - * aa bb cc - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - // 你的代码，使无序数组 a 变得有序 - for(int i = 0; i < n; i++) { - for(int liuy = 0; liuy < n - i - 1; liuy++) { - if(a[liuy] > a[liuy + 1]) { - int temp = a[liuy]; - a [liuy] = a[liuy + 1]; - a[liuy + 1] = temp; - } - } - } - - -} //end,liuy diff --git a/codes/mengbo/.keep b/codes/mengbo/.keep deleted file mode 100644 index e69de29bb2d1d6434b8b29ae775ad8c2e48c5391..0000000000000000000000000000000000000000 diff --git a/codes/mengbo/15855465.java b/codes/mengbo/15855465.java deleted file mode 100644 index 6426772fb479b07ed3be21ef1867921d1dbb194c..0000000000000000000000000000000000000000 --- a/codes/mengbo/15855465.java +++ /dev/null @@ -1,20 +0,0 @@ -/** - * 冒泡排序函数 - * aa bb cc - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - // 你的代码，使无序数组 a 变得有序 - for(int i = 0; i < n; i++) { - for(int j = 0; j < n - i - 1; j++) { - if(a[j] > a[j + 1]) { - int temp = a[j]; - a [j] = a[j + 1]; - a[j + 1] = temp; - } - } - } - - -} //end \ No newline at end of file diff --git a/codes/mengjian/15775342.java b/codes/mengjian/15775342.java deleted file mode 100644 index 987377810b5beca8eb4bf5eafeee5db45e234a87..0000000000000000000000000000000000000000 --- a/codes/mengjian/15775342.java +++ /dev/null @@ -1,20 +0,0 @@ -/** - * 冒泡排序函数 - * aa bb cc - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - // 你的代码，使无序数组 a 变得有序 - for(int i = 0; i < n; i++) { - for(int liuy = 0; liuy < n - i - 1; liuy++) { - if(a[liuy] > a[liuy + 1]) { - int temp = a[liuy]; - a [liuy] = a[liuy + 1]; - a[liuy + 1] = temp; - } - } - } - - -} //end,liuy diff --git a/codes/mengwenxu/15578436.java b/codes/mengwenxu/15578436.java deleted file mode 100644 index ae82e695cbfd360050241c3f1f592658c8c1d4e7..0000000000000000000000000000000000000000 --- a/codes/mengwenxu/15578436.java +++ /dev/null @@ -1,35 +0,0 @@ -/** - - * 冒泡排序函数 - - * aa bb cc - - * @param a 待排序的数组 - - * @param n 待排序的数组长度 - - */ - -public static void bubbleSort(int [] a, int n){ - - for(int i = 0; i < n-1 ; i++){ - - for (int j = 0;j < n-1-i;j++){ - - if(a[j] > a[j+1]){ - - int temp = a[j]; - - a[j] = a[j+1]; - - a[j+1] = temp; - - } - - } - - } - - - -} //end diff --git a/codes/mengzhong/15775328.java b/codes/mengzhong/15775328.java deleted file mode 100644 index 987377810b5beca8eb4bf5eafeee5db45e234a87..0000000000000000000000000000000000000000 --- a/codes/mengzhong/15775328.java +++ /dev/null @@ -1,20 +0,0 @@ -/** - * 冒泡排序函数 - * aa bb cc - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - // 你的代码，使无序数组 a 变得有序 - for(int i = 0; i < n; i++) { - for(int liuy = 0; liuy < n - i - 1; liuy++) { - if(a[liuy] > a[liuy + 1]) { - int temp = a[liuy]; - a [liuy] = a[liuy + 1]; - a[liuy + 1] = temp; - } - } - } - - -} //end,liuy diff --git a/codes/menmazqj/15277745.java b/codes/menmazqj/15277745.java deleted file mode 100644 index 37b3920b01f5b5e1a2d632f569dfbdcc988af812..0000000000000000000000000000000000000000 --- a/codes/menmazqj/15277745.java +++ /dev/null @@ -1,17 +0,0 @@ -/** - * 冒泡排序函数 - * aa bb cc - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - for (int i = 0; i < n - 1; i++) { - for (int j = 0; j < n - i - 1; j++) { - if (a[j] > a[j + 1]) { - int temp = a[j]; - a[j] = a[j + 1]; - a[j + 1] = temp; - } - } - } -} //end diff --git a/codes/mercurio/15782388.java b/codes/mercurio/15782388.java deleted file mode 100644 index 09064e0de2a17f59f9d03567fa6cd8733beb1238..0000000000000000000000000000000000000000 --- a/codes/mercurio/15782388.java +++ /dev/null @@ -1,19 +0,0 @@ -/** - * 冒泡排序函数 - * 通过相邻元素两两比较和交换，将最大（或最小）的元素冒泡到数组末尾。 - * 重复执行，直到整个数组有序。 - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int[] a, int n) { - for (int i = 0; i < n - 1; i++) { // 外层循环控制排序趟数 - for (int j = 0; j < n - 1 - i; j++) { // 内层循环控制每一趟排序多少次 - if (a[j] > a[j + 1]) { // 相邻元素两两比较，如果前一个元素比后一个元素大则交换它们 - // 交换 a[j] 和 a[j + 1] - int temp = a[j]; - a[j] = a[j + 1]; - a[j + 1] = temp; - } - } - } -} // end bubbleSort diff --git a/codes/mewchen/.keep b/codes/mewchen/.keep deleted file mode 100644 index e69de29bb2d1d6434b8b29ae775ad8c2e48c5391..0000000000000000000000000000000000000000 diff --git a/codes/mewchen/10042032.java b/codes/mewchen/10042032.java deleted file mode 100644 index 667eee0f585ec38ce639cb36d80df080e935946d..0000000000000000000000000000000000000000 --- a/codes/mewchen/10042032.java +++ /dev/null @@ -1,11 +0,0 @@ -public static void bubbleSort(int [] a,int n){ - for(int i = 0; i < n-1 ; i++){ - for (int j = 0;j < n-1-i;j++){ - if(a[j] > a[j+1]){ - int temp = a[j]; - a[j] = a[j+1]; - a[j+1] = temp; - } - } - } -} \ No newline at end of file diff --git a/codes/mi9688/15776507.java b/codes/mi9688/15776507.java deleted file mode 100644 index ae82e695cbfd360050241c3f1f592658c8c1d4e7..0000000000000000000000000000000000000000 --- a/codes/mi9688/15776507.java +++ /dev/null @@ -1,35 +0,0 @@ -/** - - * 冒泡排序函数 - - * aa bb cc - - * @param a 待排序的数组 - - * @param n 待排序的数组长度 - - */ - -public static void bubbleSort(int [] a, int n){ - - for(int i = 0; i < n-1 ; i++){ - - for (int j = 0;j < n-1-i;j++){ - - if(a[j] > a[j+1]){ - - int temp = a[j]; - - a[j] = a[j+1]; - - a[j+1] = temp; - - } - - } - - } - - - -} //end diff --git a/codes/mianyang/.keep b/codes/mianyang/.keep deleted file mode 100644 index e69de29bb2d1d6434b8b29ae775ad8c2e48c5391..0000000000000000000000000000000000000000 diff --git a/codes/mianyang/15856153.java b/codes/mianyang/15856153.java deleted file mode 100644 index 6426772fb479b07ed3be21ef1867921d1dbb194c..0000000000000000000000000000000000000000 --- a/codes/mianyang/15856153.java +++ /dev/null @@ -1,20 +0,0 @@ -/** - * 冒泡排序函数 - * aa bb cc - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - // 你的代码，使无序数组 a 变得有序 - for(int i = 0; i < n; i++) { - for(int j = 0; j < n - i - 1; j++) { - if(a[j] > a[j + 1]) { - int temp = a[j]; - a [j] = a[j + 1]; - a[j + 1] = temp; - } - } - } - - -} //end \ No newline at end of file diff --git a/codes/milkyTea/11201805.java b/codes/milkyTea/11201805.java deleted file mode 100644 index 47680171357df4926dc02873c8b8244657a0f30b..0000000000000000000000000000000000000000 --- a/codes/milkyTea/11201805.java +++ /dev/null @@ -1,22 +0,0 @@ -/** - * 冒泡排序函数 - * 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 diff --git a/codes/mimeik/14612577.java b/codes/mimeik/14612577.java deleted file mode 100644 index f723595341a74d31d963f92d96339a161c067a31..0000000000000000000000000000000000000000 --- a/codes/mimeik/14612577.java +++ /dev/null @@ -1,18 +0,0 @@ -/** - * 冒泡排序函数 - * aa bb cc - * @param a 待排序的数组 1111 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - - for (int i = 0; i < n; i++) { - for (int j = 0; j < i; j++) { - if (a[i] < a[j]) { - int t = a[i]; - a[i] = a[j]; - a[j] = t; - } - } - } -}//end diff --git a/codes/ming18641275939/15838279.java b/codes/ming18641275939/15838279.java deleted file mode 100644 index 47e0d6efa8bfa49fe95c91537dccda0c09563b63..0000000000000000000000000000000000000000 --- a/codes/ming18641275939/15838279.java +++ /dev/null @@ -1,18 +0,0 @@ -/** - * 冒泡排序函数 - * 功能：对数组进行升序排序 - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int[] a, int n) { - for (int i = 0; i < n - 1; i++) { // 遍历数组，从第一个元素到倒数第二个元素 - for (int j = 0; j < n - 1 - i; j++) { // 每次比较相邻的元素，最后一个元素已经是当前轮的最大值，无需再比较 - if (a[j] > a[j + 1]) { // 如果前一个元素大于后一个元素，则交换它们的位置 - // 交换 a[j] 和 a[j+1] - int temp = a[j]; - a[j] = a[j + 1]; - a[j + 1] = temp; - } - } - } -} // end diff --git a/codes/mingt123/15699576.java b/codes/mingt123/15699576.java deleted file mode 100644 index 987377810b5beca8eb4bf5eafeee5db45e234a87..0000000000000000000000000000000000000000 --- a/codes/mingt123/15699576.java +++ /dev/null @@ -1,20 +0,0 @@ -/** - * 冒泡排序函数 - * aa bb cc - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - // 你的代码，使无序数组 a 变得有序 - for(int i = 0; i < n; i++) { - for(int liuy = 0; liuy < n - i - 1; liuy++) { - if(a[liuy] > a[liuy + 1]) { - int temp = a[liuy]; - a [liuy] = a[liuy + 1]; - a[liuy + 1] = temp; - } - } - } - - -} //end,liuy diff --git a/codes/mingyaya/15775661.java b/codes/mingyaya/15775661.java deleted file mode 100644 index 987377810b5beca8eb4bf5eafeee5db45e234a87..0000000000000000000000000000000000000000 --- a/codes/mingyaya/15775661.java +++ /dev/null @@ -1,20 +0,0 @@ -/** - * 冒泡排序函数 - * aa bb cc - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - // 你的代码，使无序数组 a 变得有序 - for(int i = 0; i < n; i++) { - for(int liuy = 0; liuy < n - i - 1; liuy++) { - if(a[liuy] > a[liuy + 1]) { - int temp = a[liuy]; - a [liuy] = a[liuy + 1]; - a[liuy + 1] = temp; - } - } - } - - -} //end,liuy diff --git a/codes/mingzhi/.keep b/codes/mingzhi/.keep deleted file mode 100644 index e69de29bb2d1d6434b8b29ae775ad8c2e48c5391..0000000000000000000000000000000000000000 diff --git a/codes/mingzhi/15846139.java b/codes/mingzhi/15846139.java deleted file mode 100644 index 6426772fb479b07ed3be21ef1867921d1dbb194c..0000000000000000000000000000000000000000 --- a/codes/mingzhi/15846139.java +++ /dev/null @@ -1,20 +0,0 @@ -/** - * 冒泡排序函数 - * aa bb cc - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - // 你的代码，使无序数组 a 变得有序 - for(int i = 0; i < n; i++) { - for(int j = 0; j < n - i - 1; j++) { - if(a[j] > a[j + 1]) { - int temp = a[j]; - a [j] = a[j + 1]; - a[j + 1] = temp; - } - } - } - - -} //end \ No newline at end of file diff --git a/codes/minixin/11115487.java b/codes/minixin/11115487.java deleted file mode 100644 index 823354248ac46c3e3650f1c6dd3e0d62c7ad26cd..0000000000000000000000000000000000000000 --- a/codes/minixin/11115487.java +++ /dev/null @@ -1,17 +0,0 @@ -/** - * 冒泡排序函数 - * aa bb cc - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a,int n){ - for(int i = 0; i < n-1 ; i++){ - for (int j = 0;j < n-1-i;j++){ - if(a[j] > a[j+1]){ - int temp = a[j]; - a[j] = a[j+1]; - a[j+1] = temp; - } - } - } -} \ No newline at end of file diff --git a/codes/mirabit/18384785.java b/codes/mirabit/18384785.java deleted file mode 100644 index 83bb3cd3aa5e3e22feb4c71643b6b05d736e4b55..0000000000000000000000000000000000000000 --- a/codes/mirabit/18384785.java +++ /dev/null @@ -1,19 +0,0 @@ -/** - * 冒泡排序函数 - * aa bb cc - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - // 你的代码，使无序数组 a 变得有序 - for(int i=0;i a[j+1]){ - int temp = a[j]; - a[j] = a[j+1]; - a[j+1] = temp; - } - } - } - -} //end diff --git a/codes/miyuer/15846351.java b/codes/miyuer/15846351.java deleted file mode 100644 index e26e88b260697e3312493f0bd0fa255d825b96ef..0000000000000000000000000000000000000000 --- a/codes/miyuer/15846351.java +++ /dev/null @@ -1,18 +0,0 @@ -/** - * 冒泡排序函数 - * 通过不断比较相邻的元素，如果顺序错误则交换它们，直到整个数组有序 - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int[] a, int n) { - for (int i = 0; i < n - 1; i++) { // 外层循环控制排序的趟数 - for (int j = 0; j < n - 1 - i; j++) { // 内层循环控制每一趟排序多少次 - // 如果前一个元素比后一个元素大，则交换它们的位置 - if (a[j] > a[j + 1]) { - int temp = a[j]; - a[j] = a[j + 1]; - a[j + 1] = temp; - } - } - } -} //end diff --git a/codes/mjzhutianxiu/15555031.java b/codes/mjzhutianxiu/15555031.java deleted file mode 100644 index 49a64aea87954797dbd63b42f729d278ffbafca1..0000000000000000000000000000000000000000 --- a/codes/mjzhutianxiu/15555031.java +++ /dev/null @@ -1,20 +0,0 @@ -/** - * 冒泡排序函数 - * aa bb cc - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - // 你的代码，使无序数组 a 变得有序 - int i, j, tmp_data; - - for(i = 0; i < n - 1; i ++) { - for(j = 0; j < n - 1 - i; j ++) { - if(a[j] > a[j + 1]) { - tmp_data = a[j + 1]; - a[j + 1] = a[j]; - a[j] = tmp_data; - } - } - } -} //end diff --git a/codes/mjzhutianxiu/15578951.java b/codes/mjzhutianxiu/15578951.java deleted file mode 100644 index 49a64aea87954797dbd63b42f729d278ffbafca1..0000000000000000000000000000000000000000 --- a/codes/mjzhutianxiu/15578951.java +++ /dev/null @@ -1,20 +0,0 @@ -/** - * 冒泡排序函数 - * aa bb cc - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - // 你的代码，使无序数组 a 变得有序 - int i, j, tmp_data; - - for(i = 0; i < n - 1; i ++) { - for(j = 0; j < n - 1 - i; j ++) { - if(a[j] > a[j + 1]) { - tmp_data = a[j + 1]; - a[j + 1] = a[j]; - a[j] = tmp_data; - } - } - } -} //end diff --git a/codes/mmkk26/15845961.java b/codes/mmkk26/15845961.java deleted file mode 100644 index 987377810b5beca8eb4bf5eafeee5db45e234a87..0000000000000000000000000000000000000000 --- a/codes/mmkk26/15845961.java +++ /dev/null @@ -1,20 +0,0 @@ -/** - * 冒泡排序函数 - * aa bb cc - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - // 你的代码，使无序数组 a 变得有序 - for(int i = 0; i < n; i++) { - for(int liuy = 0; liuy < n - i - 1; liuy++) { - if(a[liuy] > a[liuy + 1]) { - int temp = a[liuy]; - a [liuy] = a[liuy + 1]; - a[liuy + 1] = temp; - } - } - } - - -} //end,liuy diff --git a/codes/mmm111/15648151.java b/codes/mmm111/15648151.java deleted file mode 100644 index 04625a494ce3da760397a3c3c648cdbe5d0bfa71..0000000000000000000000000000000000000000 --- a/codes/mmm111/15648151.java +++ /dev/null @@ -1,19 +0,0 @@ -/** - * 冒泡排序函数 - * aa bb cc - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - // 你的代码，使无序数组 a 变得有序 - for(int i = 0; i < n-1 ; i++){ - for (int j = 0;j < n-1-i;j++){ - if(a[j] > a[j+1]){ - int temp = a[j]; - a[j] = a[j+1]; - a[j+1] = temp; - } - } - } -} //end - diff --git a/codes/mmm123456/15625950.java b/codes/mmm123456/15625950.java deleted file mode 100644 index efccdd392a01ad6c4c94f113aeea500c9578d82e..0000000000000000000000000000000000000000 --- a/codes/mmm123456/15625950.java +++ /dev/null @@ -1,18 +0,0 @@ -/** - * 冒泡排序函数 - * aa bb cc - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - // 你的代码，使无序数组 a 变得有序 - for(int i = 0; i < n; i++) { - for(int j = 0; j < n - i - 1; ++j) { - if(a[j] > a[j + 1]) { - int tmp = a[j]; - a[j] = a[j + 1]; - a[j + 1] = tmp; - } - } - } -} //end diff --git a/codes/mmmmmm/11121934.java b/codes/mmmmmm/11121934.java deleted file mode 100644 index cacd12f1e4e4360dd1ffa22f3741e376110bcde4..0000000000000000000000000000000000000000 --- a/codes/mmmmmm/11121934.java +++ /dev/null @@ -1,18 +0,0 @@ -/** - * 冒泡排序函数 - * aa bb cc - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - // 你的代码，使无序数组 a 变得有序 - for(int i=0;ia[j+1]){ - a[j] = a[j]+a[j+1]; - a[j+1] = a[j]-a[j+1]; - a[j] = a[j]-a[j+1]; - } - } - } -} //end \ No newline at end of file diff --git a/codes/mmnn123/15720368.java b/codes/mmnn123/15720368.java deleted file mode 100644 index 987377810b5beca8eb4bf5eafeee5db45e234a87..0000000000000000000000000000000000000000 --- a/codes/mmnn123/15720368.java +++ /dev/null @@ -1,20 +0,0 @@ -/** - * 冒泡排序函数 - * aa bb cc - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - // 你的代码，使无序数组 a 变得有序 - for(int i = 0; i < n; i++) { - for(int liuy = 0; liuy < n - i - 1; liuy++) { - if(a[liuy] > a[liuy + 1]) { - int temp = a[liuy]; - a [liuy] = a[liuy + 1]; - a[liuy + 1] = temp; - } - } - } - - -} //end,liuy diff --git a/codes/mmx050623/15846455.java b/codes/mmx050623/15846455.java deleted file mode 100644 index b1e1f8d566986bb46e5f2aa47ed6e93fb76b0770..0000000000000000000000000000000000000000 --- a/codes/mmx050623/15846455.java +++ /dev/null @@ -1,18 +0,0 @@ -/** - * 冒泡排序函数 - * 将数组a按照升序进行排序 - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int[] a, int n) { - for (int i = 0; i < n - 1; i++) { // 外层循环控制排序的轮数 - for (int j = 0; j < n - i - 1; j++) { // 内层循环进行相邻元素的比较和交换 - if (a[j] > a[j + 1]) { // 如果前一个元素大于后一个元素 - // 交换两个元素的位置 - int temp = a[j]; - a[j] = a[j + 1]; - a[j + 1] = temp; - } - } - } -} // end diff --git a/codes/momo1234/15630942.java b/codes/momo1234/15630942.java deleted file mode 100644 index 15c23e4b3394070df3dad91a9611a0863cc3c696..0000000000000000000000000000000000000000 --- a/codes/momo1234/15630942.java +++ /dev/null @@ -1,29 +0,0 @@ -/** - * 冒泡排序函数 - * 冒泡排序是一种简单的排序算法，它重复地遍历要排序的数列，一次比较两个元素， - * 如果他们的顺序错误就把他们交换过来。遍历数列的工作是重复地进行直到没有再需要交换， - * 也就是说该数列已经排序完成。 - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - for (int i = 0; i < n - 1; i++) { - // 标记变量，用于检测是否发生过交换，如果没有交换则数组已经有序 - boolean swapped = false; - for (int j = 0; j < n - i - 1; j++) { - // 如果前一个元素大于后一个元素，则交换他们的位置 - if (a[j] > a[j + 1]) { - // 交换 a[j] 和 a[j+1] - int temp = a[j]; - a[j] = a[j + 1]; - a[j + 1] = temp; - // 标记本轮发生过交换 - swapped = true; - } - } - // 如果本轮没有发生过交换，说明数组已经有序，可以提前结束排序 - if (!swapped) { - break; - } - } -} //end diff --git a/codes/momozi/15562400.java b/codes/momozi/15562400.java deleted file mode 100644 index c2afaa2414da1853e4500b02c6de9068b64aeafe..0000000000000000000000000000000000000000 --- a/codes/momozi/15562400.java +++ /dev/null @@ -1,18 +0,0 @@ -/** - * 冒泡排序函数 - * aa bb cc - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - for(int i = 0; i < n-1 ; i++){ - for (int j = 0;j < n-1-i;j++){ - if(a[j] > a[j+1]){ - int temp = a[j]; - a[j] = a[j+1]; - a[j+1] = temp; - } - } - } - -} //end diff --git a/codes/moonmoon/15777672.java b/codes/moonmoon/15777672.java deleted file mode 100644 index a73834e9835a08c8638f1d13214eacc12771f0ca..0000000000000000000000000000000000000000 --- a/codes/moonmoon/15777672.java +++ /dev/null @@ -1,26 +0,0 @@ -/** - * 冒泡排序函数 - * 通过相邻元素之间的比较和交换，将无序数组变为有序数组 - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - for (int i = 0; i < n - 1; i++) { - // 标记变量，用于优化，如果在一趟排序中没有交换，则数组已经有序 - boolean swapped = false; - for (int j = 0; j < n - i - 1; j++) { - // 如果前一个元素大于后一个元素，则交换它们 - if (a[j] > a[j + 1]) { - int temp = a[j]; - a[j] = a[j + 1]; - a[j + 1] = temp; - // 发生了交换，将标记设为true - swapped = true; - } - } - // 如果在内层循环中没有发生交换，则数组已经有序，提前退出 - if (!swapped) { - break; - } - } -} //end diff --git a/codes/morikawakaho/15830357.java b/codes/morikawakaho/15830357.java deleted file mode 100644 index cc51cecc552b37081730ea9ab942f7b25bbbdce7..0000000000000000000000000000000000000000 --- a/codes/morikawakaho/15830357.java +++ /dev/null @@ -1,18 +0,0 @@ -/** - * 冒泡排序函数 - * 通过相邻元素之间的比较和交换，使得每一轮循环后，最大（或最小）的元素能够“浮”到数组的末尾 - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - for (int i = 0; i < n - 1; i++) { - for (int j = 0; j < n - 1 - i; j++) { - // 如果前一个元素大于后一个元素，则交换它们的位置 - if (a[j] > a[j + 1]) { - int temp = a[j]; - a[j] = a[j + 1]; - a[j + 1] = temp; - } - } - } -} //end diff --git a/codes/mouse123/.issueld.java.swp b/codes/mouse123/.issueld.java.swp deleted file mode 100644 index f62c2cd4312fc0b6daf2f41e73e1aaaf2ed948ba..0000000000000000000000000000000000000000 Binary files a/codes/mouse123/.issueld.java.swp and /dev/null differ diff --git a/codes/mouse123/15837734.java b/codes/mouse123/15837734.java deleted file mode 100644 index c2afaa2414da1853e4500b02c6de9068b64aeafe..0000000000000000000000000000000000000000 --- a/codes/mouse123/15837734.java +++ /dev/null @@ -1,18 +0,0 @@ -/** - * 冒泡排序函数 - * aa bb cc - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - for(int i = 0; i < n-1 ; i++){ - for (int j = 0;j < n-1-i;j++){ - if(a[j] > a[j+1]){ - int temp = a[j]; - a[j] = a[j+1]; - a[j+1] = temp; - } - } - } - -} //end diff --git a/codes/mouse123/issueld.java b/codes/mouse123/issueld.java deleted file mode 100644 index e69de29bb2d1d6434b8b29ae775ad8c2e48c5391..0000000000000000000000000000000000000000 diff --git a/codes/moyu9527/15633448.java b/codes/moyu9527/15633448.java deleted file mode 100644 index 26233d1660024e6554130ef03f6135cab4693de2..0000000000000000000000000000000000000000 --- a/codes/moyu9527/15633448.java +++ /dev/null @@ -1,21 +0,0 @@ -/** - * 冒泡排序函数 - * 将数组中的元素按照从小到大的顺序排列 - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - // 外层循环控制排序趟数 - for (int i = 0; i < n - 1; i++) { - // 内层循环控制每一趟排序多少次 - for (int j = 0; j < n - 1 - i; j++) { - // 如果当前元素大于下一个元素，则交换它们的位置 - if (a[j] > a[j + 1]) { - // 交换 a[j] 和 a[j + 1] - int temp = a[j]; - a[j] = a[j + 1]; - a[j + 1] = temp; - } - } - } -} //end diff --git a/codes/moyudaren/.keep b/codes/moyudaren/.keep deleted file mode 100644 index e69de29bb2d1d6434b8b29ae775ad8c2e48c5391..0000000000000000000000000000000000000000 diff --git a/codes/moyudaren/15860459.java b/codes/moyudaren/15860459.java deleted file mode 100644 index 6426772fb479b07ed3be21ef1867921d1dbb194c..0000000000000000000000000000000000000000 --- a/codes/moyudaren/15860459.java +++ /dev/null @@ -1,20 +0,0 @@ -/** - * 冒泡排序函数 - * aa bb cc - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - // 你的代码，使无序数组 a 变得有序 - for(int i = 0; i < n; i++) { - for(int j = 0; j < n - i - 1; j++) { - if(a[j] > a[j + 1]) { - int temp = a[j]; - a [j] = a[j + 1]; - a[j + 1] = temp; - } - } - } - - -} //end \ No newline at end of file diff --git a/codes/mozi123/15863565.java b/codes/mozi123/15863565.java deleted file mode 100644 index ce045dc0ec47c9f59627ca0c133a89bcad127bba..0000000000000000000000000000000000000000 --- a/codes/mozi123/15863565.java +++ /dev/null @@ -1,11 +0,0 @@ -public static void bubbleSort(int []a,int n){ - for(int i=0;ia[j+1]){ - int temp = a[j]; - a[j]=a[j+1]; - a[j+1]=temp; - } - } - } -} diff --git a/codes/mr_lk123/.java b/codes/mr_lk123/.java deleted file mode 100644 index e69de29bb2d1d6434b8b29ae775ad8c2e48c5391..0000000000000000000000000000000000000000 diff --git a/codes/mr_lk123/9954396.java b/codes/mr_lk123/9954396.java deleted file mode 100644 index 82b73c8ff8181a822b4e5b9b4a74866761c7b1ca..0000000000000000000000000000000000000000 --- a/codes/mr_lk123/9954396.java +++ /dev/null @@ -1,20 +0,0 @@ -/** - * 冒泡排序函数 - * aa bb cc - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - // 你的代码，使无序数组 a 变得有序 - for(int i = 0 ; i < n - 1 ; i++){ - for(int j = 0 ; j < n - 1 - i ; j++){ - if(a[j] > a[j + 1]){ - int tmp = a[j]; - a[j] = a[j + 1]; - a[j + 1] = tmp; - } - } - } - -} //end - diff --git a/codes/msc12345678/15659945.java b/codes/msc12345678/15659945.java deleted file mode 100644 index 558a2b69735e20a59a6b0e2d8629da73a39da82f..0000000000000000000000000000000000000000 --- a/codes/msc12345678/15659945.java +++ /dev/null @@ -1,12 +0,0 @@ -public static void bubbleSort(int[] a, int n) { - for (int i = 0; i < n - 1; i++) { // 外层循环控制所有元素遍历的次数 - for (int j = 0; j < n - 1 - i; j++) { // 内层循环控制相邻元素两两比较 - if (a[j] > a[j + 1]) { // 如果当前元素大于下一个元素，则交换它们的位置 - // 交换 a[j] 和 a[j+1] - int temp = a[j]; - a[j] = a[j + 1]; - a[j + 1] = temp; - } - } - } -} //end diff --git a/codes/msk6527/15520710.java b/codes/msk6527/15520710.java deleted file mode 100644 index d7fbec1bd5b39dee2d383d4d20f8690284d526d4..0000000000000000000000000000000000000000 --- a/codes/msk6527/15520710.java +++ /dev/null @@ -1,18 +0,0 @@ -/** - * 冒泡排序函数 - * 对数组进行冒泡排序，将无序数组变为有序数组 - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int[] a, int n) { - for (int i = 0; i < n - 1; i++) { // 外层循环，控制需要排序的趟数 - for (int j = 0; j < n - 1 - i; j++) { // 内层循环，从前往后依次比较相邻的两个元素 - if (a[j] > a[j + 1]) { // 如果前一个元素比后一个元素大，则交换它们的位置 - // 交换 a[j] 和 a[j+1] - int temp = a[j]; - a[j] = a[j + 1]; - a[j + 1] = temp; - } - } - } -} // end diff --git a/codes/mtfx0516/15585376.java b/codes/mtfx0516/15585376.java deleted file mode 100644 index c2afaa2414da1853e4500b02c6de9068b64aeafe..0000000000000000000000000000000000000000 --- a/codes/mtfx0516/15585376.java +++ /dev/null @@ -1,18 +0,0 @@ -/** - * 冒泡排序函数 - * aa bb cc - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - for(int i = 0; i < n-1 ; i++){ - for (int j = 0;j < n-1-i;j++){ - if(a[j] > a[j+1]){ - int temp = a[j]; - a[j] = a[j+1]; - a[j+1] = temp; - } - } - } - -} //end diff --git a/codes/mujing/15841257.java b/codes/mujing/15841257.java deleted file mode 100644 index ae51df2854cc3d1ce3fde6bac8ac82ec2ba42dff..0000000000000000000000000000000000000000 --- a/codes/mujing/15841257.java +++ /dev/null @@ -1,20 +0,0 @@ -/** - * 冒泡排序函数 - * 将数组中的元素按照从小到大的顺序排列 - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int[] a, int n) { - // 外层循环控制排序趟数 - for (int i = 0; i < n - 1; i++) { - // 内层循环控制每一趟排序多少次 - for (int j = 0; j < n - 1 - i; j++) { - // 如果前一个元素大于后一个元素，则交换它们的位置 - if (a[j] > a[j + 1]) { - int temp = a[j]; - a[j] = a[j + 1]; - a[j + 1] = temp; - } - } - } -} // end diff --git a/codes/mupimage/11254168.java b/codes/mupimage/11254168.java deleted file mode 100644 index 8d589d7edfe50246fe5deff283186d81a64dc137..0000000000000000000000000000000000000000 --- a/codes/mupimage/11254168.java +++ /dev/null @@ -1,21 +0,0 @@ -/** - * 冒泡排序函数 - * aa bb cc - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a,int n){ - int temp =0; - for(int i = 0;ia[j+1]){ - temp = a[j]; - a[j] = a[j+1]; - a[j+1] = temp; - } - } - } - - - -} \ No newline at end of file diff --git a/codes/musei123/15775718.java b/codes/musei123/15775718.java deleted file mode 100644 index 4b863ff87ee53efbd8c911a9c79ca4f42536cc5b..0000000000000000000000000000000000000000 --- a/codes/musei123/15775718.java +++ /dev/null @@ -1,26 +0,0 @@ -/** - * 冒泡排序函数 - * 使用冒泡排序算法对数组进行升序排序 - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int[] a, int n) { - for (int i = 0; i < n - 1; i++) { - // 标志位，用于检测是否发生过交换，如果没有交换，说明数组已经有序 - boolean swapped = false; - for (int j = 0; j < n - i - 1; j++) { - // 如果前一个元素大于后一个元素，则交换它们的位置 - if (a[j] > a[j + 1]) { - int temp = a[j]; - a[j] = a[j + 1]; - a[j + 1] = temp; - // 发生了交换，标志位设为true - swapped = true; - } - } - // 如果在内层循环中没有发生过交换，说明数组已经有序，提前结束排序 - if (!swapped) { - break; - } - } -} //end diff --git a/codes/muyang/.keep b/codes/muyang/.keep deleted file mode 100644 index e69de29bb2d1d6434b8b29ae775ad8c2e48c5391..0000000000000000000000000000000000000000 diff --git a/codes/muyang/15799169.java b/codes/muyang/15799169.java deleted file mode 100644 index 6426772fb479b07ed3be21ef1867921d1dbb194c..0000000000000000000000000000000000000000 --- a/codes/muyang/15799169.java +++ /dev/null @@ -1,20 +0,0 @@ -/** - * 冒泡排序函数 - * aa bb cc - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - // 你的代码，使无序数组 a 变得有序 - for(int i = 0; i < n; i++) { - for(int j = 0; j < n - i - 1; j++) { - if(a[j] > a[j + 1]) { - int temp = a[j]; - a [j] = a[j + 1]; - a[j + 1] = temp; - } - } - } - - -} //end \ No newline at end of file diff --git a/codes/muzhuo0205/15809688.java b/codes/muzhuo0205/15809688.java deleted file mode 100644 index 166dea5db31166b381f11f50cf27b5f36311847d..0000000000000000000000000000000000000000 --- a/codes/muzhuo0205/15809688.java +++ /dev/null @@ -1,19 +0,0 @@ -/** - * 冒泡排序函数 - * 该函数通过冒泡排序算法对数组进行排序 - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int[] a, int n) { - for (int i = 0; i < n - 1; i++) { // 外层循环控制比较轮数 - for (int j = 0; j < n - 1 - i; j++) { // 内层循环控制每轮的比较次数 - // 如果前一个元素大于后一个元素，则交换它们的位置 - if (a[j] > a[j + 1]) { - // 交换元素 - int temp = a[j]; - a[j] = a[j + 1]; - a[j + 1] = temp; - } - } - } -} //end diff --git a/codes/mwy280429/15517713.java b/codes/mwy280429/15517713.java deleted file mode 100644 index 4e7bebd733aa293f3502062974e4c36accba4b11..0000000000000000000000000000000000000000 --- a/codes/mwy280429/15517713.java +++ /dev/null @@ -1,18 +0,0 @@ -/** - * 冒泡排序函数 - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - for (int i = 0; i < n - 1; i++) { - for (int j = 0; j < n - i - 1; j++) { - if (a[j] > a[j + 1]) { - // 交换 a[j+1] 和 a[j] - int temp = a[j]; - a[j] = a[j + 1]; - a[j + 1] = temp; - } - } - } -} //end - diff --git a/codes/myclubocr/11122342.java b/codes/myclubocr/11122342.java deleted file mode 100644 index cdabc2e0876ad629e41ff055727cf3af34be8917..0000000000000000000000000000000000000000 --- a/codes/myclubocr/11122342.java +++ /dev/null @@ -1,20 +0,0 @@ -/** - * 冒泡排序函数 - * aa bb cc - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - // 你的代码，使无序数组 a 变得有序 - for (int i = 0; i < n; i++) { - for (int j = i + 1; j < n; j++) { - if (a[i] > a[j]) { - int temp = a[j]; - a[j] = a[i]; - a[i] = temp; - - } - } - } - -} //end \ No newline at end of file diff --git a/codes/myyaya/15774943.java b/codes/myyaya/15774943.java deleted file mode 100644 index 987377810b5beca8eb4bf5eafeee5db45e234a87..0000000000000000000000000000000000000000 --- a/codes/myyaya/15774943.java +++ /dev/null @@ -1,20 +0,0 @@ -/** - * 冒泡排序函数 - * aa bb cc - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - // 你的代码，使无序数组 a 变得有序 - for(int i = 0; i < n; i++) { - for(int liuy = 0; liuy < n - i - 1; liuy++) { - if(a[liuy] > a[liuy + 1]) { - int temp = a[liuy]; - a [liuy] = a[liuy + 1]; - a[liuy + 1] = temp; - } - } - } - - -} //end,liuy diff --git a/codes/nannanya/15777923.java b/codes/nannanya/15777923.java deleted file mode 100644 index 987377810b5beca8eb4bf5eafeee5db45e234a87..0000000000000000000000000000000000000000 --- a/codes/nannanya/15777923.java +++ /dev/null @@ -1,20 +0,0 @@ -/** - * 冒泡排序函数 - * aa bb cc - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - // 你的代码，使无序数组 a 变得有序 - for(int i = 0; i < n; i++) { - for(int liuy = 0; liuy < n - i - 1; liuy++) { - if(a[liuy] > a[liuy + 1]) { - int temp = a[liuy]; - a [liuy] = a[liuy + 1]; - a[liuy + 1] = temp; - } - } - } - - -} //end,liuy diff --git a/codes/nargnij7/15839361.java b/codes/nargnij7/15839361.java deleted file mode 100644 index 24f513b3219ac31ac3dcffe774647aa7bfdac254..0000000000000000000000000000000000000000 --- a/codes/nargnij7/15839361.java +++ /dev/null @@ -1,11 +0,0 @@ -public static void bubbleSort(int [] a, int n){ - for (int i = 0; i < n - 1; i++) { - for (int j = 0; j < n - 1 - i; j++) { - if (a[j] > a[j + 1]) { - int temp = a[j]; - a[j] = a[j + 1]; - a[j + 1] = temp; - } - } - } -} diff --git a/codes/nbdopa/11116411.java b/codes/nbdopa/11116411.java deleted file mode 100644 index d34027face05a4c77a2a35deae63795bb9c58f79..0000000000000000000000000000000000000000 --- a/codes/nbdopa/11116411.java +++ /dev/null @@ -1,27 +0,0 @@ -/** - * 冒泡排序函数 - * aa bb cc - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - // 你的代码，使无序数组 a 变得有序 - if(a == null || a.length == 0){ - return; - } - for(int i = 0; i< n; i++){ - boolean flag = true; - for(int j = 0; j< n - i - 1 ; j++){ - if(a[j]> a[j+1]){ - int tmp = a[j]; - a[j] = a[j+1]; - a[j+1] = tmp; - flag = false; - } - } - if(flag){ - break; - } - - } -} //end \ No newline at end of file diff --git a/codes/ndliang/15628397.java b/codes/ndliang/15628397.java deleted file mode 100644 index 41479c77912bd67627ed1ee874e22f7fe1ddd9e6..0000000000000000000000000000000000000000 --- a/codes/ndliang/15628397.java +++ /dev/null @@ -1,18 +0,0 @@ - -/** - * 冒泡排序函数 - * 这是一个经典的排序算法，通过不断比较相邻的元素，将较大的元素往后移动，实现数组的升序排序。 - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - for (int i = 0; i < n - 1; i++) { // 外层循环控制所有元素是否都排好序 - for (int j = 0; j < n - 1 - i; j++) { // 内层循环负责两两比较 - if (a[j] > a[j + 1]) { // 如果前一个元素大于后一个元素，则交换它们的位置 - int temp = a[j]; - a[j] = a[j + 1]; - a[j + 1] = temp; - } - } - } -} //end diff --git a/codes/ne8848/11116344.java b/codes/ne8848/11116344.java deleted file mode 100644 index 823354248ac46c3e3650f1c6dd3e0d62c7ad26cd..0000000000000000000000000000000000000000 --- a/codes/ne8848/11116344.java +++ /dev/null @@ -1,17 +0,0 @@ -/** - * 冒泡排序函数 - * aa bb cc - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a,int n){ - for(int i = 0; i < n-1 ; i++){ - for (int j = 0;j < n-1-i;j++){ - if(a[j] > a[j+1]){ - int temp = a[j]; - a[j] = a[j+1]; - a[j+1] = temp; - } - } - } -} \ No newline at end of file diff --git a/codes/neineiya/11260235.java b/codes/neineiya/11260235.java deleted file mode 100644 index cdabc2e0876ad629e41ff055727cf3af34be8917..0000000000000000000000000000000000000000 --- a/codes/neineiya/11260235.java +++ /dev/null @@ -1,20 +0,0 @@ -/** - * 冒泡排序函数 - * aa bb cc - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - // 你的代码，使无序数组 a 变得有序 - for (int i = 0; i < n; i++) { - for (int j = i + 1; j < n; j++) { - if (a[i] > a[j]) { - int temp = a[j]; - a[j] = a[i]; - a[i] = temp; - - } - } - } - -} //end \ No newline at end of file diff --git a/codes/nekoko/.keep b/codes/nekoko/.keep deleted file mode 100644 index e69de29bb2d1d6434b8b29ae775ad8c2e48c5391..0000000000000000000000000000000000000000 diff --git a/codes/nekoko/15845688.java b/codes/nekoko/15845688.java deleted file mode 100644 index 6426772fb479b07ed3be21ef1867921d1dbb194c..0000000000000000000000000000000000000000 --- a/codes/nekoko/15845688.java +++ /dev/null @@ -1,20 +0,0 @@ -/** - * 冒泡排序函数 - * aa bb cc - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - // 你的代码，使无序数组 a 变得有序 - for(int i = 0; i < n; i++) { - for(int j = 0; j < n - i - 1; j++) { - if(a[j] > a[j + 1]) { - int temp = a[j]; - a [j] = a[j + 1]; - a[j + 1] = temp; - } - } - } - - -} //end \ No newline at end of file diff --git a/codes/nemolv/15195393.java b/codes/nemolv/15195393.java deleted file mode 100644 index c85755c9b21fd63adaaaea9c767573a42bd6ce7d..0000000000000000000000000000000000000000 --- a/codes/nemolv/15195393.java +++ /dev/null @@ -1,22 +0,0 @@ -/** - * 冒泡排序函数 - * aa bb cc - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - // 你的代码，使无序数组 a 变得有序 - //外部循环控制排序的趟数。冒泡排序的每一趟会将最大的元素"冒泡"到数组的末尾，因此需要执行 n-1 趟，其中 n 是元素的总数 - for (int i = 0; i < n - 1; i++) { - //内循环控制每趟比较的次数。由于每一趟都会将一个最大的元素沉到数组末尾，所以内循环次数逐渐减小。 - for (int j = 0; j < n - i - 1; j++) { - if (a[j] > a[j + 1]) { - // 交换arr[j]和arr[j+1] - int temp = a[j]; - a[j] = a[j + 1]; - a[j + 1] = temp; - } - } - } - -} //end diff --git a/codes/nfnxfr/.keep b/codes/nfnxfr/.keep deleted file mode 100644 index e69de29bb2d1d6434b8b29ae775ad8c2e48c5391..0000000000000000000000000000000000000000 diff --git a/codes/nfnxfr/15775676.java b/codes/nfnxfr/15775676.java deleted file mode 100644 index 5edd6bf0e38372fd1654da46aeafd4941c42ddb7..0000000000000000000000000000000000000000 --- a/codes/nfnxfr/15775676.java +++ /dev/null @@ -1,20 +0,0 @@ -/** - * 冒泡排序函数 - * aa bb cc - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - // 你的代码，使无序数组 a 变得有序 - for (int i = 0; i < n; i++) { - for (int j = i + 1; j < n; j++) { - if (a[i] > a[j]) { - int temp = a[j]; - a[j] = a[i]; - a[i] = temp; - - } - } - } - -} //end \ No newline at end of file diff --git a/codes/nigger/15601489.java b/codes/nigger/15601489.java deleted file mode 100644 index c2afaa2414da1853e4500b02c6de9068b64aeafe..0000000000000000000000000000000000000000 --- a/codes/nigger/15601489.java +++ /dev/null @@ -1,18 +0,0 @@ -/** - * 冒泡排序函数 - * aa bb cc - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - for(int i = 0; i < n-1 ; i++){ - for (int j = 0;j < n-1-i;j++){ - if(a[j] > a[j+1]){ - int temp = a[j]; - a[j] = a[j+1]; - a[j+1] = temp; - } - } - } - -} //end diff --git a/codes/nightowl/9959740.java b/codes/nightowl/9959740.java deleted file mode 100644 index 4f93d09f6ee55c29cfd8c0af38a103f9a34f55b1..0000000000000000000000000000000000000000 --- a/codes/nightowl/9959740.java +++ /dev/null @@ -1,21 +0,0 @@ -/** - * 冒泡排序函数 - * aa bb cc - * - * @param arr 待排序的数组 - * @param len 待排序的数组长度 - */ - public static void bubbleSort(int[] arr, int len) { - // 你的代码，使无序数组 a 变得有序 - for (int i = 0; i < len - 1; i++) { - //对数组进行遍历，相邻的两个数字进行比较，每次比较之后数字总数就会减一防止索引越界，让长度减一 - for (int j = 0; j < len - 1 - i; j++) { - //判断每两个相邻的数字，大的往前排 - if (arr[j] >= arr[j + 1]) { - int temp = arr[j]; - arr[j] = arr[j + 1]; - arr[j + 1] = temp; - } - } - } - } //end diff --git a/codes/nihao01/.keep b/codes/nihao01/.keep deleted file mode 100644 index e69de29bb2d1d6434b8b29ae775ad8c2e48c5391..0000000000000000000000000000000000000000 diff --git a/codes/nihao01/15867137.java b/codes/nihao01/15867137.java deleted file mode 100644 index 6426772fb479b07ed3be21ef1867921d1dbb194c..0000000000000000000000000000000000000000 --- a/codes/nihao01/15867137.java +++ /dev/null @@ -1,20 +0,0 @@ -/** - * 冒泡排序函数 - * aa bb cc - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - // 你的代码，使无序数组 a 变得有序 - for(int i = 0; i < n; i++) { - for(int j = 0; j < n - i - 1; j++) { - if(a[j] > a[j + 1]) { - int temp = a[j]; - a [j] = a[j + 1]; - a[j + 1] = temp; - } - } - } - - -} //end \ No newline at end of file diff --git a/codes/niumaa/15777757.java b/codes/niumaa/15777757.java deleted file mode 100644 index 4afc69817ac4cab06e9de968671769993b913aa9..0000000000000000000000000000000000000000 --- a/codes/niumaa/15777757.java +++ /dev/null @@ -1,22 +0,0 @@ -/** - * 冒泡排序函数 - * 通过比较相邻的元素，如果前一个元素比后一个元素大，则交换它们的位置， - * 经过多轮比较和交换，较大的元素会逐渐"浮"到数组的末尾，较小的元素则"沉"到数组的前端。 - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int[] a, int n) { - // 外层循环控制排序的轮数 - for (int i = 0; i < n - 1; i++) { - // 内层循环控制每轮排序中相邻元素的比较和交换 - for (int j = 0; j < n - 1 - i; j++) { - // 如果前一个元素比后一个元素大，则交换它们的位置 - if (a[j] > a[j + 1]) { - // 交换a[j]和a[j+1] - int temp = a[j]; - a[j] = a[j + 1]; - a[j + 1] = temp; - } - } - } -} //end diff --git a/codes/niyiyi/15684167.java b/codes/niyiyi/15684167.java deleted file mode 100644 index 54c5f3869cd16ee9e7c2b77895a39fae63f05dbc..0000000000000000000000000000000000000000 --- a/codes/niyiyi/15684167.java +++ /dev/null @@ -1,20 +0,0 @@ -/** - * 冒泡排序函数 - * aa bb cc - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - // 你的代码，使无序数组 a 变得有序 - for(int i = 0; i < n; i++) { - for(int liuy = 0; liuy < n - i - 1; liuy++) { - if(a[liuy] > a[liuy + 1]) { - int temp = a[liuy]; - a [liuy] = a[liuy + 1]; - a[liuy + 1] = temp; - } - } - } - - -} //end,liuy \ No newline at end of file diff --git a/codes/njjkxllj/15631418.java b/codes/njjkxllj/15631418.java deleted file mode 100644 index ad6fb35f9bcbc22c336cd0851d9676f65b5b7676..0000000000000000000000000000000000000000 --- a/codes/njjkxllj/15631418.java +++ /dev/null @@ -1,22 +0,0 @@ - -/** - * 冒泡排序函数 - * aa bb cc - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - // 你的代码，使无序数组 a 变得有序 - for (int i=0;ia[j+1]){ - int temp=a[j+1]; - a[j+1]=a[j]; - a[j]=temp; - } - } - } - return a; -} //end - - diff --git a/codes/nn314159/15826881.java b/codes/nn314159/15826881.java deleted file mode 100644 index 24f513b3219ac31ac3dcffe774647aa7bfdac254..0000000000000000000000000000000000000000 --- a/codes/nn314159/15826881.java +++ /dev/null @@ -1,11 +0,0 @@ -public static void bubbleSort(int [] a, int n){ - for (int i = 0; i < n - 1; i++) { - for (int j = 0; j < n - 1 - i; j++) { - if (a[j] > a[j + 1]) { - int temp = a[j]; - a[j] = a[j + 1]; - a[j + 1] = temp; - } - } - } -} diff --git a/codes/no8gcoder/15578057.java b/codes/no8gcoder/15578057.java deleted file mode 100644 index acec583fb811e1f577adcdc5c0236228369b994f..0000000000000000000000000000000000000000 --- a/codes/no8gcoder/15578057.java +++ /dev/null @@ -1,21 +0,0 @@ -/** - * 冒泡排序函数 - * 对数组进行冒泡排序，从小到大排序 - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - // 外层循环控制排序趟数 - for (int i = 0; i < n - 1; i++) { - // 内层循环负责每一趟的排序过程 - for (int j = 0; j < n - 1 - i; j++) { - // 如果当前元素大于下一个元素，则交换它们的位置 - if (a[j] > a[j + 1]) { - // 交换 a[j] 和 a[j+1] - int temp = a[j]; - a[j] = a[j + 1]; - a[j + 1] = temp; - } - } - } -} //end diff --git a/codes/nofear123/.15830815.java.swo b/codes/nofear123/.15830815.java.swo deleted file mode 100644 index 69d4361503fc5d9b3061f29fb91fe9efc8e6936b..0000000000000000000000000000000000000000 Binary files a/codes/nofear123/.15830815.java.swo and /dev/null differ diff --git a/codes/nofear123/.15830815.java.swp b/codes/nofear123/.15830815.java.swp deleted file mode 100644 index 121b34bcd439915fd547750dc23179e35995f4bc..0000000000000000000000000000000000000000 Binary files a/codes/nofear123/.15830815.java.swp and /dev/null differ diff --git a/codes/nofear123/15831083.java b/codes/nofear123/15831083.java deleted file mode 100644 index ab864d7a2b797971d5a5160adead11afdba70df0..0000000000000000000000000000000000000000 --- a/codes/nofear123/15831083.java +++ /dev/null @@ -1,21 +0,0 @@ -/** - * 冒泡排序函数 - * 通过多次遍历数组，比较并交换相邻元素，使得较大的元素逐渐“浮”到数组的末尾，达到排序的目的。 - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int[] a, int n) { - // 外层循环，控制遍历次数 - for (int i = 0; i < n - 1; i++) { - // 内层循环，控制每次遍历时的比较和交换 - for (int j = 0; j < n - 1 - i; j++) { - // 如果当前元素大于下一个元素，则交换它们的位置 - if (a[j] > a[j + 1]) { - // 交换a[j]和a[j+1] - int temp = a[j]; - a[j] = a[j + 1]; - a[j + 1] = temp; - } - } - } -} // end diff --git a/codes/nonowa/15831088.java b/codes/nonowa/15831088.java deleted file mode 100644 index 987377810b5beca8eb4bf5eafeee5db45e234a87..0000000000000000000000000000000000000000 --- a/codes/nonowa/15831088.java +++ /dev/null @@ -1,20 +0,0 @@ -/** - * 冒泡排序函数 - * aa bb cc - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - // 你的代码，使无序数组 a 变得有序 - for(int i = 0; i < n; i++) { - for(int liuy = 0; liuy < n - i - 1; liuy++) { - if(a[liuy] > a[liuy + 1]) { - int temp = a[liuy]; - a [liuy] = a[liuy + 1]; - a[liuy + 1] = temp; - } - } - } - - -} //end,liuy diff --git a/codes/ny960126/15626345.java b/codes/ny960126/15626345.java deleted file mode 100644 index 354c65d87e3457604a386f0a99f2c10a07314d5c..0000000000000000000000000000000000000000 --- a/codes/ny960126/15626345.java +++ /dev/null @@ -1,12 +0,0 @@ -public static void bubbleSort(int []a, int n){ - for(int i = 0; i < n - 1; i++){ - for(int j = 0; j < n - i - 1; j++){ - if(a[j] > a[j + 1]){ - //交换a[j]和a[j + 1] - int temp = a[j]; - a[j] = a[j + 1]; - a[j + 1] = temp; - } - } - } -} diff --git a/codes/nzqq54667/.keep b/codes/nzqq54667/.keep deleted file mode 100644 index e69de29bb2d1d6434b8b29ae775ad8c2e48c5391..0000000000000000000000000000000000000000 diff --git a/codes/nzqq54667/15841667.java b/codes/nzqq54667/15841667.java deleted file mode 100644 index 6e9861fa3ec6d5a2553cdccd1bb1e977430c671b..0000000000000000000000000000000000000000 --- a/codes/nzqq54667/15841667.java +++ /dev/null @@ -1,19 +0,0 @@ -/** - * 冒泡排序函数 - * aa bb cc - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - // 你的代码，使无序数组 a 变得有序 - for (int i = 0; i < n - 1; i++) { - for (int j = 0; j < n - i - 1; j++) { - if (a[j] > a[j + 1]) { - - int temp = a[j]; - a[j] = a[j + 1]; - a[j + 1] = temp; - } - } - } -} //end \ No newline at end of file diff --git a/codes/o11ccm/.keep b/codes/o11ccm/.keep deleted file mode 100644 index e69de29bb2d1d6434b8b29ae775ad8c2e48c5391..0000000000000000000000000000000000000000 diff --git a/codes/o11ccm/10041751.java b/codes/o11ccm/10041751.java deleted file mode 100644 index c031d21af6fe2736fb18f2152a78025d14914262..0000000000000000000000000000000000000000 --- a/codes/o11ccm/10041751.java +++ /dev/null @@ -1,17 +0,0 @@ -/** - * 冒泡排序函数 - * aa bb cc - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a,int n){ - for(int i = 0; i < n-1 ; i++){ - for (int j = 0;j < n-1-i;j++){ - if(a[j] > a[j+1]){ - int temp = a[j]; - a[j] = a[j+1]; - a[j+1] = temp; - } - } - } -} \ No newline at end of file diff --git a/codes/o1982016781/11118518.java b/codes/o1982016781/11118518.java deleted file mode 100644 index 37e8a08faccdeeae78deb95416f0867067181b74..0000000000000000000000000000000000000000 --- a/codes/o1982016781/11118518.java +++ /dev/null @@ -1,11 +0,0 @@ -public static void bubbleSort(int [] b, int n) { - for (int i=0 ; ib[j+1]) { - int temp=b[j]; - b[j]=b[j+1]; - b[j+1]=temp; - } - } - } -} \ No newline at end of file diff --git a/codes/o389675/15718177.java b/codes/o389675/15718177.java deleted file mode 100644 index ef30d22d184d51c4a9e71595baebc5b69eed29a5..0000000000000000000000000000000000000000 --- a/codes/o389675/15718177.java +++ /dev/null @@ -1,17 +0,0 @@ -/** - * 冒泡排序函数 - * 通过相邻元素之间的比较和交换，使得每一轮循环后最大（或最小）的元素能够“冒泡”到数组的末尾。 - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - for (int i = 0; i < n - 1; i++) { // 外层循环控制需要排序的趟数 - for (int j = 0; j < n - 1 - i; j++) { // 内层循环控制每一趟排序的过程 - if (a[j] > a[j + 1]) { // 如果前一个元素大于后一个元素，则交换它们的位置 - int temp = a[j]; - a[j] = a[j + 1]; - a[j + 1] = temp; - } - } - } -} //end diff --git a/codes/obc147/11064483.java b/codes/obc147/11064483.java deleted file mode 100644 index 823354248ac46c3e3650f1c6dd3e0d62c7ad26cd..0000000000000000000000000000000000000000 --- a/codes/obc147/11064483.java +++ /dev/null @@ -1,17 +0,0 @@ -/** - * 冒泡排序函数 - * aa bb cc - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a,int n){ - for(int i = 0; i < n-1 ; i++){ - for (int j = 0;j < n-1-i;j++){ - if(a[j] > a[j+1]){ - int temp = a[j]; - a[j] = a[j+1]; - a[j+1] = temp; - } - } - } -} \ No newline at end of file diff --git a/codes/onenewcode/15333872.java b/codes/onenewcode/15333872.java deleted file mode 100644 index 0124a74c194bf08ed6e40679fe15f1bbf900e976..0000000000000000000000000000000000000000 --- a/codes/onenewcode/15333872.java +++ /dev/null @@ -1,11 +0,0 @@ -public static void bubbleSort(int [] a,int n){ - for(int i = 0; i < n-1 ; i++){ - for (int j = 0;j < n-1-i;j++){ - if(a[j] > a[j+1]){ - int temp = a[j]; - a[j] = a[j+1]; - a[j+1] = temp; - } - } - } -} \ No newline at end of file diff --git a/codes/ooooo_long/15253355.java b/codes/ooooo_long/15253355.java deleted file mode 100644 index ecfb06f78761be02481338cc4e8e079a30facc5f..0000000000000000000000000000000000000000 --- a/codes/ooooo_long/15253355.java +++ /dev/null @@ -1,18 +0,0 @@ -/** - * 冒泡排序函数 - * aa bb cc - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int[] a, int n) { - // 你的代码，使无序数组 a 变得有序 - for(int i = 0; i < n; i++) { - for(int j = 0; j < n - i - 1; j++) { - if(a[j] > a[j + 1]) { - int temp = a[j]; - a[j] = a[j + 1]; - a[j + 1] = temp; - } - } - } -} //end diff --git a/codes/ooooo_long/15256718.java b/codes/ooooo_long/15256718.java deleted file mode 100644 index ecfb06f78761be02481338cc4e8e079a30facc5f..0000000000000000000000000000000000000000 --- a/codes/ooooo_long/15256718.java +++ /dev/null @@ -1,18 +0,0 @@ -/** - * 冒泡排序函数 - * aa bb cc - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int[] a, int n) { - // 你的代码，使无序数组 a 变得有序 - for(int i = 0; i < n; i++) { - for(int j = 0; j < n - i - 1; j++) { - if(a[j] > a[j + 1]) { - int temp = a[j]; - a[j] = a[j + 1]; - a[j + 1] = temp; - } - } - } -} //end diff --git a/codes/ooopen/11302831.java b/codes/ooopen/11302831.java deleted file mode 100644 index 029e9d84c1474520908887693e69aabcb7ff0aba..0000000000000000000000000000000000000000 --- a/codes/ooopen/11302831.java +++ /dev/null @@ -1,28 +0,0 @@ -/** - * 冒泡排序函数 - * aa bb cc - * @param a 待排序的数组 - * @param n 待排序的数组长度 -*/ -public static void bubbleSort(int [] a, int n){ - int j , k; - int flag = n ;//flag来记录最后交换的位置，也就是排序的尾边界 - - while (flag > 0){//排序未结束标志 - k = flag; //k 来记录遍历的尾边界 - flag = 0; - - for(j=1; j a[j]){//前面的数字大于后面的数字就交换 - //交换a[j-1]和a[j] - int temp; - temp = a[j-1]; - a[j-1] = a[j]; - a[j]=temp; - - //表示交换过数据; - flag = j;//记录最新的尾边界. - } - } - } -} \ No newline at end of file diff --git a/codes/opaozhouzhou04/.keep b/codes/opaozhouzhou04/.keep deleted file mode 100644 index e69de29bb2d1d6434b8b29ae775ad8c2e48c5391..0000000000000000000000000000000000000000 diff --git a/codes/opaozhouzhou04/15846494.java b/codes/opaozhouzhou04/15846494.java deleted file mode 100644 index 6e9861fa3ec6d5a2553cdccd1bb1e977430c671b..0000000000000000000000000000000000000000 --- a/codes/opaozhouzhou04/15846494.java +++ /dev/null @@ -1,19 +0,0 @@ -/** - * 冒泡排序函数 - * aa bb cc - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - // 你的代码，使无序数组 a 变得有序 - for (int i = 0; i < n - 1; i++) { - for (int j = 0; j < n - i - 1; j++) { - if (a[j] > a[j + 1]) { - - int temp = a[j]; - a[j] = a[j + 1]; - a[j + 1] = temp; - } - } - } -} //end \ No newline at end of file diff --git a/codes/openAI12/11234314.java b/codes/openAI12/11234314.java deleted file mode 100644 index 272a12fc81d3dd0e857bba9ae001c15818fb7123..0000000000000000000000000000000000000000 --- a/codes/openAI12/11234314.java +++ /dev/null @@ -1,18 +0,0 @@ - /** - * 冒泡排序函数 - * aa bb cc - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ - public static void bubbleSort(int [] arr, int n){ - // 你的代码，使无序数组 a 变得有序 - for (int i = 0; i < n; i++) { - for (int j = (i + 1); j < n; j++) { - if (arr[i] > arr[j]) { - int temp = arr[i]; - arr[i] = arr[j]; - arr[j] = temp; - } - } - } - } //end \ No newline at end of file diff --git a/codes/openAsg/11491517.java b/codes/openAsg/11491517.java deleted file mode 100644 index e614b8982a7289050015e820483647564f08204b..0000000000000000000000000000000000000000 --- a/codes/openAsg/11491517.java +++ /dev/null @@ -1,17 +0,0 @@ -/** - * 冒泡排序函数 - * aa bb cc - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - for (int i = 0; i < n - 1; ++i) { - for (int j = 0; j < n - i - 1; ++j) { - if (a[j] > a[j+1]) { - int tmp = a[j]; - a[j] = a[j+1]; - a[j+1] = tmp; - } - } - } -} //end diff --git a/codes/openCI/11276263.java b/codes/openCI/11276263.java deleted file mode 100644 index cdabc2e0876ad629e41ff055727cf3af34be8917..0000000000000000000000000000000000000000 --- a/codes/openCI/11276263.java +++ /dev/null @@ -1,20 +0,0 @@ -/** - * 冒泡排序函数 - * aa bb cc - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - // 你的代码，使无序数组 a 变得有序 - for (int i = 0; i < n; i++) { - for (int j = i + 1; j < n; j++) { - if (a[i] > a[j]) { - int temp = a[j]; - a[j] = a[i]; - a[i] = temp; - - } - } - } - -} //end \ No newline at end of file diff --git a/codes/openZnolis/18398006.java b/codes/openZnolis/18398006.java deleted file mode 100644 index d78880e1b9f06e68d996ced64cc6cf6e885e4e80..0000000000000000000000000000000000000000 --- a/codes/openZnolis/18398006.java +++ /dev/null @@ -1,24 +0,0 @@ -/** - * 冒泡排序函数 - * aa bb cc - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - // 你的代码，使无序数组 a 变得有序 - boolean swapped; - for (int i = 0; i < n - 1; i++) { - swapped = false; - for (int j = 0; j < n - 1 - i; j++) { - if (a[j] > a[j + 1]) { - // 交换元素 - int temp = a[j]; - a[j] = a[j + 1]; - a[j + 1] = temp; - swapped = true; - } - } - // 如果在这一轮中没有发生任何交换，说明数组已经排好序了 - if (!swapped) break; - } -} //end diff --git a/codes/openZnolis/18398008.java b/codes/openZnolis/18398008.java deleted file mode 100644 index d78880e1b9f06e68d996ced64cc6cf6e885e4e80..0000000000000000000000000000000000000000 --- a/codes/openZnolis/18398008.java +++ /dev/null @@ -1,24 +0,0 @@ -/** - * 冒泡排序函数 - * aa bb cc - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - // 你的代码，使无序数组 a 变得有序 - boolean swapped; - for (int i = 0; i < n - 1; i++) { - swapped = false; - for (int j = 0; j < n - 1 - i; j++) { - if (a[j] > a[j + 1]) { - // 交换元素 - int temp = a[j]; - a[j] = a[j + 1]; - a[j + 1] = temp; - swapped = true; - } - } - // 如果在这一轮中没有发生任何交换，说明数组已经排好序了 - if (!swapped) break; - } -} //end diff --git a/codes/openZnolis/18398010.java b/codes/openZnolis/18398010.java deleted file mode 100644 index d78880e1b9f06e68d996ced64cc6cf6e885e4e80..0000000000000000000000000000000000000000 --- a/codes/openZnolis/18398010.java +++ /dev/null @@ -1,24 +0,0 @@ -/** - * 冒泡排序函数 - * aa bb cc - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - // 你的代码，使无序数组 a 变得有序 - boolean swapped; - for (int i = 0; i < n - 1; i++) { - swapped = false; - for (int j = 0; j < n - 1 - i; j++) { - if (a[j] > a[j + 1]) { - // 交换元素 - int temp = a[j]; - a[j] = a[j + 1]; - a[j + 1] = temp; - swapped = true; - } - } - // 如果在这一轮中没有发生任何交换，说明数组已经排好序了 - if (!swapped) break; - } -} //end diff --git a/codes/openZnolis/18398011.java b/codes/openZnolis/18398011.java deleted file mode 100644 index d78880e1b9f06e68d996ced64cc6cf6e885e4e80..0000000000000000000000000000000000000000 --- a/codes/openZnolis/18398011.java +++ /dev/null @@ -1,24 +0,0 @@ -/** - * 冒泡排序函数 - * aa bb cc - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - // 你的代码，使无序数组 a 变得有序 - boolean swapped; - for (int i = 0; i < n - 1; i++) { - swapped = false; - for (int j = 0; j < n - 1 - i; j++) { - if (a[j] > a[j + 1]) { - // 交换元素 - int temp = a[j]; - a[j] = a[j + 1]; - a[j + 1] = temp; - swapped = true; - } - } - // 如果在这一轮中没有发生任何交换，说明数组已经排好序了 - if (!swapped) break; - } -} //end diff --git a/codes/openZnolis/18398012.java b/codes/openZnolis/18398012.java deleted file mode 100644 index d78880e1b9f06e68d996ced64cc6cf6e885e4e80..0000000000000000000000000000000000000000 --- a/codes/openZnolis/18398012.java +++ /dev/null @@ -1,24 +0,0 @@ -/** - * 冒泡排序函数 - * aa bb cc - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - // 你的代码，使无序数组 a 变得有序 - boolean swapped; - for (int i = 0; i < n - 1; i++) { - swapped = false; - for (int j = 0; j < n - 1 - i; j++) { - if (a[j] > a[j + 1]) { - // 交换元素 - int temp = a[j]; - a[j] = a[j + 1]; - a[j + 1] = temp; - swapped = true; - } - } - // 如果在这一轮中没有发生任何交换，说明数组已经排好序了 - if (!swapped) break; - } -} //end diff --git a/codes/openanolis_idear/.keep b/codes/openanolis_idear/.keep deleted file mode 100644 index e69de29bb2d1d6434b8b29ae775ad8c2e48c5391..0000000000000000000000000000000000000000 diff --git a/codes/openanolis_idear/15698658.java b/codes/openanolis_idear/15698658.java deleted file mode 100644 index 8c7e1b661dc7b1c6a82c3a8f52adfc195c89691e..0000000000000000000000000000000000000000 --- a/codes/openanolis_idear/15698658.java +++ /dev/null @@ -1,19 +0,0 @@ -/** - * 冒泡排序函数 - * aa bb cc - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - // 你的代码，使无序数组 a 变得有序 - for (int i = 0; i < n - 1; i++) { - for (int j = 0; j < n - i - 1; j++) { - if (a[j] > a[j + 1]) { - // 交换位置 - int temp = a[j]; - a[j] = a[j + 1]; - a[j + 1] = temp; - } - } - } -} //end \ No newline at end of file diff --git a/codes/opsation/11293380.java b/codes/opsation/11293380.java deleted file mode 100644 index 1c8889947f924214c71a3c3f202500b4780dc281..0000000000000000000000000000000000000000 --- a/codes/opsation/11293380.java +++ /dev/null @@ -1,11 +0,0 @@ -public static void bubbleSort(int [] a,int n){ - for(int i = 0; i < n-1 ; i++){ - for (int j = 0;j < n-1-i;j++){ - if(a[j] > a[j+1]){ - int temp = a[j]; - a[j] = a[j+1]; - a[j+1] = temp; - } - } - } -} \ No newline at end of file diff --git a/codes/oroyade/11207786.java b/codes/oroyade/11207786.java deleted file mode 100644 index b9bf7818d9ffdce1bf2bd0863a51890bffa3f951..0000000000000000000000000000000000000000 --- a/codes/oroyade/11207786.java +++ /dev/null @@ -1,11 +0,0 @@ -public static void bubbleSort(int [] a, int n) { - for (int i=0 ; ia[j+1]) { - int temp=a[j]; - a[j]=a[j+1]; - a[j+1]=temp; - } - } - } -} \ No newline at end of file diff --git a/codes/os1024/10038969.java b/codes/os1024/10038969.java deleted file mode 100644 index ddf126977df78e84c464e93955d733ea1d3239d3..0000000000000000000000000000000000000000 --- a/codes/os1024/10038969.java +++ /dev/null @@ -1,23 +0,0 @@ -/** - * 冒泡排序函数 - * aa bb cc - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - int i, j; - - for (i = n - 1; i > 0; i--) { - // 将a[0...i]中最大的数据放在末尾 - for (j = 0; j < i; j++) { - - if (a[j] > a[j + 1]) { - // 交换a[j]和a[j+1] - int tmp = a[j]; - a[j] = a[j + 1]; - a[j + 1] = tmp; - } - } - } - -} diff --git a/codes/outclass2/.keep b/codes/outclass2/.keep deleted file mode 100644 index e69de29bb2d1d6434b8b29ae775ad8c2e48c5391..0000000000000000000000000000000000000000 diff --git a/codes/outclass2/15815855.java b/codes/outclass2/15815855.java deleted file mode 100644 index 6e9861fa3ec6d5a2553cdccd1bb1e977430c671b..0000000000000000000000000000000000000000 --- a/codes/outclass2/15815855.java +++ /dev/null @@ -1,19 +0,0 @@ -/** - * 冒泡排序函数 - * aa bb cc - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - // 你的代码，使无序数组 a 变得有序 - for (int i = 0; i < n - 1; i++) { - for (int j = 0; j < n - i - 1; j++) { - if (a[j] > a[j + 1]) { - - int temp = a[j]; - a[j] = a[j + 1]; - a[j + 1] = temp; - } - } - } -} //end \ No newline at end of file diff --git a/codes/owccqq/11122165.java b/codes/owccqq/11122165.java deleted file mode 100644 index b9bf7818d9ffdce1bf2bd0863a51890bffa3f951..0000000000000000000000000000000000000000 --- a/codes/owccqq/11122165.java +++ /dev/null @@ -1,11 +0,0 @@ -public static void bubbleSort(int [] a, int n) { - for (int i=0 ; ia[j+1]) { - int temp=a[j]; - a[j]=a[j+1]; - a[j+1]=temp; - } - } - } -} \ No newline at end of file diff --git a/codes/oyeeyo/18379057.java b/codes/oyeeyo/18379057.java deleted file mode 100644 index c1922950ae106525d1ed03091e2ae293c049bb13..0000000000000000000000000000000000000000 --- a/codes/oyeeyo/18379057.java +++ /dev/null @@ -1,12 +0,0 @@ -public static void bubbleSort(int [] a, int n){ - // 你的代码，使无序数组 a 变得有序 - for(int i = 0; i < n; i++) { - for(int j = 0; j < n - i - 1; ++j) { - if(a[j] > a[j + 1]) { - int tmp = a[j]; - a[j] = a[j + 1]; - a[j + 1] = tmp; - } - } - } -} diff --git a/codes/oyoumq/11452053.java b/codes/oyoumq/11452053.java deleted file mode 100644 index cdabc2e0876ad629e41ff055727cf3af34be8917..0000000000000000000000000000000000000000 --- a/codes/oyoumq/11452053.java +++ /dev/null @@ -1,20 +0,0 @@ -/** - * 冒泡排序函数 - * aa bb cc - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - // 你的代码，使无序数组 a 变得有序 - for (int i = 0; i < n; i++) { - for (int j = i + 1; j < n; j++) { - if (a[i] > a[j]) { - int temp = a[j]; - a[j] = a[i]; - a[i] = temp; - - } - } - } - -} //end \ No newline at end of file diff --git a/codes/p13285288040/.keep b/codes/p13285288040/.keep deleted file mode 100644 index e69de29bb2d1d6434b8b29ae775ad8c2e48c5391..0000000000000000000000000000000000000000 diff --git a/codes/p13285288040/10972084.java b/codes/p13285288040/10972084.java deleted file mode 100644 index 9eccfac593dd84bb4c285d230d4de6b8c72a1d65..0000000000000000000000000000000000000000 --- a/codes/p13285288040/10972084.java +++ /dev/null @@ -1,11 +0,0 @@ -public static void bubbleSort(int [] a, int n) { - for (int i=0 ; ia[j+1]) { - int temp=a[j]; - a[j]=a[j+1]; - a[j+1]=temp; - } - } - } -} diff --git a/codes/p2948642664/15730688.java b/codes/p2948642664/15730688.java deleted file mode 100644 index bb5a808a30615e8da5bae9fedecedab071470ef1..0000000000000000000000000000000000000000 --- a/codes/p2948642664/15730688.java +++ /dev/null @@ -1,18 +0,0 @@ -/** - * 冒泡排序函数 - * 依次比较相邻的元素，如果它们的顺序错误就把它们交换过来 - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - for (int i = 0; i < n - 1; i++) { // 外层循环控制排序趟数 - for (int j = 0; j < n - 1 - i; j++) { // 内层循环控制每一趟排序多少次 - if (a[j] > a[j + 1]) { // 如果当前元素大于下一个元素，则交换它们的位置 - // 交换 a[j] 和 a[j+1] - int temp = a[j]; - a[j] = a[j + 1]; - a[j + 1] = temp; - } - } - } -} //end diff --git a/codes/passass/11299378.java b/codes/passass/11299378.java deleted file mode 100644 index 9e7534d4b41cf071c848fa4d5c08c6519526b6e3..0000000000000000000000000000000000000000 --- a/codes/passass/11299378.java +++ /dev/null @@ -1,18 +0,0 @@ -/** - * 冒泡 排序 函数 - * aa bb cc - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - // 你的代码，使无序数组 a 变得有序 - for (int i = 0; i < n; i++) { - for (int j = 0; j < i; j++) { - if (a[i] < a[j]) { - int t = a[i]; - a[i] = a[j]; - a[j] = t; - } - } - } -}//end \ No newline at end of file diff --git a/codes/patrol12/.keep b/codes/patrol12/.keep deleted file mode 100644 index e69de29bb2d1d6434b8b29ae775ad8c2e48c5391..0000000000000000000000000000000000000000 diff --git a/codes/patrol12/15845811.java b/codes/patrol12/15845811.java deleted file mode 100644 index 6e9861fa3ec6d5a2553cdccd1bb1e977430c671b..0000000000000000000000000000000000000000 --- a/codes/patrol12/15845811.java +++ /dev/null @@ -1,19 +0,0 @@ -/** - * 冒泡排序函数 - * aa bb cc - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - // 你的代码，使无序数组 a 变得有序 - for (int i = 0; i < n - 1; i++) { - for (int j = 0; j < n - i - 1; j++) { - if (a[j] > a[j + 1]) { - - int temp = a[j]; - a[j] = a[j + 1]; - a[j + 1] = temp; - } - } - } -} //end \ No newline at end of file diff --git a/codes/pcvvvc/11211727.java b/codes/pcvvvc/11211727.java deleted file mode 100644 index 272a12fc81d3dd0e857bba9ae001c15818fb7123..0000000000000000000000000000000000000000 --- a/codes/pcvvvc/11211727.java +++ /dev/null @@ -1,18 +0,0 @@ - /** - * 冒泡排序函数 - * aa bb cc - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ - public static void bubbleSort(int [] arr, int n){ - // 你的代码，使无序数组 a 变得有序 - for (int i = 0; i < n; i++) { - for (int j = (i + 1); j < n; j++) { - if (arr[i] > arr[j]) { - int temp = arr[i]; - arr[i] = arr[j]; - arr[j] = temp; - } - } - } - } //end \ No newline at end of file diff --git a/codes/pddpxx/15781110.java b/codes/pddpxx/15781110.java deleted file mode 100644 index 29a7b983a7d19a0a749a56e468d5bf7e96631813..0000000000000000000000000000000000000000 --- a/codes/pddpxx/15781110.java +++ /dev/null @@ -1,29 +0,0 @@ -/** - * 冒泡排序函数 - * 对数组a进行冒泡排序，使其变为有序数组 - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int[] a, int n) { - // 遍历所有数组元素 - for (int i = 0; i < n - 1; i++) { - // 假设数组已经有序，标志位 - boolean sorted = true; - // 最后i个元素已经有序，无需比较 - for (int j = 0; j < n - i - 1; j++) { - // 如果前一个元素大于后一个元素，则交换它们 - if (a[j] > a[j + 1]) { - // 交换a[j]和a[j+1] - int temp = a[j]; - a[j] = a[j + 1]; - a[j + 1] = temp; - // 发现了需要交换的元素，所以数组并非有序 - sorted = false; - } - } - // 如果在一次遍历中没有发生交换，则数组已经有序，可以提前结束 - if (sorted) { - break; - } - } -} //end diff --git a/codes/pears123/15846338.java b/codes/pears123/15846338.java deleted file mode 100644 index cac0dcf1e936c4d36670a0ef4f7462c7a3ed3e56..0000000000000000000000000000000000000000 --- a/codes/pears123/15846338.java +++ /dev/null @@ -1,28 +0,0 @@ -/** - * 冒泡排序函数 - * aa bb cc - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - if (n <= 1) return; // 如果数组长度小于等于1，不需要排序 - - boolean swapped; - for (int i = 0; i < n - 1; i++) { - swapped = false; - for (int j = 0; j < n - 1 - i; j++) { - if (a[j] > a[j + 1]) { - // 交换a[j]和a[j + 1] - int temp = a[j]; - a[j] = a[j + 1]; - a[j + 1] = temp; - swapped = true; - } - } - // 如果这一轮没有发生交换，说明数组已经有序，退出排序 - if (!swapped) { - break; - } - } -} //end - diff --git a/codes/penguin95/15774820.java b/codes/penguin95/15774820.java deleted file mode 100644 index 520e00a43bc4f16f37065c832ebb2af971aa7165..0000000000000000000000000000000000000000 --- a/codes/penguin95/15774820.java +++ /dev/null @@ -1,11 +0,0 @@ -public static void bubbleSort(int [] a, int n){ - for (int i = 0; i < n - 1; i++) { - for (int j = 0; j < n - i - 1; j++) { - if (a[j] > a[j + 1]) { - int temp = a[j]; - a[j] = a[j + 1]; - a[j + 1] = temp; - } - } - } -} diff --git a/codes/perscc/15846268.java b/codes/perscc/15846268.java deleted file mode 100644 index f31b91fc030bf062a1cdfe937e70090762cbfec7..0000000000000000000000000000000000000000 --- a/codes/perscc/15846268.java +++ /dev/null @@ -1,27 +0,0 @@ -/** - * 冒泡排序函数 - * 使用冒泡排序算法对数组进行升序排序 - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - for (int i = 0; i < n - 1; i++) { - // 标志位，表示这一趟排序是否有交换 - boolean swapped = false; - for (int j = 0; j < n - i - 1; j++) { - // 如果前一个元素大于后一个元素，则交换它们的位置 - if (a[j] > a[j + 1]) { - // 交换 a[j] 和 a[j+1] - int temp = a[j]; - a[j] = a[j + 1]; - a[j + 1] = temp; - // 表示这一趟排序有交换发生 - swapped = true; - } - } - // 如果这一趟没有交换发生，说明数组已经有序，可以提前结束排序 - if (!swapped) { - break; - } - } -} //end diff --git a/codes/philips/11302813.java b/codes/philips/11302813.java deleted file mode 100644 index 4d7083fe05ce3e6d3fadd59d6d55e2cbc50d546d..0000000000000000000000000000000000000000 --- a/codes/philips/11302813.java +++ /dev/null @@ -1,22 +0,0 @@ -/** - * 冒泡排序函数 - * aa bb cc - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - // 你的代码，使无序数组 a 变得有序 - int i, j; - - for(i=0; ia[j]){ - int temp; - temp = a[j-1]; - a[j-1] = a[j]; - a[j] = temp; - } - } - } - -} //end \ No newline at end of file diff --git a/codes/pictur/15653765.java b/codes/pictur/15653765.java deleted file mode 100644 index c2afaa2414da1853e4500b02c6de9068b64aeafe..0000000000000000000000000000000000000000 --- a/codes/pictur/15653765.java +++ /dev/null @@ -1,18 +0,0 @@ -/** - * 冒泡排序函数 - * aa bb cc - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - for(int i = 0; i < n-1 ; i++){ - for (int j = 0;j < n-1-i;j++){ - if(a[j] > a[j+1]){ - int temp = a[j]; - a[j] = a[j+1]; - a[j+1] = temp; - } - } - } - -} //end diff --git a/codes/plugin/11199950.java b/codes/plugin/11199950.java deleted file mode 100644 index 862a031b6f73aac6e6e6656df710e9caa439d4c0..0000000000000000000000000000000000000000 --- a/codes/plugin/11199950.java +++ /dev/null @@ -1,18 +0,0 @@ -/** - * 冒泡排序函数 - * aa bb cc - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - // 你的代码，使无序数组 a 变得有序 - for (int m=0 ; ma[q+1]) { - int temp=a[q]; - a[q]=a[q+1]; - a[q+1]=temp; - } - } - } -} //end \ No newline at end of file diff --git a/codes/plustub/11244425.java b/codes/plustub/11244425.java deleted file mode 100644 index 191de91d18bdb330ab1609aaa3b20eeb19226481..0000000000000000000000000000000000000000 --- a/codes/plustub/11244425.java +++ /dev/null @@ -1,11 +0,0 @@ - public static void bubbleSort(int[] a, int n) { - for (int i = 0; i < a.length - 1; i++) { - for (int j = 0; j < a.length - 1 - i; j++) { - if (a[j] > a[j + 1]) { - int temp = a[j + 1]; - a[j + 1] = a[j]; - a[j] = temp; - } - } - } - } \ No newline at end of file diff --git a/codes/polodybala/.18365371.java.swp b/codes/polodybala/.18365371.java.swp deleted file mode 100644 index bbdce5a9769257d7d34625f0bf524063e882d22f..0000000000000000000000000000000000000000 Binary files a/codes/polodybala/.18365371.java.swp and /dev/null differ diff --git a/codes/polodybala/18365371.java b/codes/polodybala/18365371.java deleted file mode 100644 index 8b770d975f5a441fb5743902acb0ccc493ece1b0..0000000000000000000000000000000000000000 --- a/codes/polodybala/18365371.java +++ /dev/null @@ -1,33 +0,0 @@ -/** - * 冒泡排序函数 - * 对数组进行从小到大的排序 - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int[] a, int n) { - // 外层循环控制遍历的次数 - for (int i = 0; i < n - 1; i++) { - // 提前退出标志位，如果本次没有交换，说明已经有序 - boolean swapped = false; - - // 内层循环进行两两比较 - for (int j = 0; j < n - 1 - i; j++) { - // 如果前一个数大于后一个数，则交换 - if (a[j] > a[j + 1]) { - // 交换 a[j] 和 a[j + 1] - int temp = a[j]; - a[j] = a[j + 1]; - a[j + 1] = temp; - - // 标记有交换 - swapped = true; - } - } - - // 如果没有发生交换，说明数组已经是有序的，提前结束循环 - if (!swapped) { - break; - } - } -} //end - diff --git a/codes/pondfish/15535613.java b/codes/pondfish/15535613.java deleted file mode 100644 index c2afaa2414da1853e4500b02c6de9068b64aeafe..0000000000000000000000000000000000000000 --- a/codes/pondfish/15535613.java +++ /dev/null @@ -1,18 +0,0 @@ -/** - * 冒泡排序函数 - * aa bb cc - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - for(int i = 0; i < n-1 ; i++){ - for (int j = 0;j < n-1-i;j++){ - if(a[j] > a[j+1]){ - int temp = a[j]; - a[j] = a[j+1]; - a[j+1] = temp; - } - } - } - -} //end diff --git a/codes/ppdplius/11212528.java b/codes/ppdplius/11212528.java deleted file mode 100644 index cdabc2e0876ad629e41ff055727cf3af34be8917..0000000000000000000000000000000000000000 --- a/codes/ppdplius/11212528.java +++ /dev/null @@ -1,20 +0,0 @@ -/** - * 冒泡排序函数 - * aa bb cc - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - // 你的代码，使无序数组 a 变得有序 - for (int i = 0; i < n; i++) { - for (int j = i + 1; j < n; j++) { - if (a[i] > a[j]) { - int temp = a[j]; - a[j] = a[i]; - a[i] = temp; - - } - } - } - -} //end \ No newline at end of file diff --git a/codes/pper2024/15867590.java b/codes/pper2024/15867590.java deleted file mode 100644 index 24f513b3219ac31ac3dcffe774647aa7bfdac254..0000000000000000000000000000000000000000 --- a/codes/pper2024/15867590.java +++ /dev/null @@ -1,11 +0,0 @@ -public static void bubbleSort(int [] a, int n){ - for (int i = 0; i < n - 1; i++) { - for (int j = 0; j < n - 1 - i; j++) { - if (a[j] > a[j + 1]) { - int temp = a[j]; - a[j] = a[j + 1]; - a[j + 1] = temp; - } - } - } -} diff --git a/codes/pplac2/.keep b/codes/pplac2/.keep deleted file mode 100644 index e69de29bb2d1d6434b8b29ae775ad8c2e48c5391..0000000000000000000000000000000000000000 diff --git a/codes/pplac2/15814992.java b/codes/pplac2/15814992.java deleted file mode 100644 index 6e9861fa3ec6d5a2553cdccd1bb1e977430c671b..0000000000000000000000000000000000000000 --- a/codes/pplac2/15814992.java +++ /dev/null @@ -1,19 +0,0 @@ -/** - * 冒泡排序函数 - * aa bb cc - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - // 你的代码，使无序数组 a 变得有序 - for (int i = 0; i < n - 1; i++) { - for (int j = 0; j < n - i - 1; j++) { - if (a[j] > a[j + 1]) { - - int temp = a[j]; - a[j] = a[j + 1]; - a[j + 1] = temp; - } - } - } -} //end \ No newline at end of file diff --git a/codes/pppp0000/15840340.java b/codes/pppp0000/15840340.java deleted file mode 100644 index 24f513b3219ac31ac3dcffe774647aa7bfdac254..0000000000000000000000000000000000000000 --- a/codes/pppp0000/15840340.java +++ /dev/null @@ -1,11 +0,0 @@ -public static void bubbleSort(int [] a, int n){ - for (int i = 0; i < n - 1; i++) { - for (int j = 0; j < n - 1 - i; j++) { - if (a[j] > a[j + 1]) { - int temp = a[j]; - a[j] = a[j + 1]; - a[j + 1] = temp; - } - } - } -} diff --git a/codes/progle/17034577.java b/codes/progle/17034577.java deleted file mode 100644 index b2047e969cba60c27f4f2a530fce6c8a7124034b..0000000000000000000000000000000000000000 --- a/codes/progle/17034577.java +++ /dev/null @@ -1,22 +0,0 @@ -/** - * 冒泡排序函数 - * 对传入的数组进行排序，使得数组中的元素按照升序排列 - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - // 外层循环控制排序的总轮数，每轮排序后最大的元素会冒泡到它应该在的位置 - for (int i = 0; i < n - 1; i++) { - // 内层循环进行每轮的元素比较和交换 - for (int j = 0; j < n - 1 - i; j++) { - // 如果当前元素大于下一个元素，则交换它们 - if (a[j] > a[j + 1]) { - // 交换 a[j] 和 a[j + 1] - int temp = a[j]; - a[j] = a[j + 1]; - a[j + 1] = temp; - } - } - } - // 排序完成，无需返回值，因为数组 a 已经被原地修改 -} //end diff --git a/codes/promse/11152350.java b/codes/promse/11152350.java deleted file mode 100644 index b9bf7818d9ffdce1bf2bd0863a51890bffa3f951..0000000000000000000000000000000000000000 --- a/codes/promse/11152350.java +++ /dev/null @@ -1,11 +0,0 @@ -public static void bubbleSort(int [] a, int n) { - for (int i=0 ; ia[j+1]) { - int temp=a[j]; - a[j]=a[j+1]; - a[j+1]=temp; - } - } - } -} \ No newline at end of file diff --git a/codes/publicstringms/.keep b/codes/publicstringms/.keep deleted file mode 100644 index e69de29bb2d1d6434b8b29ae775ad8c2e48c5391..0000000000000000000000000000000000000000 diff --git a/codes/publicstringms/15844875.java b/codes/publicstringms/15844875.java deleted file mode 100644 index 6e9861fa3ec6d5a2553cdccd1bb1e977430c671b..0000000000000000000000000000000000000000 --- a/codes/publicstringms/15844875.java +++ /dev/null @@ -1,19 +0,0 @@ -/** - * 冒泡排序函数 - * aa bb cc - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - // 你的代码，使无序数组 a 变得有序 - for (int i = 0; i < n - 1; i++) { - for (int j = 0; j < n - i - 1; j++) { - if (a[j] > a[j + 1]) { - - int temp = a[j]; - a[j] = a[j + 1]; - a[j + 1] = temp; - } - } - } -} //end \ No newline at end of file diff --git a/codes/pui9001/11232878.java b/codes/pui9001/11232878.java deleted file mode 100644 index deb2438785c696d09e985c35997c2f2bc5445a90..0000000000000000000000000000000000000000 --- a/codes/pui9001/11232878.java +++ /dev/null @@ -1,18 +0,0 @@ -/** - * 冒泡排序函数 - * aa bb cc - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - // 你的代码，使无序数组 a 变得有序 - for (int i=0 ; ia[k+1]) { - int temp=a[k]; - a[k]=a[k+1]; - a[k+1]=temp; - } - } - } -} //end \ No newline at end of file diff --git a/codes/pumpkin/15658869.java b/codes/pumpkin/15658869.java deleted file mode 100644 index 2571c1de5aa50b72ed9f3720cfb0d5463b9bbfa5..0000000000000000000000000000000000000000 --- a/codes/pumpkin/15658869.java +++ /dev/null @@ -1,19 +0,0 @@ -/** - * 冒泡排序函数 - * 通过重复地遍历要排序的数列，一次比较两个元素，如果他们的顺序错误就把他们交换过来。 - * 遍历数列的工作是重复地进行直到没有再需要交换，也就是说该数列已经排序完成。 - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int[] a, int n) { - for (int i = 0; i < n - 1; i++) { // 外层循环控制所有趟排序 - for (int j = 0; j < n - i - 1; j++) { // 内层循环控制每一趟排序多少次 - if (a[j] > a[j + 1]) { // 如果前一个元素大于后一个元素，则交换它们 - // 交换 a[j] 和 a[j+1] - int temp = a[j]; - a[j] = a[j + 1]; - a[j + 1] = temp; - } - } - } -} // end diff --git a/codes/puzzle/15806930.java b/codes/puzzle/15806930.java deleted file mode 100644 index 24f513b3219ac31ac3dcffe774647aa7bfdac254..0000000000000000000000000000000000000000 --- a/codes/puzzle/15806930.java +++ /dev/null @@ -1,11 +0,0 @@ -public static void bubbleSort(int [] a, int n){ - for (int i = 0; i < n - 1; i++) { - for (int j = 0; j < n - 1 - i; j++) { - if (a[j] > a[j + 1]) { - int temp = a[j]; - a[j] = a[j + 1]; - a[j + 1] = temp; - } - } - } -} diff --git a/codes/pyqyzjznbw1/.15782703.java.swp b/codes/pyqyzjznbw1/.15782703.java.swp deleted file mode 100644 index 5cedd8292c4b3a074c5ec3730e69da803c942d96..0000000000000000000000000000000000000000 Binary files a/codes/pyqyzjznbw1/.15782703.java.swp and /dev/null differ diff --git a/codes/pyqyzjznbw1/15782703,java b/codes/pyqyzjznbw1/15782703,java deleted file mode 100644 index 065a9b16f26ec75a423c111cf0596004b2623d8d..0000000000000000000000000000000000000000 --- a/codes/pyqyzjznbw1/15782703,java +++ /dev/null @@ -1,17 +0,0 @@ -/** - * 冒泡排序函数 - * 依次比较相邻的两个数，将较大的数移到后面，较小的数移到前面 - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int[] a, int n) { - for (int i = 0; i < n - 1; i++) { // 外层循环，控制所有元素遍历的次数 - for (int j = 0; j < n - i - 1; j++) { // 内层循环，从前往后依次比较相邻的两个元素 - if (a[j] > a[j + 1]) { // 如果前面的数比后面的数大，则交换它们的位置 - int temp = a[j]; - a[j] = a[j + 1]; - a[j + 1] = temp; - } - } - } -} //end diff --git a/codes/pyqyzjznbw1/15782703.java b/codes/pyqyzjznbw1/15782703.java deleted file mode 100644 index 98db56b2072226f09fd746cfbe50fc54a766aa29..0000000000000000000000000000000000000000 --- a/codes/pyqyzjznbw1/15782703.java +++ /dev/null @@ -1,17 +0,0 @@ -/** - * 冒泡排序函数 - * 依次比较相邻的两个数，将较大的数移到后面，较小的数移到前面 - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int[] a, int n) { - for (int i = 0; i < n - 1; i++) { // 外层循环，控制所有元素遍历的次数 - for (int j = 0; j < n - i - 1; j++) { // 内层循环，从前往后依次比较相邻的两个元素 - if (a[j] > a[j + 1]) { // 如果前面的数比后面的数大，则交换它们的位置 - int temp = a[j]; - a[j] = a[j + 1]; - a[j + 1] = temp; - } - } - } -} //enD diff --git a/codes/pysunlightse/.keep b/codes/pysunlightse/.keep deleted file mode 100644 index e69de29bb2d1d6434b8b29ae775ad8c2e48c5391..0000000000000000000000000000000000000000 diff --git a/codes/pysunlightse/15846452.java b/codes/pysunlightse/15846452.java deleted file mode 100644 index 6e9861fa3ec6d5a2553cdccd1bb1e977430c671b..0000000000000000000000000000000000000000 --- a/codes/pysunlightse/15846452.java +++ /dev/null @@ -1,19 +0,0 @@ -/** - * 冒泡排序函数 - * aa bb cc - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - // 你的代码，使无序数组 a 变得有序 - for (int i = 0; i < n - 1; i++) { - for (int j = 0; j < n - i - 1; j++) { - if (a[j] > a[j + 1]) { - - int temp = a[j]; - a[j] = a[j + 1]; - a[j + 1] = temp; - } - } - } -} //end \ No newline at end of file diff --git a/codes/pzzzzzzzzz/.keep b/codes/pzzzzzzzzz/.keep deleted file mode 100644 index e69de29bb2d1d6434b8b29ae775ad8c2e48c5391..0000000000000000000000000000000000000000 diff --git a/codes/pzzzzzzzzz/15778160.java b/codes/pzzzzzzzzz/15778160.java deleted file mode 100644 index 667eee0f585ec38ce639cb36d80df080e935946d..0000000000000000000000000000000000000000 --- a/codes/pzzzzzzzzz/15778160.java +++ /dev/null @@ -1,11 +0,0 @@ -public static void bubbleSort(int [] a,int n){ - for(int i = 0; i < n-1 ; i++){ - for (int j = 0;j < n-1-i;j++){ - if(a[j] > a[j+1]){ - int temp = a[j]; - a[j] = a[j+1]; - a[j+1] = temp; - } - } - } -} \ No newline at end of file diff --git a/codes/q1229173945/15755759.java b/codes/q1229173945/15755759.java deleted file mode 100644 index d18a9e37b6597397e15055f4b8171b58e2e97989..0000000000000000000000000000000000000000 --- a/codes/q1229173945/15755759.java +++ /dev/null @@ -1,18 +0,0 @@ -/** - * 冒泡排序函数 - * 冒泡排序是一种简单的排序算法，它重复地遍历要排序的数列，一次比较两个元素，如果他们的顺序错误就把他们交换过来。 - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - for (int i = 0; i < n - 1; i++) { - for (int j = 0; j < n - 1 - i; j++) { - // 如果前一个元素大于后一个元素，则交换它们的位置 - if (a[j] > a[j + 1]) { - int temp = a[j]; - a[j] = a[j + 1]; - a[j + 1] = temp; - } - } - } -} diff --git a/codes/q225692/15860954.java b/codes/q225692/15860954.java deleted file mode 100644 index 54c5f3869cd16ee9e7c2b77895a39fae63f05dbc..0000000000000000000000000000000000000000 --- a/codes/q225692/15860954.java +++ /dev/null @@ -1,20 +0,0 @@ -/** - * 冒泡排序函数 - * aa bb cc - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - // 你的代码，使无序数组 a 变得有序 - for(int i = 0; i < n; i++) { - for(int liuy = 0; liuy < n - i - 1; liuy++) { - if(a[liuy] > a[liuy + 1]) { - int temp = a[liuy]; - a [liuy] = a[liuy + 1]; - a[liuy + 1] = temp; - } - } - } - - -} //end,liuy \ No newline at end of file diff --git a/codes/q6666666868/11202065.java b/codes/q6666666868/11202065.java deleted file mode 100644 index 9e7534d4b41cf071c848fa4d5c08c6519526b6e3..0000000000000000000000000000000000000000 --- a/codes/q6666666868/11202065.java +++ /dev/null @@ -1,18 +0,0 @@ -/** - * 冒泡 排序 函数 - * aa bb cc - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - // 你的代码，使无序数组 a 变得有序 - for (int i = 0; i < n; i++) { - for (int j = 0; j < i; j++) { - if (a[i] < a[j]) { - int t = a[i]; - a[i] = a[j]; - a[j] = t; - } - } - } -}//end \ No newline at end of file diff --git a/codes/qaz123qaz/15859565 b/codes/qaz123qaz/15859565 deleted file mode 100644 index 987377810b5beca8eb4bf5eafeee5db45e234a87..0000000000000000000000000000000000000000 --- a/codes/qaz123qaz/15859565 +++ /dev/null @@ -1,20 +0,0 @@ -/** - * 冒泡排序函数 - * aa bb cc - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - // 你的代码，使无序数组 a 变得有序 - for(int i = 0; i < n; i++) { - for(int liuy = 0; liuy < n - i - 1; liuy++) { - if(a[liuy] > a[liuy + 1]) { - int temp = a[liuy]; - a [liuy] = a[liuy + 1]; - a[liuy + 1] = temp; - } - } - } - - -} //end,liuy diff --git a/codes/qaz123qaz/15859565.java b/codes/qaz123qaz/15859565.java deleted file mode 100644 index 987377810b5beca8eb4bf5eafeee5db45e234a87..0000000000000000000000000000000000000000 --- a/codes/qaz123qaz/15859565.java +++ /dev/null @@ -1,20 +0,0 @@ -/** - * 冒泡排序函数 - * aa bb cc - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - // 你的代码，使无序数组 a 变得有序 - for(int i = 0; i < n; i++) { - for(int liuy = 0; liuy < n - i - 1; liuy++) { - if(a[liuy] > a[liuy + 1]) { - int temp = a[liuy]; - a [liuy] = a[liuy + 1]; - a[liuy + 1] = temp; - } - } - } - - -} //end,liuy diff --git a/codes/qazwsx061jk/15838272.java b/codes/qazwsx061jk/15838272.java deleted file mode 100644 index 24f513b3219ac31ac3dcffe774647aa7bfdac254..0000000000000000000000000000000000000000 --- a/codes/qazwsx061jk/15838272.java +++ /dev/null @@ -1,11 +0,0 @@ -public static void bubbleSort(int [] a, int n){ - for (int i = 0; i < n - 1; i++) { - for (int j = 0; j < n - 1 - i; j++) { - if (a[j] > a[j + 1]) { - int temp = a[j]; - a[j] = a[j + 1]; - a[j + 1] = temp; - } - } - } -} diff --git a/codes/qianshi/13339610.java b/codes/qianshi/13339610.java deleted file mode 100644 index 03527ec51557b75d2620ae5963c4a0415fefbedd..0000000000000000000000000000000000000000 --- a/codes/qianshi/13339610.java +++ /dev/null @@ -1,17 +0,0 @@ -/** - * 冒泡排序函数 - * aa bb cc - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int[] a, int n) { - for (int i = 0; i < n - 1; i++) { - for (int j = 0; j < n - 1 - i; j++) { - if (a[j] > a[j + 1]) { - int temp = a[j]; - a[j] = a[j + 1]; - a[j + 1] = temp; - } - } - } -} // end \ No newline at end of file diff --git a/codes/qianxiaxingkong/11737212.java b/codes/qianxiaxingkong/11737212.java deleted file mode 100644 index adf2deb6624f6dd0dc6003418c7b47e1ccd8bcab..0000000000000000000000000000000000000000 --- a/codes/qianxiaxingkong/11737212.java +++ /dev/null @@ -1,21 +0,0 @@ -/** - * 冒泡排序函数 - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int[] a, int n) { - // 外层循环控制排序轮数 - for (int i = 0; i < n - 1; i++) { - // 内层循环控制每轮排序的次数 - for (int j = 0; j < n - i - 1; j++) { - // 比较相邻两个元素的大小，如果前一个元素大于后一个元素，则交换它们的位置 - if (a[j] > a[j + 1]) { - int temp = a[j]; - a[j] = a[j + 1]; - a[j + 1] = temp; - } - } - } -} - - diff --git a/codes/qianyege/.keep b/codes/qianyege/.keep deleted file mode 100644 index e69de29bb2d1d6434b8b29ae775ad8c2e48c5391..0000000000000000000000000000000000000000 diff --git a/codes/qianyege/15846025.java b/codes/qianyege/15846025.java deleted file mode 100644 index 6426772fb479b07ed3be21ef1867921d1dbb194c..0000000000000000000000000000000000000000 --- a/codes/qianyege/15846025.java +++ /dev/null @@ -1,20 +0,0 @@ -/** - * 冒泡排序函数 - * aa bb cc - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - // 你的代码，使无序数组 a 变得有序 - for(int i = 0; i < n; i++) { - for(int j = 0; j < n - i - 1; j++) { - if(a[j] > a[j + 1]) { - int temp = a[j]; - a [j] = a[j + 1]; - a[j + 1] = temp; - } - } - } - - -} //end \ No newline at end of file diff --git a/codes/qichang0921/15671954.java b/codes/qichang0921/15671954.java deleted file mode 100644 index e19af71f108d7db632940367ec2223352b2c268c..0000000000000000000000000000000000000000 --- a/codes/qichang0921/15671954.java +++ /dev/null @@ -1,23 +0,0 @@ -/** - * 冒泡排序函数 - * 通过重复遍历待排序的数组，比较相邻的元素并交换它们（如果它们在错误的顺序）， - * 直到没有更多的交换需要，即该数组已经排序。 - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int[] a, int n) { - for (int i = 0; i < n - 1; i++) { // 外层循环控制排序的趟数 - boolean swapped = false; // 用于标记某一趟是否发生了交换 - for (int j = 0; j < n - i - 1; j++) { // 内层循环控制每一趟排序多少次 - if (a[j] > a[j + 1]) { // 如果前一个元素大于后一个元素，则交换它们 - int temp = a[j]; - a[j] = a[j + 1]; - a[j + 1] = temp; - swapped = true; // 标记发生了交换 - } - } - if (!swapped) { // 如果某一趟没有发生交换，说明数组已经有序，可以提前退出 - break; - } - } -} // end diff --git a/codes/qierbao/15832037.java b/codes/qierbao/15832037.java deleted file mode 100644 index abc13ab49e5c3c5d96d813e124fd6d5bafbd33d0..0000000000000000000000000000000000000000 --- a/codes/qierbao/15832037.java +++ /dev/null @@ -1,22 +0,0 @@ -/** - * 冒泡排序函数 - * 该函数通过冒泡排序算法将输入的数组按照升序排列 - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - // 外层循环控制排序的轮数 - for (int i = 0; i < n - 1; i++) { - // 内层循环控制每轮的比较次数 - for (int j = 0; j < n - 1 - i; j++) { - // 如果前一个元素大于后一个元素，则交换它们的位置 - if (a[j] > a[j + 1]) { - int temp = a[j]; - a[j] = a[j + 1]; - a[j + 1] = temp; - } - } - } -} //end - - diff --git a/codes/qigela/.keep b/codes/qigela/.keep deleted file mode 100644 index e69de29bb2d1d6434b8b29ae775ad8c2e48c5391..0000000000000000000000000000000000000000 diff --git a/codes/qigela/15757052.java b/codes/qigela/15757052.java deleted file mode 100644 index 6426772fb479b07ed3be21ef1867921d1dbb194c..0000000000000000000000000000000000000000 --- a/codes/qigela/15757052.java +++ /dev/null @@ -1,20 +0,0 @@ -/** - * 冒泡排序函数 - * aa bb cc - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - // 你的代码，使无序数组 a 变得有序 - for(int i = 0; i < n; i++) { - for(int j = 0; j < n - i - 1; j++) { - if(a[j] > a[j + 1]) { - int temp = a[j]; - a [j] = a[j + 1]; - a[j + 1] = temp; - } - } - } - - -} //end \ No newline at end of file diff --git a/codes/qihuan/15568203.java b/codes/qihuan/15568203.java deleted file mode 100644 index ac777e0f6e97b292b44a342bd96e492821d3bcf0..0000000000000000000000000000000000000000 --- a/codes/qihuan/15568203.java +++ /dev/null @@ -1,21 +0,0 @@ -/** - * 冒泡排序函数 - * 功能：对输入的整数数组进行升序排序 - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - // 外层循环控制所有元素是否已排序 - for (int i = 0; i < n - 1; i++) { - // 内层循环负责两两相邻元素比较，并根据大小交换位置 - for (int j = 0; j < n - 1 - i; j++) { - // 如果前一个元素大于后一个元素，则交换它们的位置 - if (a[j] > a[j + 1]) { - // 交换 a[j] 和 a[j+1] - int temp = a[j]; - a[j] = a[j + 1]; - a[j + 1] = temp; - } - } - } -} // end diff --git a/codes/qingfeng/15541061.java b/codes/qingfeng/15541061.java deleted file mode 100644 index ecf81b2384b0ce0e49ba9161c4de669ecfab4499..0000000000000000000000000000000000000000 --- a/codes/qingfeng/15541061.java +++ /dev/null @@ -1,20 +0,0 @@ -/** - * 冒泡排序函数 - * aa bb cc - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - // 你的代码，使无序数组 a 变得有序 - for(int i = 0; i < n; i++) { - for(int j = 0; j < n - i - 1; j++) { - if(a[j] > a[j + 1]) { - int temp = a[j]; - a [j] = a[j + 1]; - a[j + 1] = temp; - } - } - } - - -} //end diff --git a/codes/qingkouwei/15823415.java b/codes/qingkouwei/15823415.java deleted file mode 100644 index 243a1d6677168c86ca0ce863a865ee192eb1a667..0000000000000000000000000000000000000000 --- a/codes/qingkouwei/15823415.java +++ /dev/null @@ -1,18 +0,0 @@ -/** - * 冒泡排序函数 - * 通过比较相邻的元素，如果前一个元素比后一个元素大，则交换它们的位置，直到整个数组有序。 - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - for (int i = 0; i < n - 1; i++) { - for (int j = 0; j < n - i - 1; j++) { - if (a[j] > a[j + 1]) { - // 交换 a[j] 和 a[j + 1] - int temp = a[j]; - a[j] = a[j + 1]; - a[j + 1] = temp; - } - } - } -} //end diff --git a/codes/qingqingjiang/15876459.java b/codes/qingqingjiang/15876459.java deleted file mode 100644 index 2bfcb318993a8077be6c715bcbf267477ea2f7f4..0000000000000000000000000000000000000000 --- a/codes/qingqingjiang/15876459.java +++ /dev/null @@ -1,18 +0,0 @@ -/** - * 冒泡排序函数 - * 通过多次遍历数组，比较相邻元素并交换，实现数组的升序排序 - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - for (int i = 0; i < n - 1; i++) { - for (int j = 0; j < n - 1 - i; j++) { - if (a[j] > a[j + 1]) { - // 交换 a[j] 和 a[j+1] - int temp = a[j]; - a[j] = a[j + 1]; - a[j + 1] = temp; - } - } - } -} //end diff --git a/codes/qingyunzhishang/15861715.java b/codes/qingyunzhishang/15861715.java deleted file mode 100644 index 14984b85ffa2111df883df4858ac150a950766e3..0000000000000000000000000000000000000000 --- a/codes/qingyunzhishang/15861715.java +++ /dev/null @@ -1,26 +0,0 @@ -/** - * 冒泡排序函数 - * 通过多次遍历数组，每次比较相邻元素并交换位置，使得较大的元素逐渐“浮”到数组的末尾。 - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - for (int i = 0; i < n - 1; i++) { - // 每一轮排序的标记，用于判断是否有交换发生 - boolean swapped = false; - for (int j = 0; j < n - i - 1; j++) { - // 如果当前元素大于下一个元素，则交换它们的位置 - if (a[j] > a[j + 1]) { - int temp = a[j]; - a[j] = a[j + 1]; - a[j + 1] = temp; - // 标记有交换发生 - swapped = true; - } - } - // 如果这一轮没有发生交换，说明数组已经有序，直接退出循环 - if (!swapped) { - break; - } - } -} //end diff --git a/codes/qiqixiongdi/.keep b/codes/qiqixiongdi/.keep deleted file mode 100644 index e69de29bb2d1d6434b8b29ae775ad8c2e48c5391..0000000000000000000000000000000000000000 diff --git a/codes/qiqixiongdi/15846620.java b/codes/qiqixiongdi/15846620.java deleted file mode 100644 index 6426772fb479b07ed3be21ef1867921d1dbb194c..0000000000000000000000000000000000000000 --- a/codes/qiqixiongdi/15846620.java +++ /dev/null @@ -1,20 +0,0 @@ -/** - * 冒泡排序函数 - * aa bb cc - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - // 你的代码，使无序数组 a 变得有序 - for(int i = 0; i < n; i++) { - for(int j = 0; j < n - i - 1; j++) { - if(a[j] > a[j + 1]) { - int temp = a[j]; - a [j] = a[j + 1]; - a[j + 1] = temp; - } - } - } - - -} //end \ No newline at end of file diff --git a/codes/qiu040905/.15783626.java.swo b/codes/qiu040905/.15783626.java.swo deleted file mode 100644 index 8497d30f8d6815c0cea349b29efd32f9d8330fb9..0000000000000000000000000000000000000000 Binary files a/codes/qiu040905/.15783626.java.swo and /dev/null differ diff --git a/codes/qiu040905/.15783626.java.swp b/codes/qiu040905/.15783626.java.swp deleted file mode 100644 index 2ebab4ccbc79effd936a0f4ffafcb5e4de48d6ab..0000000000000000000000000000000000000000 Binary files a/codes/qiu040905/.15783626.java.swp and /dev/null differ diff --git a/codes/qiu040905/15783626.java b/codes/qiu040905/15783626.java deleted file mode 100644 index 6efaef95835066f0a1680785c63755ba0251a853..0000000000000000000000000000000000000000 --- a/codes/qiu040905/15783626.java +++ /dev/null @@ -1,20 +0,0 @@ -/** - * 冒泡排序函数 - * aa bb cc - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int[] a, int n) { - // 你的代码，使无序数组 a 变得有序 - for (int i = 0; i < n - 1; i++) { - for (int j = 0; j < n - 1 - i; j++) { - if (a[j] > a[j + 1]) { - // 交换 a[j] 和 a[j + 1] - int temp = a[j]; - a[j] = a[j + 1]; - a[j + 1] = temp; - } - } - } -} //end - diff --git a/codes/qiuwenjie/.keep b/codes/qiuwenjie/.keep deleted file mode 100644 index e69de29bb2d1d6434b8b29ae775ad8c2e48c5391..0000000000000000000000000000000000000000 diff --git a/codes/qiuwenjie/15846265.java b/codes/qiuwenjie/15846265.java deleted file mode 100644 index 6426772fb479b07ed3be21ef1867921d1dbb194c..0000000000000000000000000000000000000000 --- a/codes/qiuwenjie/15846265.java +++ /dev/null @@ -1,20 +0,0 @@ -/** - * 冒泡排序函数 - * aa bb cc - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - // 你的代码，使无序数组 a 变得有序 - for(int i = 0; i < n; i++) { - for(int j = 0; j < n - i - 1; j++) { - if(a[j] > a[j + 1]) { - int temp = a[j]; - a [j] = a[j + 1]; - a[j + 1] = temp; - } - } - } - - -} //end \ No newline at end of file diff --git a/codes/qixiaobao/15829693.java b/codes/qixiaobao/15829693.java deleted file mode 100644 index df41992f184e660ba7aae896515ab6b0dc0c192d..0000000000000000000000000000000000000000 --- a/codes/qixiaobao/15829693.java +++ /dev/null @@ -1,21 +0,0 @@ -/** - * 冒泡排序函数 - * 该函数通过冒泡排序算法将输入的数组按照升序排列 - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - // 外层循环控制排序的轮数 - for (int i = 0; i < n - 1; i++) { - // 内层循环控制每轮的比较次数 - for (int j = 0; j < n - 1 - i; j++) { - // 如果前一个元素大于后一个元素，则交换它们的位置 - if (a[j] > a[j + 1]) { - int temp = a[j]; - a[j] = a[j + 1]; - a[j + 1] = temp; - } - } - } -} //end - diff --git a/codes/qjpdjk578/15514740.java b/codes/qjpdjk578/15514740.java deleted file mode 100644 index 4dd34424096923bb2ea92237e532df3550527ca7..0000000000000000000000000000000000000000 --- a/codes/qjpdjk578/15514740.java +++ /dev/null @@ -1,26 +0,0 @@ -/** - * 冒泡排序函数 - * aa bb cc - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - if (n <= 1) { - return; // 如果数组长度小于等于1，则不需要排序 - } - - for (int i = 0; i < n; ++i) { - // 提前退出冒泡循环的标志位 - boolean flag = false; - for (int j = 0; j < n - i - 1; ++j) { - // 相邻元素两两对比，如果顺序不符合要求，就调整位置 - if (a[j] > a[j + 1]) { - int temp = a[j]; - a[j] = a[j + 1]; - a[j + 1] = temp; - flag = true; // 表示有数据交换 - } - } - if (!flag) break; // 没有数据交换，提前退出 - } -} //end diff --git a/codes/qq13189019228/15808396.java b/codes/qq13189019228/15808396.java deleted file mode 100644 index 166dea5db31166b381f11f50cf27b5f36311847d..0000000000000000000000000000000000000000 --- a/codes/qq13189019228/15808396.java +++ /dev/null @@ -1,19 +0,0 @@ -/** - * 冒泡排序函数 - * 该函数通过冒泡排序算法对数组进行排序 - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int[] a, int n) { - for (int i = 0; i < n - 1; i++) { // 外层循环控制比较轮数 - for (int j = 0; j < n - 1 - i; j++) { // 内层循环控制每轮的比较次数 - // 如果前一个元素大于后一个元素，则交换它们的位置 - if (a[j] > a[j + 1]) { - // 交换元素 - int temp = a[j]; - a[j] = a[j + 1]; - a[j + 1] = temp; - } - } - } -} //end diff --git a/codes/qq2121809344/15831326.java b/codes/qq2121809344/15831326.java deleted file mode 100644 index 0c4c26a92f9df49831fc4d780c72fddc49cfc6d3..0000000000000000000000000000000000000000 --- a/codes/qq2121809344/15831326.java +++ /dev/null @@ -1,11 +0,0 @@ -public static void bubbleSort(int[]a,int n){ - for(int i=0;ia[j+1]){ - int temp=a[j]; - a[j]=a[j+1]; - a[j+1]=temp; - } - } - } -} diff --git a/codes/qq753755635/15717531.java b/codes/qq753755635/15717531.java deleted file mode 100644 index 45a9d6a25b7c1209865c364661c1425ed9ae889d..0000000000000000000000000000000000000000 --- a/codes/qq753755635/15717531.java +++ /dev/null @@ -1,18 +0,0 @@ -/** - * 冒泡排序函数 - * 功能：对给定的整数数组进行冒泡排序 - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - for (int i = 0; i < n - 1; i++) { - for (int j = 0; j < n - i - 1; j++) { - // 如果前一个元素大于后一个元素，则交换它们的位置 - if (a[j] > a[j + 1]) { - int temp = a[j]; - a[j] = a[j + 1]; - a[j + 1] = temp; - } - } - } -} //end diff --git a/codes/qqyy123/15845835.java b/codes/qqyy123/15845835.java deleted file mode 100644 index 987377810b5beca8eb4bf5eafeee5db45e234a87..0000000000000000000000000000000000000000 --- a/codes/qqyy123/15845835.java +++ /dev/null @@ -1,20 +0,0 @@ -/** - * 冒泡排序函数 - * aa bb cc - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - // 你的代码，使无序数组 a 变得有序 - for(int i = 0; i < n; i++) { - for(int liuy = 0; liuy < n - i - 1; liuy++) { - if(a[liuy] > a[liuy + 1]) { - int temp = a[liuy]; - a [liuy] = a[liuy + 1]; - a[liuy + 1] = temp; - } - } - } - - -} //end,liuy diff --git a/codes/qsh123/15845262.java b/codes/qsh123/15845262.java deleted file mode 100644 index ac65fbb175ed7b1ca30f195eb07309592ac0c0c6..0000000000000000000000000000000000000000 --- a/codes/qsh123/15845262.java +++ /dev/null @@ -1,11 +0,0 @@ -public static void bubbleSort(int [] a, int n){ - for (int i = 0; i < n - 1; i++){ - for (int j = 0; j < n - i - 1; j++){ - if (a[j] > a[j + 1]){ - int temp = a[j]; - a[j] = a[j + 1]; - a[j + 1] = temp; - } - } - } -} diff --git a/codes/qwaszx/15543578.java b/codes/qwaszx/15543578.java deleted file mode 100644 index e62ce2203114b40feac1bd75c98c93cd04d1116b..0000000000000000000000000000000000000000 --- a/codes/qwaszx/15543578.java +++ /dev/null @@ -1,18 +0,0 @@ -/** - * 冒泡排序函数 - * aa bb cc - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int[] a, int n) { - for (int i = 0; i < n - 1; i++) { - for (int j = 0; j < n - i - 1; j++) { - if (a[j] > a[j + 1]) { - // 交换 a[j] 和 a[j+1] - int temp = a[j]; - a[j] = a[j + 1]; - a[j + 1] = temp; - } - } - } -} //end diff --git a/codes/qwe123457/15854887.java b/codes/qwe123457/15854887.java deleted file mode 100644 index db00df4317c2971d839dccd193fa0332f983ff23..0000000000000000000000000000000000000000 --- a/codes/qwe123457/15854887.java +++ /dev/null @@ -1,22 +0,0 @@ -/** - * 冒泡排序函数 - * 对数组进行冒泡排序，使得数组中的元素按从小到大的顺序排列 - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int[] a, int n) { - // 外层循环控制排序趟数 - for (int i = 0; i < n - 1; i++) { - // 内层循环负责进行每趟排序，通过相邻元素的比较和交换来移动较大元素到数组的末尾 - for (int j = 0; j < n - i - 1; j++) { - // 如果前一个元素大于后一个元素，则交换它们的位置 - if (a[j] > a[j + 1]) { - // 交换元素 - int temp = a[j]; - a[j] = a[j + 1]; - a[j + 1] = temp; - } - } - } - // 经过 n-1 趟排序后，数组已经变为有序 -} // end diff --git a/codes/qwer121234/15859995.java b/codes/qwer121234/15859995.java deleted file mode 100644 index 54c5f3869cd16ee9e7c2b77895a39fae63f05dbc..0000000000000000000000000000000000000000 --- a/codes/qwer121234/15859995.java +++ /dev/null @@ -1,20 +0,0 @@ -/** - * 冒泡排序函数 - * aa bb cc - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - // 你的代码，使无序数组 a 变得有序 - for(int i = 0; i < n; i++) { - for(int liuy = 0; liuy < n - i - 1; liuy++) { - if(a[liuy] > a[liuy + 1]) { - int temp = a[liuy]; - a [liuy] = a[liuy + 1]; - a[liuy + 1] = temp; - } - } - } - - -} //end,liuy \ No newline at end of file diff --git a/codes/qwer121256/15860383.java b/codes/qwer121256/15860383.java deleted file mode 100644 index 987377810b5beca8eb4bf5eafeee5db45e234a87..0000000000000000000000000000000000000000 --- a/codes/qwer121256/15860383.java +++ /dev/null @@ -1,20 +0,0 @@ -/** - * 冒泡排序函数 - * aa bb cc - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - // 你的代码，使无序数组 a 变得有序 - for(int i = 0; i < n; i++) { - for(int liuy = 0; liuy < n - i - 1; liuy++) { - if(a[liuy] > a[liuy + 1]) { - int temp = a[liuy]; - a [liuy] = a[liuy + 1]; - a[liuy + 1] = temp; - } - } - } - - -} //end,liuy diff --git a/codes/qwer121278/15860433.java b/codes/qwer121278/15860433.java deleted file mode 100644 index 987377810b5beca8eb4bf5eafeee5db45e234a87..0000000000000000000000000000000000000000 --- a/codes/qwer121278/15860433.java +++ /dev/null @@ -1,20 +0,0 @@ -/** - * 冒泡排序函数 - * aa bb cc - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - // 你的代码，使无序数组 a 变得有序 - for(int i = 0; i < n; i++) { - for(int liuy = 0; liuy < n - i - 1; liuy++) { - if(a[liuy] > a[liuy + 1]) { - int temp = a[liuy]; - a [liuy] = a[liuy + 1]; - a[liuy + 1] = temp; - } - } - } - - -} //end,liuy diff --git a/codes/qwer121290/.keep b/codes/qwer121290/.keep deleted file mode 100644 index e69de29bb2d1d6434b8b29ae775ad8c2e48c5391..0000000000000000000000000000000000000000 diff --git a/codes/qwer121290/15860549.java b/codes/qwer121290/15860549.java deleted file mode 100644 index 54c5f3869cd16ee9e7c2b77895a39fae63f05dbc..0000000000000000000000000000000000000000 --- a/codes/qwer121290/15860549.java +++ /dev/null @@ -1,20 +0,0 @@ -/** - * 冒泡排序函数 - * aa bb cc - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - // 你的代码，使无序数组 a 变得有序 - for(int i = 0; i < n; i++) { - for(int liuy = 0; liuy < n - i - 1; liuy++) { - if(a[liuy] > a[liuy + 1]) { - int temp = a[liuy]; - a [liuy] = a[liuy + 1]; - a[liuy + 1] = temp; - } - } - } - - -} //end,liuy \ No newline at end of file diff --git a/codes/qwerplm6/15587872.java b/codes/qwerplm6/15587872.java deleted file mode 100644 index ae82e695cbfd360050241c3f1f592658c8c1d4e7..0000000000000000000000000000000000000000 --- a/codes/qwerplm6/15587872.java +++ /dev/null @@ -1,35 +0,0 @@ -/** - - * 冒泡排序函数 - - * aa bb cc - - * @param a 待排序的数组 - - * @param n 待排序的数组长度 - - */ - -public static void bubbleSort(int [] a, int n){ - - for(int i = 0; i < n-1 ; i++){ - - for (int j = 0;j < n-1-i;j++){ - - if(a[j] > a[j+1]){ - - int temp = a[j]; - - a[j] = a[j+1]; - - a[j+1] = temp; - - } - - } - - } - - - -} //end diff --git a/codes/qwert4678/.keep b/codes/qwert4678/.keep deleted file mode 100644 index e69de29bb2d1d6434b8b29ae775ad8c2e48c5391..0000000000000000000000000000000000000000 diff --git a/codes/qwert4678/15743469.java b/codes/qwert4678/15743469.java deleted file mode 100644 index 6e9861fa3ec6d5a2553cdccd1bb1e977430c671b..0000000000000000000000000000000000000000 --- a/codes/qwert4678/15743469.java +++ /dev/null @@ -1,19 +0,0 @@ -/** - * 冒泡排序函数 - * aa bb cc - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - // 你的代码，使无序数组 a 变得有序 - for (int i = 0; i < n - 1; i++) { - for (int j = 0; j < n - i - 1; j++) { - if (a[j] > a[j + 1]) { - - int temp = a[j]; - a[j] = a[j + 1]; - a[j + 1] = temp; - } - } - } -} //end \ No newline at end of file diff --git a/codes/qwfasfy4/.keep b/codes/qwfasfy4/.keep deleted file mode 100644 index e69de29bb2d1d6434b8b29ae775ad8c2e48c5391..0000000000000000000000000000000000000000 diff --git a/codes/qwfasfy4/15831401.java b/codes/qwfasfy4/15831401.java deleted file mode 100644 index 6e9861fa3ec6d5a2553cdccd1bb1e977430c671b..0000000000000000000000000000000000000000 --- a/codes/qwfasfy4/15831401.java +++ /dev/null @@ -1,19 +0,0 @@ -/** - * 冒泡排序函数 - * aa bb cc - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - // 你的代码，使无序数组 a 变得有序 - for (int i = 0; i < n - 1; i++) { - for (int j = 0; j < n - i - 1; j++) { - if (a[j] > a[j + 1]) { - - int temp = a[j]; - a[j] = a[j + 1]; - a[j + 1] = temp; - } - } - } -} //end \ No newline at end of file diff --git a/codes/ranball/15775950.java b/codes/ranball/15775950.java deleted file mode 100644 index b011cb91e53af1f006a63949c45926a5710066ce..0000000000000000000000000000000000000000 --- a/codes/ranball/15775950.java +++ /dev/null @@ -1,16 +0,0 @@ -public static void bubbleSort(int[] a, int n) { - // 外层循环控制排序趟数 - for (int i = 0; i < n - 1; i++) { - // 内层循环控制每一趟排序多少次 - for (int j = 0; j < n - 1 - i; j++) { - // 如果当前元素大于下一个元素，则交换它们 - if (a[j] > a[j + 1]) { - // 交换元素 - int temp = a[j]; - a[j] = a[j + 1]; - a[j + 1] = temp; - } - } - } -} // end - diff --git a/codes/renhaihang/15681912.java b/codes/renhaihang/15681912.java deleted file mode 100644 index 92c1bacfe9158fca1077809b7a8e0f6cb00aa693..0000000000000000000000000000000000000000 --- a/codes/renhaihang/15681912.java +++ /dev/null @@ -1,18 +0,0 @@ -/** - * 冒泡排序函数 - * 通过相邻元素两两比较并交换位置，使得每一轮循环后最大（或最小）的元素被交换到数组的末尾。 - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - for (int i = 0; i < n - 1; i++) { - for (int j = 0; j < n - i - 1; j++) { - // 如果当前元素大于下一个元素，则交换它们的位置 - if (a[j] > a[j + 1]) { - int temp = a[j]; - a[j] = a[j + 1]; - a[j + 1] = temp; - } - } - } -} //end diff --git a/codes/replying/11277017.java b/codes/replying/11277017.java deleted file mode 100644 index cacd12f1e4e4360dd1ffa22f3741e376110bcde4..0000000000000000000000000000000000000000 --- a/codes/replying/11277017.java +++ /dev/null @@ -1,18 +0,0 @@ -/** - * 冒泡排序函数 - * aa bb cc - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - // 你的代码，使无序数组 a 变得有序 - for(int i=0;ia[j+1]){ - a[j] = a[j]+a[j+1]; - a[j+1] = a[j]-a[j+1]; - a[j] = a[j]-a[j+1]; - } - } - } -} //end \ No newline at end of file diff --git a/codes/reseta/.keep b/codes/reseta/.keep deleted file mode 100644 index e69de29bb2d1d6434b8b29ae775ad8c2e48c5391..0000000000000000000000000000000000000000 diff --git a/codes/reseta/15854468.java b/codes/reseta/15854468.java deleted file mode 100644 index 6426772fb479b07ed3be21ef1867921d1dbb194c..0000000000000000000000000000000000000000 --- a/codes/reseta/15854468.java +++ /dev/null @@ -1,20 +0,0 @@ -/** - * 冒泡排序函数 - * aa bb cc - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - // 你的代码，使无序数组 a 变得有序 - for(int i = 0; i < n; i++) { - for(int j = 0; j < n - i - 1; j++) { - if(a[j] > a[j + 1]) { - int temp = a[j]; - a [j] = a[j + 1]; - a[j + 1] = temp; - } - } - } - - -} //end \ No newline at end of file diff --git a/codes/rhp1234/15674333.java b/codes/rhp1234/15674333.java deleted file mode 100644 index 5538e5d1293148ee7fae27f92ae9e7e13a70ff22..0000000000000000000000000000000000000000 --- a/codes/rhp1234/15674333.java +++ /dev/null @@ -1,26 +0,0 @@ -/** - * 冒泡排序函数 - * 该函数通过冒泡排序算法对整数数组进行升序排序 - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - for (int i = 0; i < n - 1; i++) { - // 用于标记是否发生交换，以优化排序过程 - boolean swapped = false; - for (int j = 0; j < n - i - 1; j++) { - if (a[j] > a[j + 1]) { - // 交换两个元素 - int temp = a[j]; - a[j] = a[j + 1]; - a[j + 1] = temp; - // 标记发生了交换 - swapped = true; - } - } - // 如果没有发生交换，则数组已经有序，可以提前结束排序 - if (!swapped) { - break; - } - } -} //end diff --git a/codes/rice18302947981/15717388.java b/codes/rice18302947981/15717388.java deleted file mode 100644 index a72d8eb5b560b007e3c507b0d5e6073e090ef223..0000000000000000000000000000000000000000 --- a/codes/rice18302947981/15717388.java +++ /dev/null @@ -1,19 +0,0 @@ -/** - * 冒泡排序函数 - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int[] a, int n) { - // 遍历数组的所有元素 - for (int i = 0; i < n - 1; i++) { - // 从第一个元素开始，比较相邻的两个元素，如果前一个元素大于后一个元素，则交换它们的位置 - for (int j = 0; j < n - 1 - i; j++) { - if (a[j] > a[j + 1]) { - // 交换 a[j] 和 a[j + 1] 的值 - int temp = a[j]; - a[j] = a[j + 1]; - a[j + 1] = temp; - } - } - } -} //end diff --git a/codes/rider666/18719506.java b/codes/rider666/18719506.java deleted file mode 100644 index 7710bcd38921eb5674b05cf474784b25d5de2476..0000000000000000000000000000000000000000 --- a/codes/rider666/18719506.java +++ /dev/null @@ -1,11 +0,0 @@ -public static void bubbleSort(int []a,int n) { - for(int i=0;ia[j+1]){ - int temp=a[j]; - a[j]=a[j+1]; - a[j+1]=temp; - } - } - } - } \ No newline at end of file diff --git a/codes/rlzvpz/.keep b/codes/rlzvpz/.keep deleted file mode 100644 index e69de29bb2d1d6434b8b29ae775ad8c2e48c5391..0000000000000000000000000000000000000000 diff --git a/codes/rlzvpz/15777666.java b/codes/rlzvpz/15777666.java deleted file mode 100644 index 343fcd48366acf1c442cc3c54da0deb903bde96b..0000000000000000000000000000000000000000 --- a/codes/rlzvpz/15777666.java +++ /dev/null @@ -1,18 +0,0 @@ - /** - * 冒泡排序函数 - * aa bb cc - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ - public static void bubbleSort(int [] arr, int n){ - // 你的代码，使无序数组 a 变得有序 - for (int i = 0; i < n; i++) { - for (int j = (i + 1); j < n; j++) { - if (arr[i] > arr[j]) { - int temp = arr[i]; - arr[i] = arr[j]; - arr[j] = temp; - } - } - } - } //end \ No newline at end of file diff --git a/codes/robert_bo/15545727.java b/codes/robert_bo/15545727.java deleted file mode 100644 index 4370113dd42e84bd1670bb0d8a848c92f05d43f4..0000000000000000000000000000000000000000 --- a/codes/robert_bo/15545727.java +++ /dev/null @@ -1,19 +0,0 @@ -/** - * 冒泡排序函数 - * aa bb cc - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ -// 你的代码，使无序数组 a 变得有序 - for (int i = 0; i < n - 1; i++) { - for (int j = 0; j < n - i - 1; j++) { - if (a[j] > a[j + 1]) { - // 交换元素位置 - int temp = a[j]; - a[j] = a[j + 1]; - a[j + 1] = temp; - } - } - } -} //end diff --git a/codes/robert_bo/15669897.java b/codes/robert_bo/15669897.java deleted file mode 100644 index 72e7f26afa817f34a5b016310ff8ab93be613b41..0000000000000000000000000000000000000000 --- a/codes/robert_bo/15669897.java +++ /dev/null @@ -1,18 +0,0 @@ -/** - * 冒泡排序函数 - * aa bb cc - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - for(int i = 0; i < n-1 ; i++){ - for (int j = 0;j < n-1-i;j++){ - if(a[j] > a[j+1]){ - int temp = a[j]; - a[j] = a[j+1]; - a[j+1] = temp; - } - } - } - -} //end diff --git a/codes/robert_bo/15669960.java b/codes/robert_bo/15669960.java deleted file mode 100644 index 85112f922ea0d1d95dfdce27442cbe56693dacc6..0000000000000000000000000000000000000000 --- a/codes/robert_bo/15669960.java +++ /dev/null @@ -1,18 +0,0 @@ -/** - * 冒泡排序函数 - * aa bb cc - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - for(int i = 0; i < n-1 ; i++){ - for (int j = 0;j < n-1-i;j++){ - if(a[j] > a[j+1]){ - int temp = a[j]; - a[j] = a[j+1]; - a[j+1] = temp; - } - } - } - -} //end \ No newline at end of file diff --git a/codes/rockandro1l/.keep b/codes/rockandro1l/.keep deleted file mode 100644 index e69de29bb2d1d6434b8b29ae775ad8c2e48c5391..0000000000000000000000000000000000000000 diff --git a/codes/rockandro1l/15844987.java b/codes/rockandro1l/15844987.java deleted file mode 100644 index 6e9861fa3ec6d5a2553cdccd1bb1e977430c671b..0000000000000000000000000000000000000000 --- a/codes/rockandro1l/15844987.java +++ /dev/null @@ -1,19 +0,0 @@ -/** - * 冒泡排序函数 - * aa bb cc - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - // 你的代码，使无序数组 a 变得有序 - for (int i = 0; i < n - 1; i++) { - for (int j = 0; j < n - i - 1; j++) { - if (a[j] > a[j + 1]) { - - int temp = a[j]; - a[j] = a[j + 1]; - a[j + 1] = temp; - } - } - } -} //end \ No newline at end of file diff --git a/codes/roklly/11207828.java b/codes/roklly/11207828.java deleted file mode 100644 index 1c8889947f924214c71a3c3f202500b4780dc281..0000000000000000000000000000000000000000 --- a/codes/roklly/11207828.java +++ /dev/null @@ -1,11 +0,0 @@ -public static void bubbleSort(int [] a,int n){ - for(int i = 0; i < n-1 ; i++){ - for (int j = 0;j < n-1-i;j++){ - if(a[j] > a[j+1]){ - int temp = a[j]; - a[j] = a[j+1]; - a[j+1] = temp; - } - } - } -} \ No newline at end of file diff --git a/codes/root0day/10353744.java b/codes/root0day/10353744.java deleted file mode 100644 index 33f024280ec9e03701cc23cb42410308718b4ed9..0000000000000000000000000000000000000000 --- a/codes/root0day/10353744.java +++ /dev/null @@ -1,18 +0,0 @@ -/** - * 冒泡排序函数 - * aa bb cc - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - // 你的代码，使无序数组 a 变得有序 - for (int i = 0; i < n-1; i++) { - for (int j = i+1; j < n; j++) { - if (a[i] > a[j]) { - int temp = a[i]; - a[i] = a[j]; - a[j] = temp; - } - } - } -} //end diff --git a/codes/roy12345666/15845812.java b/codes/roy12345666/15845812.java deleted file mode 100644 index b92ee04c25afa3b094bc93284111a648e459502b..0000000000000000000000000000000000000000 --- a/codes/roy12345666/15845812.java +++ /dev/null @@ -1,19 +0,0 @@ -/** - * 冒泡排序函数 - * 通过重复地遍历要排序的数列，一次比较两个元素，如果他们的顺序错误就把他们交换过来。 - * 遍历数列的工作是重复地进行直到没有再需要交换，也就是说该数列已经排序完成。 - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int[] a, int n) { - for (int i = 0; i < n - 1; i++) { // 外层循环控制排序趟数 - for (int j = 0; j < n - 1 - i; j++) { // 内层循环控制每一趟排序多少次 - if (a[j] > a[j + 1]) { // 如果当前元素大于下一个元素，则交换它们的位置 - // 交换 a[j] 和 a[j+1] - int temp = a[j]; - a[j] = a[j + 1]; - a[j + 1] = temp; - } - } - } -} // end diff --git a/codes/rree123/15719870.java b/codes/rree123/15719870.java deleted file mode 100644 index 987377810b5beca8eb4bf5eafeee5db45e234a87..0000000000000000000000000000000000000000 --- a/codes/rree123/15719870.java +++ /dev/null @@ -1,20 +0,0 @@ -/** - * 冒泡排序函数 - * aa bb cc - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - // 你的代码，使无序数组 a 变得有序 - for(int i = 0; i < n; i++) { - for(int liuy = 0; liuy < n - i - 1; liuy++) { - if(a[liuy] > a[liuy + 1]) { - int temp = a[liuy]; - a [liuy] = a[liuy + 1]; - a[liuy + 1] = temp; - } - } - } - - -} //end,liuy diff --git a/codes/rrffhj/.keep b/codes/rrffhj/.keep deleted file mode 100644 index e69de29bb2d1d6434b8b29ae775ad8c2e48c5391..0000000000000000000000000000000000000000 diff --git a/codes/rrffhj/15778997.java b/codes/rrffhj/15778997.java deleted file mode 100644 index 5edd6bf0e38372fd1654da46aeafd4941c42ddb7..0000000000000000000000000000000000000000 --- a/codes/rrffhj/15778997.java +++ /dev/null @@ -1,20 +0,0 @@ -/** - * 冒泡排序函数 - * aa bb cc - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - // 你的代码，使无序数组 a 变得有序 - for (int i = 0; i < n; i++) { - for (int j = i + 1; j < n; j++) { - if (a[i] > a[j]) { - int temp = a[j]; - a[j] = a[i]; - a[i] = temp; - - } - } - } - -} //end \ No newline at end of file diff --git a/codes/rrr170459/15857158.java b/codes/rrr170459/15857158.java deleted file mode 100644 index 271d2f1dfec9c226694fa24afe300e49f150ca51..0000000000000000000000000000000000000000 --- a/codes/rrr170459/15857158.java +++ /dev/null @@ -1,18 +0,0 @@ -/** - * 冒泡排序函数 - * 将数组a按照从小到大的顺序排序 - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int[] a, int n) { - for (int i = 0; i < n - 1; i++) { // 外层循环，决定冒泡的趟数 - for (int j = 0; j < n - 1 - i; j++) { // 内层循环，决定每趟比较的次数 - if (a[j] > a[j + 1]) { // 如果当前元素大于下一个元素，则交换它们的位置 - // 交换a[j]和a[j + 1] - int temp = a[j]; - a[j] = a[j + 1]; - a[j + 1] = temp; - } - } - } -} // end diff --git a/codes/rtsp8080/11303570.java b/codes/rtsp8080/11303570.java deleted file mode 100644 index 24b49b4b1fd01d1f21be8b362a582158452e41d3..0000000000000000000000000000000000000000 --- a/codes/rtsp8080/11303570.java +++ /dev/null @@ -1,19 +0,0 @@ -/** - * 冒泡排序函数 - * aa bb cc - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - // 你的代码，使无序数组 a 变得有序 - for(int i = 0 ; i < n - 1 ; i++){ - for(int j = 0 ; j < n - 1 - i ; j++){ - if(a[j] > a[j + 1]){ - int tmp = a[j]; - a[j] = a[j + 1]; - a[j + 1] = tmp; - } - } - } - -} //end \ No newline at end of file diff --git a/codes/ruoruokpl/.keep b/codes/ruoruokpl/.keep deleted file mode 100644 index e69de29bb2d1d6434b8b29ae775ad8c2e48c5391..0000000000000000000000000000000000000000 diff --git a/codes/ruoruokpl/15815244.java b/codes/ruoruokpl/15815244.java deleted file mode 100644 index 6e9861fa3ec6d5a2553cdccd1bb1e977430c671b..0000000000000000000000000000000000000000 --- a/codes/ruoruokpl/15815244.java +++ /dev/null @@ -1,19 +0,0 @@ -/** - * 冒泡排序函数 - * aa bb cc - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - // 你的代码，使无序数组 a 变得有序 - for (int i = 0; i < n - 1; i++) { - for (int j = 0; j < n - i - 1; j++) { - if (a[j] > a[j + 1]) { - - int temp = a[j]; - a[j] = a[j + 1]; - a[j + 1] = temp; - } - } - } -} //end \ No newline at end of file diff --git a/codes/ruoruone/15775867.java b/codes/ruoruone/15775867.java deleted file mode 100644 index 987377810b5beca8eb4bf5eafeee5db45e234a87..0000000000000000000000000000000000000000 --- a/codes/ruoruone/15775867.java +++ /dev/null @@ -1,20 +0,0 @@ -/** - * 冒泡排序函数 - * aa bb cc - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - // 你的代码，使无序数组 a 变得有序 - for(int i = 0; i < n; i++) { - for(int liuy = 0; liuy < n - i - 1; liuy++) { - if(a[liuy] > a[liuy + 1]) { - int temp = a[liuy]; - a [liuy] = a[liuy + 1]; - a[liuy + 1] = temp; - } - } - } - - -} //end,liuy diff --git a/codes/ryange/.keep b/codes/ryange/.keep deleted file mode 100644 index e69de29bb2d1d6434b8b29ae775ad8c2e48c5391..0000000000000000000000000000000000000000 diff --git a/codes/ryange/15846346.java b/codes/ryange/15846346.java deleted file mode 100644 index 6426772fb479b07ed3be21ef1867921d1dbb194c..0000000000000000000000000000000000000000 --- a/codes/ryange/15846346.java +++ /dev/null @@ -1,20 +0,0 @@ -/** - * 冒泡排序函数 - * aa bb cc - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - // 你的代码，使无序数组 a 变得有序 - for(int i = 0; i < n; i++) { - for(int j = 0; j < n - i - 1; j++) { - if(a[j] > a[j + 1]) { - int temp = a[j]; - a [j] = a[j + 1]; - a[j + 1] = temp; - } - } - } - - -} //end \ No newline at end of file diff --git a/codes/ryer767gfgs/.keep b/codes/ryer767gfgs/.keep deleted file mode 100644 index e69de29bb2d1d6434b8b29ae775ad8c2e48c5391..0000000000000000000000000000000000000000 diff --git a/codes/ryer767gfgs/15743395.java b/codes/ryer767gfgs/15743395.java deleted file mode 100644 index 96508c1385b4a62859a2adea3c8dfae39051b7cd..0000000000000000000000000000000000000000 --- a/codes/ryer767gfgs/15743395.java +++ /dev/null @@ -1,19 +0,0 @@ -/** - * 冒泡排序函数 - * aa bb cc - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - // 你的代码，使无序数组 a 变得有序 - for (int i = 0; i < n - 1; i++) { - for (int j = 0; j < n - i - 1; j++) { - if (a[j] > a[j + 1]) { - - int temp = a[j]; - a[j] = a[j + 1]; - a[j + 1] = temp; - } - } - } -} //end \ No newline at end of file diff --git a/codes/s0nder/15635858.java b/codes/s0nder/15635858.java deleted file mode 100644 index c2afaa2414da1853e4500b02c6de9068b64aeafe..0000000000000000000000000000000000000000 --- a/codes/s0nder/15635858.java +++ /dev/null @@ -1,18 +0,0 @@ -/** - * 冒泡排序函数 - * aa bb cc - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - for(int i = 0; i < n-1 ; i++){ - for (int j = 0;j < n-1-i;j++){ - if(a[j] > a[j+1]){ - int temp = a[j]; - a[j] = a[j+1]; - a[j+1] = temp; - } - } - } - -} //end diff --git a/codes/s18836251852/15717550.java b/codes/s18836251852/15717550.java deleted file mode 100644 index 06f37284a2ef346036f7727ab7275454f55e382c..0000000000000000000000000000000000000000 --- a/codes/s18836251852/15717550.java +++ /dev/null @@ -1,17 +0,0 @@ -/** - * 冒泡排序函数 - * 对数组a进行冒泡排序，使其变得有序 - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - for(int i = 0; i < n - 1; i++){ // 外层循环，控制需要排序的趟数 - for(int j = 0; j < n - 1 - i; j++){ // 内层循环，负责每趟的排序 - if(a[j] > a[j + 1]){ // 如果前一个元素比后一个元素大，则交换它们的位置 - int temp = a[j]; - a[j] = a[j + 1]; - a[j + 1] = temp; - } - } - } -} //end diff --git a/codes/s18893442896/16477528.java b/codes/s18893442896/16477528.java deleted file mode 100644 index 92b177d2f4e973a541fed1583904ab51cf500c3a..0000000000000000000000000000000000000000 --- a/codes/s18893442896/16477528.java +++ /dev/null @@ -1,36 +0,0 @@ -/** - * 冒泡排序函数 - * aa bb cc - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -/*public static void bubbleSort(int [] a, int n){ - if (array == null || n <= 1) { - return; - } - for (int i = 0; i < n - 1; i++) { - for (int j = 0; j < n - i - 1; j++) { - if (array[j] > array[j + 1]) { - int temp = array[j]; - array[j] = array[j + 1]; - array[j + 1] = temp; - } - } - } -}*/ -public static void bubbleSort(int[] array, int length) { - if (array == null || length <= 1) { - return; - } - - for (int i = 0; i < length - 1; i++) { - for (int j = 0; j < length - i - 1; j++) { - if (array[j] > array[j + 1]) { - // 交换 array[j] 和 array[j + 1] - int temp = array[j]; - array[j] = array[j + 1]; - array[j + 1] = temp; - } - } - } - } diff --git a/codes/s19555077769/15839271.java b/codes/s19555077769/15839271.java deleted file mode 100644 index 47e0d6efa8bfa49fe95c91537dccda0c09563b63..0000000000000000000000000000000000000000 --- a/codes/s19555077769/15839271.java +++ /dev/null @@ -1,18 +0,0 @@ -/** - * 冒泡排序函数 - * 功能：对数组进行升序排序 - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int[] a, int n) { - for (int i = 0; i < n - 1; i++) { // 遍历数组，从第一个元素到倒数第二个元素 - for (int j = 0; j < n - 1 - i; j++) { // 每次比较相邻的元素，最后一个元素已经是当前轮的最大值，无需再比较 - if (a[j] > a[j + 1]) { // 如果前一个元素大于后一个元素，则交换它们的位置 - // 交换 a[j] 和 a[j+1] - int temp = a[j]; - a[j] = a[j + 1]; - a[j + 1] = temp; - } - } - } -} // end diff --git a/codes/s20050520/15545690.java b/codes/s20050520/15545690.java deleted file mode 100644 index ae82e695cbfd360050241c3f1f592658c8c1d4e7..0000000000000000000000000000000000000000 --- a/codes/s20050520/15545690.java +++ /dev/null @@ -1,35 +0,0 @@ -/** - - * 冒泡排序函数 - - * aa bb cc - - * @param a 待排序的数组 - - * @param n 待排序的数组长度 - - */ - -public static void bubbleSort(int [] a, int n){ - - for(int i = 0; i < n-1 ; i++){ - - for (int j = 0;j < n-1-i;j++){ - - if(a[j] > a[j+1]){ - - int temp = a[j]; - - a[j] = a[j+1]; - - a[j+1] = temp; - - } - - } - - } - - - -} //end diff --git a/codes/sa17737119814/15860032.java b/codes/sa17737119814/15860032.java deleted file mode 100644 index 271d2f1dfec9c226694fa24afe300e49f150ca51..0000000000000000000000000000000000000000 --- a/codes/sa17737119814/15860032.java +++ /dev/null @@ -1,18 +0,0 @@ -/** - * 冒泡排序函数 - * 将数组a按照从小到大的顺序排序 - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int[] a, int n) { - for (int i = 0; i < n - 1; i++) { // 外层循环，决定冒泡的趟数 - for (int j = 0; j < n - 1 - i; j++) { // 内层循环，决定每趟比较的次数 - if (a[j] > a[j + 1]) { // 如果当前元素大于下一个元素，则交换它们的位置 - // 交换a[j]和a[j + 1] - int temp = a[j]; - a[j] = a[j + 1]; - a[j + 1] = temp; - } - } - } -} // end diff --git a/codes/sa17833901967/15859863.java b/codes/sa17833901967/15859863.java deleted file mode 100644 index 271d2f1dfec9c226694fa24afe300e49f150ca51..0000000000000000000000000000000000000000 --- a/codes/sa17833901967/15859863.java +++ /dev/null @@ -1,18 +0,0 @@ -/** - * 冒泡排序函数 - * 将数组a按照从小到大的顺序排序 - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int[] a, int n) { - for (int i = 0; i < n - 1; i++) { // 外层循环，决定冒泡的趟数 - for (int j = 0; j < n - 1 - i; j++) { // 内层循环，决定每趟比较的次数 - if (a[j] > a[j + 1]) { // 如果当前元素大于下一个元素，则交换它们的位置 - // 交换a[j]和a[j + 1] - int temp = a[j]; - a[j] = a[j + 1]; - a[j + 1] = temp; - } - } - } -} // end diff --git a/codes/sad546aa/.keep b/codes/sad546aa/.keep deleted file mode 100644 index e69de29bb2d1d6434b8b29ae775ad8c2e48c5391..0000000000000000000000000000000000000000 diff --git a/codes/sad546aa/15743452.java b/codes/sad546aa/15743452.java deleted file mode 100644 index 6e9861fa3ec6d5a2553cdccd1bb1e977430c671b..0000000000000000000000000000000000000000 --- a/codes/sad546aa/15743452.java +++ /dev/null @@ -1,19 +0,0 @@ -/** - * 冒泡排序函数 - * aa bb cc - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - // 你的代码，使无序数组 a 变得有序 - for (int i = 0; i < n - 1; i++) { - for (int j = 0; j < n - i - 1; j++) { - if (a[j] > a[j + 1]) { - - int temp = a[j]; - a[j] = a[j + 1]; - a[j + 1] = temp; - } - } - } -} //end \ No newline at end of file diff --git a/codes/sadboy/10979809.java b/codes/sadboy/10979809.java deleted file mode 100644 index 653d850387c460844b7367ff2738e07559ec338d..0000000000000000000000000000000000000000 --- a/codes/sadboy/10979809.java +++ /dev/null @@ -1,20 +0,0 @@ -/** - * 冒泡排序函数 - * aa bb cc - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] arr, int n){ - // 你的代码，使无序数组 a 变得有序 - 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; - } - } - } - -} //end diff --git a/codes/sadboy/15628230.java b/codes/sadboy/15628230.java deleted file mode 100644 index c50ecb8b64ada397f8b3038d214d92b22037e169..0000000000000000000000000000000000000000 --- a/codes/sadboy/15628230.java +++ /dev/null @@ -1,20 +0,0 @@ -/** - * 冒泡排序函数 - * aa bb cc - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - // 你的代码，使无序数组 a 变得有序 - for(int i = 0; i < n; i++) { - for(int sad = 0; sad < n - i - 1; sad++) { - if(a[sad] > a[sad + 1]) { - int temp = a[sad]; - a [sad] = a[sad + 1]; - a[sad + 1] = temp; - } - } - } - - -} //end,sad diff --git a/codes/saf546qafd/.keep b/codes/saf546qafd/.keep deleted file mode 100644 index e69de29bb2d1d6434b8b29ae775ad8c2e48c5391..0000000000000000000000000000000000000000 diff --git a/codes/saf546qafd/15743461.java b/codes/saf546qafd/15743461.java deleted file mode 100644 index 6e9861fa3ec6d5a2553cdccd1bb1e977430c671b..0000000000000000000000000000000000000000 --- a/codes/saf546qafd/15743461.java +++ /dev/null @@ -1,19 +0,0 @@ -/** - * 冒泡排序函数 - * aa bb cc - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - // 你的代码，使无序数组 a 变得有序 - for (int i = 0; i < n - 1; i++) { - for (int j = 0; j < n - i - 1; j++) { - if (a[j] > a[j + 1]) { - - int temp = a[j]; - a[j] = a[j + 1]; - a[j + 1] = temp; - } - } - } -} //end \ No newline at end of file diff --git a/codes/safafsaiuiu24/.keep b/codes/safafsaiuiu24/.keep deleted file mode 100644 index e69de29bb2d1d6434b8b29ae775ad8c2e48c5391..0000000000000000000000000000000000000000 diff --git a/codes/safafsaiuiu24/15831227.java b/codes/safafsaiuiu24/15831227.java deleted file mode 100644 index 6e9861fa3ec6d5a2553cdccd1bb1e977430c671b..0000000000000000000000000000000000000000 --- a/codes/safafsaiuiu24/15831227.java +++ /dev/null @@ -1,19 +0,0 @@ -/** - * 冒泡排序函数 - * aa bb cc - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - // 你的代码，使无序数组 a 变得有序 - for (int i = 0; i < n - 1; i++) { - for (int j = 0; j < n - i - 1; j++) { - if (a[j] > a[j + 1]) { - - int temp = a[j]; - a[j] = a[j + 1]; - a[j + 1] = temp; - } - } - } -} //end \ No newline at end of file diff --git a/codes/safasf342351/.keep b/codes/safasf342351/.keep deleted file mode 100644 index e69de29bb2d1d6434b8b29ae775ad8c2e48c5391..0000000000000000000000000000000000000000 diff --git a/codes/safasf342351/15743467.java b/codes/safasf342351/15743467.java deleted file mode 100644 index 96508c1385b4a62859a2adea3c8dfae39051b7cd..0000000000000000000000000000000000000000 --- a/codes/safasf342351/15743467.java +++ /dev/null @@ -1,19 +0,0 @@ -/** - * 冒泡排序函数 - * aa bb cc - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - // 你的代码，使无序数组 a 变得有序 - for (int i = 0; i < n - 1; i++) { - for (int j = 0; j < n - i - 1; j++) { - if (a[j] > a[j + 1]) { - - int temp = a[j]; - a[j] = a[j + 1]; - a[j + 1] = temp; - } - } - } -} //end \ No newline at end of file diff --git a/codes/safasf647/.keep b/codes/safasf647/.keep deleted file mode 100644 index e69de29bb2d1d6434b8b29ae775ad8c2e48c5391..0000000000000000000000000000000000000000 diff --git a/codes/safasf647/15831068.java b/codes/safasf647/15831068.java deleted file mode 100644 index 6e9861fa3ec6d5a2553cdccd1bb1e977430c671b..0000000000000000000000000000000000000000 --- a/codes/safasf647/15831068.java +++ /dev/null @@ -1,19 +0,0 @@ -/** - * 冒泡排序函数 - * aa bb cc - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - // 你的代码，使无序数组 a 变得有序 - for (int i = 0; i < n - 1; i++) { - for (int j = 0; j < n - i - 1; j++) { - if (a[j] > a[j + 1]) { - - int temp = a[j]; - a[j] = a[j + 1]; - a[j + 1] = temp; - } - } - } -} //end \ No newline at end of file diff --git a/codes/saffasckkk77/.keep b/codes/saffasckkk77/.keep deleted file mode 100644 index e69de29bb2d1d6434b8b29ae775ad8c2e48c5391..0000000000000000000000000000000000000000 diff --git a/codes/saffasckkk77/15743383.java b/codes/saffasckkk77/15743383.java deleted file mode 100644 index 6e9861fa3ec6d5a2553cdccd1bb1e977430c671b..0000000000000000000000000000000000000000 --- a/codes/saffasckkk77/15743383.java +++ /dev/null @@ -1,19 +0,0 @@ -/** - * 冒泡排序函数 - * aa bb cc - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - // 你的代码，使无序数组 a 变得有序 - for (int i = 0; i < n - 1; i++) { - for (int j = 0; j < n - i - 1; j++) { - if (a[j] > a[j + 1]) { - - int temp = a[j]; - a[j] = a[j + 1]; - a[j + 1] = temp; - } - } - } -} //end \ No newline at end of file diff --git a/codes/sag546fa/.keep b/codes/sag546fa/.keep deleted file mode 100644 index e69de29bb2d1d6434b8b29ae775ad8c2e48c5391..0000000000000000000000000000000000000000 diff --git a/codes/sag546fa/15799007.java b/codes/sag546fa/15799007.java deleted file mode 100644 index 6e9861fa3ec6d5a2553cdccd1bb1e977430c671b..0000000000000000000000000000000000000000 --- a/codes/sag546fa/15799007.java +++ /dev/null @@ -1,19 +0,0 @@ -/** - * 冒泡排序函数 - * aa bb cc - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - // 你的代码，使无序数组 a 变得有序 - for (int i = 0; i < n - 1; i++) { - for (int j = 0; j < n - i - 1; j++) { - if (a[j] > a[j + 1]) { - - int temp = a[j]; - a[j] = a[j + 1]; - a[j + 1] = temp; - } - } - } -} //end \ No newline at end of file diff --git a/codes/sahofav587/11220243.java b/codes/sahofav587/11220243.java deleted file mode 100644 index deb2438785c696d09e985c35997c2f2bc5445a90..0000000000000000000000000000000000000000 --- a/codes/sahofav587/11220243.java +++ /dev/null @@ -1,18 +0,0 @@ -/** - * 冒泡排序函数 - * aa bb cc - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - // 你的代码，使无序数组 a 变得有序 - for (int i=0 ; ia[k+1]) { - int temp=a[k]; - a[k]=a[k+1]; - a[k+1]=temp; - } - } - } -} //end \ No newline at end of file diff --git a/codes/sakut2/15592208.java b/codes/sakut2/15592208.java deleted file mode 100644 index c2afaa2414da1853e4500b02c6de9068b64aeafe..0000000000000000000000000000000000000000 --- a/codes/sakut2/15592208.java +++ /dev/null @@ -1,18 +0,0 @@ -/** - * 冒泡排序函数 - * aa bb cc - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - for(int i = 0; i < n-1 ; i++){ - for (int j = 0;j < n-1-i;j++){ - if(a[j] > a[j+1]){ - int temp = a[j]; - a[j] = a[j+1]; - a[j+1] = temp; - } - } - } - -} //end diff --git a/codes/sam9029/.java.swp b/codes/sam9029/.java.swp deleted file mode 100644 index b94c1c39673fe39ba0f06402fd2d196d3e8aff1d..0000000000000000000000000000000000000000 Binary files a/codes/sam9029/.java.swp and /dev/null differ diff --git a/codes/sam9029/9968905.java b/codes/sam9029/9968905.java deleted file mode 100644 index 4817bae9fa4f89646d2cff5f41720e13747a1f6b..0000000000000000000000000000000000000000 --- a/codes/sam9029/9968905.java +++ /dev/null @@ -1,23 +0,0 @@ -/** - * 冒泡排序函数 - * aa bb cc - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - // 你的代码，使无序数组 a 变得有序 - //变量 - int template = 0; // 交换变量 - - for(int i = 0; i < n-1; i++){ - for(int j = 0;j < n-1-i; j ++){ - if(a[j] > a[j+1]){ - template = a[j]; - a[j] = a[j+1]; - a[j+1] = template; - } - } - } - -} //end - diff --git a/codes/samzoe_openanolis/15733701.java b/codes/samzoe_openanolis/15733701.java deleted file mode 100644 index 7ec373aee12c8b4795c0d670e772620e90ee630e..0000000000000000000000000000000000000000 --- a/codes/samzoe_openanolis/15733701.java +++ /dev/null @@ -1,18 +0,0 @@ -/** - * 冒泡排序函数 - * 通过对相邻的元素进行两两比较，顺序相反则进行交换，每一轮比较会将当前未排序部分的最大值“冒泡”到未排序部分的末尾。 - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int[] a, int n) { - for (int i = 0; i < n - 1; i++) { // 外层循环控制所有轮数 - for (int j = 0; j < n - i - 1; j++) { // 内层循环控制每轮比较的次数 - if (a[j] > a[j + 1]) { // 如果前一个元素大于后一个元素，则交换它们 - // 交换 a[j] 和 a[j+1] - int temp = a[j]; - a[j] = a[j + 1]; - a[j + 1] = temp; - } - } - } -} // end diff --git a/codes/sandbox/11142279.java b/codes/sandbox/11142279.java deleted file mode 100644 index b9bf7818d9ffdce1bf2bd0863a51890bffa3f951..0000000000000000000000000000000000000000 --- a/codes/sandbox/11142279.java +++ /dev/null @@ -1,11 +0,0 @@ -public static void bubbleSort(int [] a, int n) { - for (int i=0 ; ia[j+1]) { - int temp=a[j]; - a[j]=a[j+1]; - a[j+1]=temp; - } - } - } -} \ No newline at end of file diff --git a/codes/sangeta/.keep b/codes/sangeta/.keep deleted file mode 100644 index e69de29bb2d1d6434b8b29ae775ad8c2e48c5391..0000000000000000000000000000000000000000 diff --git a/codes/sangeta/15720730.java b/codes/sangeta/15720730.java deleted file mode 100644 index 6426772fb479b07ed3be21ef1867921d1dbb194c..0000000000000000000000000000000000000000 --- a/codes/sangeta/15720730.java +++ /dev/null @@ -1,20 +0,0 @@ -/** - * 冒泡排序函数 - * aa bb cc - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - // 你的代码，使无序数组 a 变得有序 - for(int i = 0; i < n; i++) { - for(int j = 0; j < n - i - 1; j++) { - if(a[j] > a[j + 1]) { - int temp = a[j]; - a [j] = a[j + 1]; - a[j + 1] = temp; - } - } - } - - -} //end \ No newline at end of file diff --git a/codes/sansiya/15776109.java b/codes/sansiya/15776109.java deleted file mode 100644 index 987377810b5beca8eb4bf5eafeee5db45e234a87..0000000000000000000000000000000000000000 --- a/codes/sansiya/15776109.java +++ /dev/null @@ -1,20 +0,0 @@ -/** - * 冒泡排序函数 - * aa bb cc - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - // 你的代码，使无序数组 a 变得有序 - for(int i = 0; i < n; i++) { - for(int liuy = 0; liuy < n - i - 1; liuy++) { - if(a[liuy] > a[liuy + 1]) { - int temp = a[liuy]; - a [liuy] = a[liuy + 1]; - a[liuy + 1] = temp; - } - } - } - - -} //end,liuy diff --git a/codes/sanya123/15772128.java b/codes/sanya123/15772128.java deleted file mode 100644 index 987377810b5beca8eb4bf5eafeee5db45e234a87..0000000000000000000000000000000000000000 --- a/codes/sanya123/15772128.java +++ /dev/null @@ -1,20 +0,0 @@ -/** - * 冒泡排序函数 - * aa bb cc - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - // 你的代码，使无序数组 a 变得有序 - for(int i = 0; i < n; i++) { - for(int liuy = 0; liuy < n - i - 1; liuy++) { - if(a[liuy] > a[liuy + 1]) { - int temp = a[liuy]; - a [liuy] = a[liuy + 1]; - a[liuy + 1] = temp; - } - } - } - - -} //end,liuy diff --git a/codes/sanzhanggui/15824093.java b/codes/sanzhanggui/15824093.java deleted file mode 100644 index d2133d7adba28d86d62664532bc967e2139af265..0000000000000000000000000000000000000000 --- a/codes/sanzhanggui/15824093.java +++ /dev/null @@ -1,18 +0,0 @@ -/** - * 冒泡排序函数 - * 遍历数组，比较相邻元素，如果顺序错误则交换位置 - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - for (int i = 0; i < n - 1; i++) { - for (int j = 0; j < n - i - 1; j++) { - // 如果当前元素大于下一个元素，则交换它们的位置 - if (a[j] > a[j + 1]) { - int temp = a[j]; - a[j] = a[j + 1]; - a[j + 1] = temp; - } - } - } -} //end diff --git a/codes/sar34dg674/.keep b/codes/sar34dg674/.keep deleted file mode 100644 index e69de29bb2d1d6434b8b29ae775ad8c2e48c5391..0000000000000000000000000000000000000000 diff --git a/codes/sar34dg674/15831280.java b/codes/sar34dg674/15831280.java deleted file mode 100644 index 6e9861fa3ec6d5a2553cdccd1bb1e977430c671b..0000000000000000000000000000000000000000 --- a/codes/sar34dg674/15831280.java +++ /dev/null @@ -1,19 +0,0 @@ -/** - * 冒泡排序函数 - * aa bb cc - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - // 你的代码，使无序数组 a 变得有序 - for (int i = 0; i < n - 1; i++) { - for (int j = 0; j < n - i - 1; j++) { - if (a[j] > a[j + 1]) { - - int temp = a[j]; - a[j] = a[j + 1]; - a[j + 1] = temp; - } - } - } -} //end \ No newline at end of file diff --git a/codes/say1ka/16051921.java b/codes/say1ka/16051921.java deleted file mode 100644 index 2e90626b0ad75399e31c88cd9893de817c4c958b..0000000000000000000000000000000000000000 --- a/codes/say1ka/16051921.java +++ /dev/null @@ -1,22 +0,0 @@ -/** - * 冒泡排序函数 - * aa bb cc - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - // 你的代码，使无序数组 a 变得有序 - int i, j; - - for(i=0; i a[j]){//前面的数字大于后面的数字就交换 - //交换a[j-1]和a[j] - int temp; - temp = a[j-1]; - a[j-1] = a[j]; - a[j]=temp; - } - } - } -} diff --git a/codes/sayslot/11250439.java b/codes/sayslot/11250439.java deleted file mode 100644 index 7db1ed71c900652c30e8b1c3e9172e685287856a..0000000000000000000000000000000000000000 --- a/codes/sayslot/11250439.java +++ /dev/null @@ -1,11 +0,0 @@ -public static void bubbleSort(int []arr, int n) { - for(int i=0; i < n-1; i++) { - for(int j=0; j < n-i-1; j++) { - if(arr[j]>arr[j+1]) { - int temp = arr[j+1]; - arr[j+1] = arr[j]; - arr[j] = temp; - } - } - } -} \ No newline at end of file diff --git a/codes/sccc2124/.keep b/codes/sccc2124/.keep deleted file mode 100644 index e69de29bb2d1d6434b8b29ae775ad8c2e48c5391..0000000000000000000000000000000000000000 diff --git a/codes/sccc2124/15831363.java b/codes/sccc2124/15831363.java deleted file mode 100644 index 6e9861fa3ec6d5a2553cdccd1bb1e977430c671b..0000000000000000000000000000000000000000 --- a/codes/sccc2124/15831363.java +++ /dev/null @@ -1,19 +0,0 @@ -/** - * 冒泡排序函数 - * aa bb cc - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - // 你的代码，使无序数组 a 变得有序 - for (int i = 0; i < n - 1; i++) { - for (int j = 0; j < n - i - 1; j++) { - if (a[j] > a[j + 1]) { - - int temp = a[j]; - a[j] = a[j + 1]; - a[j + 1] = temp; - } - } - } -} //end \ No newline at end of file diff --git a/codes/sda2022421943/15859661.java b/codes/sda2022421943/15859661.java deleted file mode 100644 index 54c5f3869cd16ee9e7c2b77895a39fae63f05dbc..0000000000000000000000000000000000000000 --- a/codes/sda2022421943/15859661.java +++ /dev/null @@ -1,20 +0,0 @@ -/** - * 冒泡排序函数 - * aa bb cc - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - // 你的代码，使无序数组 a 变得有序 - for(int i = 0; i < n; i++) { - for(int liuy = 0; liuy < n - i - 1; liuy++) { - if(a[liuy] > a[liuy + 1]) { - int temp = a[liuy]; - a [liuy] = a[liuy + 1]; - a[liuy + 1] = temp; - } - } - } - - -} //end,liuy \ No newline at end of file diff --git a/codes/sdafaf4251/.keep b/codes/sdafaf4251/.keep deleted file mode 100644 index e69de29bb2d1d6434b8b29ae775ad8c2e48c5391..0000000000000000000000000000000000000000 diff --git a/codes/sdafaf4251/15743466.java b/codes/sdafaf4251/15743466.java deleted file mode 100644 index 6e9861fa3ec6d5a2553cdccd1bb1e977430c671b..0000000000000000000000000000000000000000 --- a/codes/sdafaf4251/15743466.java +++ /dev/null @@ -1,19 +0,0 @@ -/** - * 冒泡排序函数 - * aa bb cc - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - // 你的代码，使无序数组 a 变得有序 - for (int i = 0; i < n - 1; i++) { - for (int j = 0; j < n - i - 1; j++) { - if (a[j] > a[j + 1]) { - - int temp = a[j]; - a[j] = a[j + 1]; - a[j + 1] = temp; - } - } - } -} //end \ No newline at end of file diff --git a/codes/sdasr5542/.keep b/codes/sdasr5542/.keep deleted file mode 100644 index e69de29bb2d1d6434b8b29ae775ad8c2e48c5391..0000000000000000000000000000000000000000 diff --git a/codes/sdasr5542/15743114.java b/codes/sdasr5542/15743114.java deleted file mode 100644 index 6e9861fa3ec6d5a2553cdccd1bb1e977430c671b..0000000000000000000000000000000000000000 --- a/codes/sdasr5542/15743114.java +++ /dev/null @@ -1,19 +0,0 @@ -/** - * 冒泡排序函数 - * aa bb cc - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - // 你的代码，使无序数组 a 变得有序 - for (int i = 0; i < n - 1; i++) { - for (int j = 0; j < n - i - 1; j++) { - if (a[j] > a[j + 1]) { - - int temp = a[j]; - a[j] = a[j + 1]; - a[j + 1] = temp; - } - } - } -} //end \ No newline at end of file diff --git a/codes/sdd42424/.keep b/codes/sdd42424/.keep deleted file mode 100644 index e69de29bb2d1d6434b8b29ae775ad8c2e48c5391..0000000000000000000000000000000000000000 diff --git a/codes/sdd42424/15824581.java b/codes/sdd42424/15824581.java deleted file mode 100644 index 6e9861fa3ec6d5a2553cdccd1bb1e977430c671b..0000000000000000000000000000000000000000 --- a/codes/sdd42424/15824581.java +++ /dev/null @@ -1,19 +0,0 @@ -/** - * 冒泡排序函数 - * aa bb cc - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - // 你的代码，使无序数组 a 变得有序 - for (int i = 0; i < n - 1; i++) { - for (int j = 0; j < n - i - 1; j++) { - if (a[j] > a[j + 1]) { - - int temp = a[j]; - a[j] = a[j + 1]; - a[j + 1] = temp; - } - } - } -} //end \ No newline at end of file diff --git a/codes/sdfghfd34/.keep b/codes/sdfghfd34/.keep deleted file mode 100644 index e69de29bb2d1d6434b8b29ae775ad8c2e48c5391..0000000000000000000000000000000000000000 diff --git a/codes/sdfghfd34/15826951.java b/codes/sdfghfd34/15826951.java deleted file mode 100644 index 6e9861fa3ec6d5a2553cdccd1bb1e977430c671b..0000000000000000000000000000000000000000 --- a/codes/sdfghfd34/15826951.java +++ /dev/null @@ -1,19 +0,0 @@ -/** - * 冒泡排序函数 - * aa bb cc - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - // 你的代码，使无序数组 a 变得有序 - for (int i = 0; i < n - 1; i++) { - for (int j = 0; j < n - i - 1; j++) { - if (a[j] > a[j + 1]) { - - int temp = a[j]; - a[j] = a[j + 1]; - a[j + 1] = temp; - } - } - } -} //end \ No newline at end of file diff --git a/codes/sdg56sdfasf/.keep b/codes/sdg56sdfasf/.keep deleted file mode 100644 index e69de29bb2d1d6434b8b29ae775ad8c2e48c5391..0000000000000000000000000000000000000000 diff --git a/codes/sdg56sdfasf/15831417.java b/codes/sdg56sdfasf/15831417.java deleted file mode 100644 index 6e9861fa3ec6d5a2553cdccd1bb1e977430c671b..0000000000000000000000000000000000000000 --- a/codes/sdg56sdfasf/15831417.java +++ /dev/null @@ -1,19 +0,0 @@ -/** - * 冒泡排序函数 - * aa bb cc - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - // 你的代码，使无序数组 a 变得有序 - for (int i = 0; i < n - 1; i++) { - for (int j = 0; j < n - i - 1; j++) { - if (a[j] > a[j + 1]) { - - int temp = a[j]; - a[j] = a[j + 1]; - a[j + 1] = temp; - } - } - } -} //end \ No newline at end of file diff --git a/codes/sdsacc23/.keep b/codes/sdsacc23/.keep deleted file mode 100644 index e69de29bb2d1d6434b8b29ae775ad8c2e48c5391..0000000000000000000000000000000000000000 diff --git a/codes/sdsacc23/15825736.java b/codes/sdsacc23/15825736.java deleted file mode 100644 index 6e9861fa3ec6d5a2553cdccd1bb1e977430c671b..0000000000000000000000000000000000000000 --- a/codes/sdsacc23/15825736.java +++ /dev/null @@ -1,19 +0,0 @@ -/** - * 冒泡排序函数 - * aa bb cc - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - // 你的代码，使无序数组 a 变得有序 - for (int i = 0; i < n - 1; i++) { - for (int j = 0; j < n - i - 1; j++) { - if (a[j] > a[j + 1]) { - - int temp = a[j]; - a[j] = a[j + 1]; - a[j + 1] = temp; - } - } - } -} //end \ No newline at end of file diff --git a/codes/sdt345sdfs/.keep b/codes/sdt345sdfs/.keep deleted file mode 100644 index e69de29bb2d1d6434b8b29ae775ad8c2e48c5391..0000000000000000000000000000000000000000 diff --git a/codes/sdt345sdfs/15743451.java b/codes/sdt345sdfs/15743451.java deleted file mode 100644 index 6e9861fa3ec6d5a2553cdccd1bb1e977430c671b..0000000000000000000000000000000000000000 --- a/codes/sdt345sdfs/15743451.java +++ /dev/null @@ -1,19 +0,0 @@ -/** - * 冒泡排序函数 - * aa bb cc - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - // 你的代码，使无序数组 a 变得有序 - for (int i = 0; i < n - 1; i++) { - for (int j = 0; j < n - i - 1; j++) { - if (a[j] > a[j + 1]) { - - int temp = a[j]; - a[j] = a[j + 1]; - a[j + 1] = temp; - } - } - } -} //end \ No newline at end of file diff --git a/codes/seebee/16266160.java b/codes/seebee/16266160.java deleted file mode 100644 index 550887741e2a736857304460f47017276217d459..0000000000000000000000000000000000000000 --- a/codes/seebee/16266160.java +++ /dev/null @@ -1,18 +0,0 @@ -/** - * 冒泡排序函数 - * aa bb cc - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int[] a, int n) { - for (int i = 0; i < n - 1; i++) { - for (int j = 0; j < n - i - 1; j++) { - if (a[j] > a[j + 1]) { - // 交换 a[j] 和 a[j+1] - int temp = a[j]; - a[j] = a[j + 1]; - a[j + 1] = temp; - } - } - } -} diff --git a/codes/selena/11289878.java b/codes/selena/11289878.java deleted file mode 100644 index cdabc2e0876ad629e41ff055727cf3af34be8917..0000000000000000000000000000000000000000 --- a/codes/selena/11289878.java +++ /dev/null @@ -1,20 +0,0 @@ -/** - * 冒泡排序函数 - * aa bb cc - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - // 你的代码，使无序数组 a 变得有序 - for (int i = 0; i < n; i++) { - for (int j = i + 1; j < n; j++) { - if (a[i] > a[j]) { - int temp = a[j]; - a[j] = a[i]; - a[i] = temp; - - } - } - } - -} //end \ No newline at end of file diff --git a/codes/seven/15710966.java b/codes/seven/15710966.java deleted file mode 100644 index c57f5a28e74c7ae4f1e34a718bae3a949a985798..0000000000000000000000000000000000000000 --- a/codes/seven/15710966.java +++ /dev/null @@ -1,22 +0,0 @@ -/** - * 冒泡排序函数 - * 通过对相邻的元素进行两两比较，顺序相反则进行交换，每一轮比较会将当前未排序部分的最大值“冒泡”到未排序部分的末尾。 - * - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int[] a, int n) { - for (int i = 0; i < n - 1; i++) { // 外层循环，控制排序的轮数 - // i 表示当前已经排序好的元素个数，因此每一轮排序后，最大的元素会移到正确的位置 - for (int j = 0; j < n - i - 1; j++) { // 内层循环，控制每轮中比较的次数 - // j 表示当前比较的元素索引，从0开始到n-i-2，因为最后i个元素已经是排序好的 - if (a[j] > a[j + 1]) { // 如果当前元素大于下一个元素 - // 则交换这两个元素的位置，保证较大的元素向数组的末尾移动 - // 交换 a[j] 和 a[j+1] - int temp = a[j]; // 使用临时变量temp存储a[j]的值 - a[j] = a[j + 1]; // 将a[j+1]的值赋给a[j] - a[j + 1] = temp; // 将temp（即原来的a[j]的值）赋给a[j+1] - } - } - } -} // end bubbleSort函数 diff --git a/codes/sevenpppplus/10371725.java b/codes/sevenpppplus/10371725.java deleted file mode 100644 index df0dbf5958c1aaad83774cbae4587bb05295c074..0000000000000000000000000000000000000000 --- a/codes/sevenpppplus/10371725.java +++ /dev/null @@ -1,20 +0,0 @@ - /** - * 冒泡排序函数 - * aa bb cc - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ - public static void bubbleSort(int[] a, int n) { - // 你的代码，使无序数组 a 变得有序 - for (int i = 0; i < n - 1; i++) { - for (int j = 0; j < n - 1 - i; j++) { - if (a[j] > a[j + 1]) { - int temp = a[j]; - a[j] = a[j + 1]; - a[j + 1] = temp; - } - } - } - System.out.println("冒泡升序排序后的结果是:"); - for (int j : a) System.out.print(j + " "); - } //end diff --git a/codes/sf35463af/.keep b/codes/sf35463af/.keep deleted file mode 100644 index e69de29bb2d1d6434b8b29ae775ad8c2e48c5391..0000000000000000000000000000000000000000 diff --git a/codes/sf35463af/15831476.java b/codes/sf35463af/15831476.java deleted file mode 100644 index 6e9861fa3ec6d5a2553cdccd1bb1e977430c671b..0000000000000000000000000000000000000000 --- a/codes/sf35463af/15831476.java +++ /dev/null @@ -1,19 +0,0 @@ -/** - * 冒泡排序函数 - * aa bb cc - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - // 你的代码，使无序数组 a 变得有序 - for (int i = 0; i < n - 1; i++) { - for (int j = 0; j < n - i - 1; j++) { - if (a[j] > a[j + 1]) { - - int temp = a[j]; - a[j] = a[j + 1]; - a[j + 1] = temp; - } - } - } -} //end \ No newline at end of file diff --git a/codes/sfaf234214/.keep b/codes/sfaf234214/.keep deleted file mode 100644 index e69de29bb2d1d6434b8b29ae775ad8c2e48c5391..0000000000000000000000000000000000000000 diff --git a/codes/sfaf234214/15831503.java b/codes/sfaf234214/15831503.java deleted file mode 100644 index 6e9861fa3ec6d5a2553cdccd1bb1e977430c671b..0000000000000000000000000000000000000000 --- a/codes/sfaf234214/15831503.java +++ /dev/null @@ -1,19 +0,0 @@ -/** - * 冒泡排序函数 - * aa bb cc - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - // 你的代码，使无序数组 a 变得有序 - for (int i = 0; i < n - 1; i++) { - for (int j = 0; j < n - i - 1; j++) { - if (a[j] > a[j + 1]) { - - int temp = a[j]; - a[j] = a[j + 1]; - a[j + 1] = temp; - } - } - } -} //end \ No newline at end of file diff --git a/codes/sfasffasf2434/.keep b/codes/sfasffasf2434/.keep deleted file mode 100644 index e69de29bb2d1d6434b8b29ae775ad8c2e48c5391..0000000000000000000000000000000000000000 diff --git a/codes/sfasffasf2434/15831014.java b/codes/sfasffasf2434/15831014.java deleted file mode 100644 index 96508c1385b4a62859a2adea3c8dfae39051b7cd..0000000000000000000000000000000000000000 --- a/codes/sfasffasf2434/15831014.java +++ /dev/null @@ -1,19 +0,0 @@ -/** - * 冒泡排序函数 - * aa bb cc - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - // 你的代码，使无序数组 a 变得有序 - for (int i = 0; i < n - 1; i++) { - for (int j = 0; j < n - i - 1; j++) { - if (a[j] > a[j + 1]) { - - int temp = a[j]; - a[j] = a[j + 1]; - a[j + 1] = temp; - } - } - } -} //end \ No newline at end of file diff --git a/codes/sfccwad902/.keep b/codes/sfccwad902/.keep deleted file mode 100644 index e69de29bb2d1d6434b8b29ae775ad8c2e48c5391..0000000000000000000000000000000000000000 diff --git a/codes/sfccwad902/15826644.java b/codes/sfccwad902/15826644.java deleted file mode 100644 index 6e9861fa3ec6d5a2553cdccd1bb1e977430c671b..0000000000000000000000000000000000000000 --- a/codes/sfccwad902/15826644.java +++ /dev/null @@ -1,19 +0,0 @@ -/** - * 冒泡排序函数 - * aa bb cc - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - // 你的代码，使无序数组 a 变得有序 - for (int i = 0; i < n - 1; i++) { - for (int j = 0; j < n - i - 1; j++) { - if (a[j] > a[j + 1]) { - - int temp = a[j]; - a[j] = a[j + 1]; - a[j + 1] = temp; - } - } - } -} //end \ No newline at end of file diff --git a/codes/sfdafas422/.keep b/codes/sfdafas422/.keep deleted file mode 100644 index e69de29bb2d1d6434b8b29ae775ad8c2e48c5391..0000000000000000000000000000000000000000 diff --git a/codes/sfdafas422/15743380.java b/codes/sfdafas422/15743380.java deleted file mode 100644 index 6e9861fa3ec6d5a2553cdccd1bb1e977430c671b..0000000000000000000000000000000000000000 --- a/codes/sfdafas422/15743380.java +++ /dev/null @@ -1,19 +0,0 @@ -/** - * 冒泡排序函数 - * aa bb cc - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - // 你的代码，使无序数组 a 变得有序 - for (int i = 0; i < n - 1; i++) { - for (int j = 0; j < n - i - 1; j++) { - if (a[j] > a[j + 1]) { - - int temp = a[j]; - a[j] = a[j + 1]; - a[j + 1] = temp; - } - } - } -} //end \ No newline at end of file diff --git a/codes/sgdfg56/.keep b/codes/sgdfg56/.keep deleted file mode 100644 index e69de29bb2d1d6434b8b29ae775ad8c2e48c5391..0000000000000000000000000000000000000000 diff --git a/codes/sgdfg56/15743475.java b/codes/sgdfg56/15743475.java deleted file mode 100644 index 6e9861fa3ec6d5a2553cdccd1bb1e977430c671b..0000000000000000000000000000000000000000 --- a/codes/sgdfg56/15743475.java +++ /dev/null @@ -1,19 +0,0 @@ -/** - * 冒泡排序函数 - * aa bb cc - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - // 你的代码，使无序数组 a 变得有序 - for (int i = 0; i < n - 1; i++) { - for (int j = 0; j < n - i - 1; j++) { - if (a[j] > a[j + 1]) { - - int temp = a[j]; - a[j] = a[j + 1]; - a[j + 1] = temp; - } - } - } -} //end \ No newline at end of file diff --git a/codes/sgdfgw234/.keep b/codes/sgdfgw234/.keep deleted file mode 100644 index e69de29bb2d1d6434b8b29ae775ad8c2e48c5391..0000000000000000000000000000000000000000 diff --git a/codes/sgdfgw234/15829828.java b/codes/sgdfgw234/15829828.java deleted file mode 100644 index 6e9861fa3ec6d5a2553cdccd1bb1e977430c671b..0000000000000000000000000000000000000000 --- a/codes/sgdfgw234/15829828.java +++ /dev/null @@ -1,19 +0,0 @@ -/** - * 冒泡排序函数 - * aa bb cc - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - // 你的代码，使无序数组 a 变得有序 - for (int i = 0; i < n - 1; i++) { - for (int j = 0; j < n - i - 1; j++) { - if (a[j] > a[j + 1]) { - - int temp = a[j]; - a[j] = a[j + 1]; - a[j + 1] = temp; - } - } - } -} //end \ No newline at end of file diff --git a/codes/shangxing117/.keep b/codes/shangxing117/.keep deleted file mode 100644 index e69de29bb2d1d6434b8b29ae775ad8c2e48c5391..0000000000000000000000000000000000000000 diff --git a/codes/shangxing117/15742267.java b/codes/shangxing117/15742267.java deleted file mode 100644 index 6e9861fa3ec6d5a2553cdccd1bb1e977430c671b..0000000000000000000000000000000000000000 --- a/codes/shangxing117/15742267.java +++ /dev/null @@ -1,19 +0,0 @@ -/** - * 冒泡排序函数 - * aa bb cc - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - // 你的代码，使无序数组 a 变得有序 - for (int i = 0; i < n - 1; i++) { - for (int j = 0; j < n - i - 1; j++) { - if (a[j] > a[j + 1]) { - - int temp = a[j]; - a[j] = a[j + 1]; - a[j + 1] = temp; - } - } - } -} //end \ No newline at end of file diff --git a/codes/shankailun10/.keep b/codes/shankailun10/.keep deleted file mode 100644 index e69de29bb2d1d6434b8b29ae775ad8c2e48c5391..0000000000000000000000000000000000000000 diff --git a/codes/shankailun10/9637756.java b/codes/shankailun10/9637756.java deleted file mode 100644 index 4dbc26599d1e20a8b21ed0d6059220f57eae9762..0000000000000000000000000000000000000000 --- a/codes/shankailun10/9637756.java +++ /dev/null @@ -1,22 +0,0 @@ -/** - * 冒泡排序函数 - * 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 diff --git a/codes/shankailun10/9638206.java b/codes/shankailun10/9638206.java deleted file mode 100644 index 4dbc26599d1e20a8b21ed0d6059220f57eae9762..0000000000000000000000000000000000000000 --- a/codes/shankailun10/9638206.java +++ /dev/null @@ -1,22 +0,0 @@ -/** - * 冒泡排序函数 - * 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 diff --git a/codes/shankailun10/9682326.java b/codes/shankailun10/9682326.java deleted file mode 100644 index 4dbc26599d1e20a8b21ed0d6059220f57eae9762..0000000000000000000000000000000000000000 --- a/codes/shankailun10/9682326.java +++ /dev/null @@ -1,22 +0,0 @@ -/** - * 冒泡排序函数 - * 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 diff --git a/codes/sharpery/15562912.java b/codes/sharpery/15562912.java deleted file mode 100644 index c2afaa2414da1853e4500b02c6de9068b64aeafe..0000000000000000000000000000000000000000 --- a/codes/sharpery/15562912.java +++ /dev/null @@ -1,18 +0,0 @@ -/** - * 冒泡排序函数 - * aa bb cc - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - for(int i = 0; i < n-1 ; i++){ - for (int j = 0;j < n-1-i;j++){ - if(a[j] > a[j+1]){ - int temp = a[j]; - a[j] = a[j+1]; - a[j+1] = temp; - } - } - } - -} //end diff --git a/codes/shelly/9674981.java b/codes/shelly/9674981.java deleted file mode 100644 index 7aa905f3acb901a1a470d411df1ce71f7e107a4f..0000000000000000000000000000000000000000 --- a/codes/shelly/9674981.java +++ /dev/null @@ -1,24 +0,0 @@ -/** - * 冒泡排序函数 - * aa bb cc - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - // 你的代码，使无序数组 a 变得有序 - for(int j=0;ja[i+1]) - { - temp=a[i]; - a[i]=a[i+1]; - a[i+1]=temp; - } - } - } - //System.out.println(a); - -} //end diff --git a/codes/shelove/11217672.java b/codes/shelove/11217672.java deleted file mode 100644 index 272a12fc81d3dd0e857bba9ae001c15818fb7123..0000000000000000000000000000000000000000 --- a/codes/shelove/11217672.java +++ /dev/null @@ -1,18 +0,0 @@ - /** - * 冒泡排序函数 - * aa bb cc - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ - public static void bubbleSort(int [] arr, int n){ - // 你的代码，使无序数组 a 变得有序 - for (int i = 0; i < n; i++) { - for (int j = (i + 1); j < n; j++) { - if (arr[i] > arr[j]) { - int temp = arr[i]; - arr[i] = arr[j]; - arr[j] = temp; - } - } - } - } //end \ No newline at end of file diff --git a/codes/shenshenwa/15846503.java b/codes/shenshenwa/15846503.java deleted file mode 100644 index 987377810b5beca8eb4bf5eafeee5db45e234a87..0000000000000000000000000000000000000000 --- a/codes/shenshenwa/15846503.java +++ /dev/null @@ -1,20 +0,0 @@ -/** - * 冒泡排序函数 - * aa bb cc - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - // 你的代码，使无序数组 a 变得有序 - for(int i = 0; i < n; i++) { - for(int liuy = 0; liuy < n - i - 1; liuy++) { - if(a[liuy] > a[liuy + 1]) { - int temp = a[liuy]; - a [liuy] = a[liuy + 1]; - a[liuy + 1] = temp; - } - } - } - - -} //end,liuy diff --git a/codes/sherlinz0/9688047.java b/codes/sherlinz0/9688047.java deleted file mode 100644 index e7fed9e2f87e3b2ecafefc27f94ae0c7843dae8a..0000000000000000000000000000000000000000 --- a/codes/sherlinz0/9688047.java +++ /dev/null @@ -1,18 +0,0 @@ -/** - * 冒泡排序函数 - * aa bb cc - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - // 你的代码，使无序数组 a 变得有序 - for(int i = 0; i < n - 1; i++){ - for(int j = 0; j < n - i - 1; j++){ - if(a[j] > a[j + 1]) { - int t = a[j]; - a[j] = a[j + 1]; - a[j + 1] = t; - } - } - } -} //end diff --git a/codes/shiguang173/15759081.java b/codes/shiguang173/15759081.java deleted file mode 100644 index 76cbddd876f8669466e0a2651682cee667741713..0000000000000000000000000000000000000000 --- a/codes/shiguang173/15759081.java +++ /dev/null @@ -1,20 +0,0 @@ -/** - * 冒泡排序函数 - * aa bb cc - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - // 你的代码，使无序数组 a 变得有序 - for(int i = 0; i < n; i++) { - for(int b = 0; b < n - i - 1; b++) { - if(a[b] > a[b + 1]) { - int temp = a[b]; - a [b] = a[b + 1]; - a[b + 1] = temp; - } - } - } - - -} //end diff --git a/codes/shihantao/.keep b/codes/shihantao/.keep deleted file mode 100644 index e69de29bb2d1d6434b8b29ae775ad8c2e48c5391..0000000000000000000000000000000000000000 diff --git a/codes/shihantao/10039704.java b/codes/shihantao/10039704.java deleted file mode 100644 index e3648990e052e84b9e5ca5b1f2e0b460f51565c5..0000000000000000000000000000000000000000 --- a/codes/shihantao/10039704.java +++ /dev/null @@ -1,17 +0,0 @@ - /* 冒泡排序函数 - * aa bb cc - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - // 你的代码，使无序数组 a 变得有序 - for (int i = 0; i < n; i++) { - for (int j = 0; j < i; j++) { - if (a[i] < a[j]) { - int t = a[i]; - a[i] = a[j]; - a[j] = t; - } - } - } -} //end \ No newline at end of file diff --git a/codes/shihantao1/.keep b/codes/shihantao1/.keep deleted file mode 100644 index e69de29bb2d1d6434b8b29ae775ad8c2e48c5391..0000000000000000000000000000000000000000 diff --git a/codes/shiove/15669581.java b/codes/shiove/15669581.java deleted file mode 100644 index 7b731aa8a6ac71c95b29596dcb437b8becdf2cb7..0000000000000000000000000000000000000000 --- a/codes/shiove/15669581.java +++ /dev/null @@ -1,18 +0,0 @@ -/** - * 冒泡排序函数 - * 对数组进行升序排序 - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - for (int i = 0; i < n - 1; i++) { - for (int j = 0; j < n - 1 - i; j++) { - // 如果前一个元素大于后一个元素，则交换它们的位置 - if (a[j] > a[j + 1]) { - int temp = a[j]; - a[j] = a[j + 1]; - a[j + 1] = temp; - } - } - } -} //end diff --git a/codes/shiyigela/.keep b/codes/shiyigela/.keep deleted file mode 100644 index e69de29bb2d1d6434b8b29ae775ad8c2e48c5391..0000000000000000000000000000000000000000 diff --git a/codes/shiyigela/15758629.java b/codes/shiyigela/15758629.java deleted file mode 100644 index 6426772fb479b07ed3be21ef1867921d1dbb194c..0000000000000000000000000000000000000000 --- a/codes/shiyigela/15758629.java +++ /dev/null @@ -1,20 +0,0 @@ -/** - * 冒泡排序函数 - * aa bb cc - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - // 你的代码，使无序数组 a 变得有序 - for(int i = 0; i < n; i++) { - for(int j = 0; j < n - i - 1; j++) { - if(a[j] > a[j + 1]) { - int temp = a[j]; - a [j] = a[j + 1]; - a[j + 1] = temp; - } - } - } - - -} //end \ No newline at end of file diff --git a/codes/shongz/15517802.java b/codes/shongz/15517802.java deleted file mode 100644 index e98e6cc642a4d33b49c5cde320e32cb7a04b26c7..0000000000000000000000000000000000000000 --- a/codes/shongz/15517802.java +++ /dev/null @@ -1,17 +0,0 @@ -/** - * 冒泡排序函数 - * 该函数实现了冒泡排序算法，将数组中的元素按照从小到大的顺序排列 - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - for (int i = 0; i < n - 1; i++) { // 外层循环，表示遍历所有未排序的元素 - for (int j = 0; j < n - 1 - i; j++) { // 内层循环，用于比较相邻的元素并进行交换 - if (a[j] > a[j + 1]) { // 如果前一个元素大于后一个元素，则交换它们的位置 - int temp = a[j]; - a[j] = a[j + 1]; - a[j + 1] = temp; - } - } - } -} //end diff --git a/codes/shrcc1314/.keep b/codes/shrcc1314/.keep deleted file mode 100644 index e69de29bb2d1d6434b8b29ae775ad8c2e48c5391..0000000000000000000000000000000000000000 diff --git a/codes/shrcc1314/15844211.java b/codes/shrcc1314/15844211.java deleted file mode 100644 index 96508c1385b4a62859a2adea3c8dfae39051b7cd..0000000000000000000000000000000000000000 --- a/codes/shrcc1314/15844211.java +++ /dev/null @@ -1,19 +0,0 @@ -/** - * 冒泡排序函数 - * aa bb cc - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - // 你的代码，使无序数组 a 变得有序 - for (int i = 0; i < n - 1; i++) { - for (int j = 0; j < n - i - 1; j++) { - if (a[j] > a[j + 1]) { - - int temp = a[j]; - a[j] = a[j + 1]; - a[j + 1] = temp; - } - } - } -} //end \ No newline at end of file diff --git a/codes/shuchaoyang/15534407.java b/codes/shuchaoyang/15534407.java deleted file mode 100644 index 46e84220af9670a19aeef8ee10bff62342f00281..0000000000000000000000000000000000000000 --- a/codes/shuchaoyang/15534407.java +++ /dev/null @@ -1,18 +0,0 @@ -/** - * 冒泡排序函数 - * aa bb cc - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - // 你的代码，使无序数组 a 变得有序 - for(int i = 0; i < n-1 ; i++){ - for (int j = 0;j < n-1-i;j++){ - if(a[j] > a[j+1]){ - int temp = a[j]; - a[j] = a[j+1]; - a[j+1] = temp; - } - } - } -} //end diff --git a/codes/shuijiao/15776076.java b/codes/shuijiao/15776076.java deleted file mode 100644 index 987377810b5beca8eb4bf5eafeee5db45e234a87..0000000000000000000000000000000000000000 --- a/codes/shuijiao/15776076.java +++ /dev/null @@ -1,20 +0,0 @@ -/** - * 冒泡排序函数 - * aa bb cc - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - // 你的代码，使无序数组 a 变得有序 - for(int i = 0; i < n; i++) { - for(int liuy = 0; liuy < n - i - 1; liuy++) { - if(a[liuy] > a[liuy + 1]) { - int temp = a[liuy]; - a [liuy] = a[liuy + 1]; - a[liuy + 1] = temp; - } - } - } - - -} //end,liuy diff --git a/codes/shunvdouniu/15841229.java b/codes/shunvdouniu/15841229.java deleted file mode 100644 index 4350d9c688805b8a7e92e95e3cee4747e6f525b0..0000000000000000000000000000000000000000 --- a/codes/shunvdouniu/15841229.java +++ /dev/null @@ -1,12 +0,0 @@ -public static void bubbleSort(int[] arr, int length) { - for (int i = 0; i < length - 1; i++) { - for (int j = 0; j < length - i - 1; j++) { - if (arr[j] > arr[j + 1]) { - // 交换 arr[j] 和 arr[j+1] - int temp = arr[j]; - arr[j] = arr[j + 1]; - arr[j + 1] = temp; - } - } - } - } diff --git a/codes/shuoshu131/18614920.java b/codes/shuoshu131/18614920.java deleted file mode 100644 index 52e509ff7e45c05c836487fb1abcc28d231a724d..0000000000000000000000000000000000000000 --- a/codes/shuoshu131/18614920.java +++ /dev/null @@ -1,18 +0,0 @@ -/** - * 冒泡排序函数 - * aa bb cc - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - // 你的代码，使无序数组 a 变得有序 - for (int i = 0; i < n - 1; i++) { - for (int j = 0; j < n - 1 - i; j++) { - if (a[j] > a[j + 1]) { - int temp = a[j]; - a[j] = a[j + 1]; - a[j + 1] = temp; - } - } - } -} //end diff --git a/codes/shuyiyi/15683952.java b/codes/shuyiyi/15683952.java deleted file mode 100644 index 54c5f3869cd16ee9e7c2b77895a39fae63f05dbc..0000000000000000000000000000000000000000 --- a/codes/shuyiyi/15683952.java +++ /dev/null @@ -1,20 +0,0 @@ -/** - * 冒泡排序函数 - * aa bb cc - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - // 你的代码，使无序数组 a 变得有序 - for(int i = 0; i < n; i++) { - for(int liuy = 0; liuy < n - i - 1; liuy++) { - if(a[liuy] > a[liuy + 1]) { - int temp = a[liuy]; - a [liuy] = a[liuy + 1]; - a[liuy + 1] = temp; - } - } - } - - -} //end,liuy \ No newline at end of file diff --git a/codes/sianjen/10330887.java b/codes/sianjen/10330887.java deleted file mode 100644 index efa6ab36f534da0ba9a330a190ed73f88df93254..0000000000000000000000000000000000000000 --- a/codes/sianjen/10330887.java +++ /dev/null @@ -1,19 +0,0 @@ -/** - * 冒泡排序函数 - * aa bb cc - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - // 你的代码，使无序数组 a 变得有序 - for (int i=0;ia[j+1]){ - int temp=a[j]; - a[j]=a[j+1]; - a[j+1]=temp; - } - } - } - -} //end diff --git a/codes/sichen123/15721908.java b/codes/sichen123/15721908.java deleted file mode 100644 index 987377810b5beca8eb4bf5eafeee5db45e234a87..0000000000000000000000000000000000000000 --- a/codes/sichen123/15721908.java +++ /dev/null @@ -1,20 +0,0 @@ -/** - * 冒泡排序函数 - * aa bb cc - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - // 你的代码，使无序数组 a 变得有序 - for(int i = 0; i < n; i++) { - for(int liuy = 0; liuy < n - i - 1; liuy++) { - if(a[liuy] > a[liuy + 1]) { - int temp = a[liuy]; - a [liuy] = a[liuy + 1]; - a[liuy + 1] = temp; - } - } - } - - -} //end,liuy diff --git a/codes/silverSmith/15774806.java b/codes/silverSmith/15774806.java deleted file mode 100644 index 7745e0a985929e07369be8492b55233947d78c01..0000000000000000000000000000000000000000 --- a/codes/silverSmith/15774806.java +++ /dev/null @@ -1,20 +0,0 @@ -/** - * 冒泡排序函数 - * 通过相邻元素两两比较，将较大的元素交换到数组的末尾，经过多轮比较后，整个数组变得有序。 - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int[] a, int n) { - for (int i = 0; i < n - 1; i++) { - // 每一轮排序，最后一个元素已经是最大的，所以不需要再比较 - for (int j = 0; j < n - 1 - i; j++) { - // 如果当前元素大于下一个元素，则交换它们的位置 - if (a[j] > a[j + 1]) { - // 交换a[j]和a[j+1] - int temp = a[j]; - a[j] = a[j + 1]; - a[j + 1] = temp; - } - } - } -} //end diff --git a/codes/siqiwang/.keep b/codes/siqiwang/.keep deleted file mode 100644 index e69de29bb2d1d6434b8b29ae775ad8c2e48c5391..0000000000000000000000000000000000000000 diff --git a/codes/siqiwang/15311318.java b/codes/siqiwang/15311318.java deleted file mode 100644 index 343fcd48366acf1c442cc3c54da0deb903bde96b..0000000000000000000000000000000000000000 --- a/codes/siqiwang/15311318.java +++ /dev/null @@ -1,18 +0,0 @@ - /** - * 冒泡排序函数 - * aa bb cc - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ - public static void bubbleSort(int [] arr, int n){ - // 你的代码，使无序数组 a 变得有序 - for (int i = 0; i < n; i++) { - for (int j = (i + 1); j < n; j++) { - if (arr[i] > arr[j]) { - int temp = arr[i]; - arr[i] = arr[j]; - arr[j] = temp; - } - } - } - } //end \ No newline at end of file diff --git a/codes/sisiya/15723000.java b/codes/sisiya/15723000.java deleted file mode 100644 index 987377810b5beca8eb4bf5eafeee5db45e234a87..0000000000000000000000000000000000000000 --- a/codes/sisiya/15723000.java +++ /dev/null @@ -1,20 +0,0 @@ -/** - * 冒泡排序函数 - * aa bb cc - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - // 你的代码，使无序数组 a 变得有序 - for(int i = 0; i < n; i++) { - for(int liuy = 0; liuy < n - i - 1; liuy++) { - if(a[liuy] > a[liuy + 1]) { - int temp = a[liuy]; - a [liuy] = a[liuy + 1]; - a[liuy + 1] = temp; - } - } - } - - -} //end,liuy diff --git a/codes/siwuge2/.keep b/codes/siwuge2/.keep deleted file mode 100644 index e69de29bb2d1d6434b8b29ae775ad8c2e48c5391..0000000000000000000000000000000000000000 diff --git a/codes/siwuge2/15720932.java b/codes/siwuge2/15720932.java deleted file mode 100644 index 6426772fb479b07ed3be21ef1867921d1dbb194c..0000000000000000000000000000000000000000 --- a/codes/siwuge2/15720932.java +++ /dev/null @@ -1,20 +0,0 @@ -/** - * 冒泡排序函数 - * aa bb cc - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - // 你的代码，使无序数组 a 变得有序 - for(int i = 0; i < n; i++) { - for(int j = 0; j < n - i - 1; j++) { - if(a[j] > a[j + 1]) { - int temp = a[j]; - a [j] = a[j + 1]; - a[j + 1] = temp; - } - } - } - - -} //end \ No newline at end of file diff --git a/codes/sjms1u2n3s4h5/10104996.java b/codes/sjms1u2n3s4h5/10104996.java deleted file mode 100644 index ea1a4cbb7b6f40305a958a39f1cc8bd69bcc9f84..0000000000000000000000000000000000000000 --- a/codes/sjms1u2n3s4h5/10104996.java +++ /dev/null @@ -1,21 +0,0 @@ -/** - * 冒泡排序函数 - * aa bb cc - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - // 你的代码，使无序数组 a 变得有序 - int temp = 0; - for(int i=0; ii; j--) - { - if(a[j] < a[j-1]) - { - temp = a[j]; - a[j] = a[j-1]; - a[j-1] = temp; - } - } - -} //end diff --git a/codes/sk1234/15778693.java b/codes/sk1234/15778693.java deleted file mode 100644 index de89a751745b09c9b720ed241246c19168d006f3..0000000000000000000000000000000000000000 --- a/codes/sk1234/15778693.java +++ /dev/null @@ -1,18 +0,0 @@ -/** - * 冒泡排序函数 - * 对数组a进行升序排序 - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - for (int i = 0; i < n - 1; i++) { - for (int j = 0; j < n - 1 - i; j++) { - if (a[j] > a[j + 1]) { - // 交换a[j]和a[j+1] - int temp = a[j]; - a[j] = a[j + 1]; - a[j + 1] = temp; - } - } - } -} //end diff --git a/codes/sk123456/15858299.java b/codes/sk123456/15858299.java deleted file mode 100644 index 271d2f1dfec9c226694fa24afe300e49f150ca51..0000000000000000000000000000000000000000 --- a/codes/sk123456/15858299.java +++ /dev/null @@ -1,18 +0,0 @@ -/** - * 冒泡排序函数 - * 将数组a按照从小到大的顺序排序 - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int[] a, int n) { - for (int i = 0; i < n - 1; i++) { // 外层循环，决定冒泡的趟数 - for (int j = 0; j < n - 1 - i; j++) { // 内层循环，决定每趟比较的次数 - if (a[j] > a[j + 1]) { // 如果当前元素大于下一个元素，则交换它们的位置 - // 交换a[j]和a[j + 1] - int temp = a[j]; - a[j] = a[j + 1]; - a[j + 1] = temp; - } - } - } -} // end diff --git a/codes/skysky/15776206.java b/codes/skysky/15776206.java deleted file mode 100644 index 987377810b5beca8eb4bf5eafeee5db45e234a87..0000000000000000000000000000000000000000 --- a/codes/skysky/15776206.java +++ /dev/null @@ -1,20 +0,0 @@ -/** - * 冒泡排序函数 - * aa bb cc - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - // 你的代码，使无序数组 a 变得有序 - for(int i = 0; i < n; i++) { - for(int liuy = 0; liuy < n - i - 1; liuy++) { - if(a[liuy] > a[liuy + 1]) { - int temp = a[liuy]; - a [liuy] = a[liuy + 1]; - a[liuy + 1] = temp; - } - } - } - - -} //end,liuy diff --git a/codes/slamer/11242607.java b/codes/slamer/11242607.java deleted file mode 100644 index cdabc2e0876ad629e41ff055727cf3af34be8917..0000000000000000000000000000000000000000 --- a/codes/slamer/11242607.java +++ /dev/null @@ -1,20 +0,0 @@ -/** - * 冒泡排序函数 - * aa bb cc - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - // 你的代码，使无序数组 a 变得有序 - for (int i = 0; i < n; i++) { - for (int j = i + 1; j < n; j++) { - if (a[i] > a[j]) { - int temp = a[j]; - a[j] = a[i]; - a[i] = temp; - - } - } - } - -} //end \ No newline at end of file diff --git a/codes/smartpulse/.keep b/codes/smartpulse/.keep deleted file mode 100644 index e69de29bb2d1d6434b8b29ae775ad8c2e48c5391..0000000000000000000000000000000000000000 diff --git a/codes/smartpulse/15774449.java b/codes/smartpulse/15774449.java deleted file mode 100644 index 6426772fb479b07ed3be21ef1867921d1dbb194c..0000000000000000000000000000000000000000 --- a/codes/smartpulse/15774449.java +++ /dev/null @@ -1,20 +0,0 @@ -/** - * 冒泡排序函数 - * aa bb cc - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - // 你的代码，使无序数组 a 变得有序 - for(int i = 0; i < n; i++) { - for(int j = 0; j < n - i - 1; j++) { - if(a[j] > a[j + 1]) { - int temp = a[j]; - a [j] = a[j + 1]; - a[j + 1] = temp; - } - } - } - - -} //end \ No newline at end of file diff --git a/codes/smcO0O/.java b/codes/smcO0O/.java deleted file mode 100644 index 8b137891791fe96927ad78e64b0aad7bded08bdc..0000000000000000000000000000000000000000 --- a/codes/smcO0O/.java +++ /dev/null @@ -1 +0,0 @@ - diff --git a/codes/smcO0O/10708545.java b/codes/smcO0O/10708545.java deleted file mode 100644 index c105bd77f4de3a8ee4d902249aea4a752ea18656..0000000000000000000000000000000000000000 --- a/codes/smcO0O/10708545.java +++ /dev/null @@ -1,21 +0,0 @@ -/** - * 冒泡排序函数 - * aa bb cc - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - // 你的代码，使无序数组 a 变得有序 - for(int i = 0; i < n - 1; i++){ - for(int j = 0; j < n - 1 - i; j++){ - if(a[j] > a[j + 1]) - { - int swap = 0; - swap = a[j]; - a[j] = a[j+1]; - a[j+1] = swap; - } - } - } - -} //end diff --git a/codes/smesa6/11229202.java b/codes/smesa6/11229202.java deleted file mode 100644 index cdabc2e0876ad629e41ff055727cf3af34be8917..0000000000000000000000000000000000000000 --- a/codes/smesa6/11229202.java +++ /dev/null @@ -1,20 +0,0 @@ -/** - * 冒泡排序函数 - * aa bb cc - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - // 你的代码，使无序数组 a 变得有序 - for (int i = 0; i < n; i++) { - for (int j = i + 1; j < n; j++) { - if (a[i] > a[j]) { - int temp = a[j]; - a[j] = a[i]; - a[i] = temp; - - } - } - } - -} //end \ No newline at end of file diff --git a/codes/snowfog/11357833.java b/codes/snowfog/11357833.java deleted file mode 100644 index 272a12fc81d3dd0e857bba9ae001c15818fb7123..0000000000000000000000000000000000000000 --- a/codes/snowfog/11357833.java +++ /dev/null @@ -1,18 +0,0 @@ - /** - * 冒泡排序函数 - * aa bb cc - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ - public static void bubbleSort(int [] arr, int n){ - // 你的代码，使无序数组 a 变得有序 - for (int i = 0; i < n; i++) { - for (int j = (i + 1); j < n; j++) { - if (arr[i] > arr[j]) { - int temp = arr[i]; - arr[i] = arr[j]; - arr[j] = temp; - } - } - } - } //end \ No newline at end of file diff --git a/codes/solo1017805211/.java b/codes/solo1017805211/.java deleted file mode 100644 index 69b530c28ca21a2b1768df1a9a665415427fe04d..0000000000000000000000000000000000000000 --- a/codes/solo1017805211/.java +++ /dev/null @@ -1,23 +0,0 @@ - -/** - * 冒泡排序函数 - * aa bb cc - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - // 你的代码，使无序数组 a 变得有序 - - for (int i = 0; i < n - 1; i++) { - for (int j = 0; j < n - i - 1; j++) { - if (a[j] > a[j + 1]) { - // 交换 a[j] 和 a[j+1] - int temp = a[j]; - a[j] = a[j + 1]; - a[j + 1] = temp; - } - } - } -} //end - - diff --git a/codes/solo1017805211/16409853.java b/codes/solo1017805211/16409853.java deleted file mode 100644 index 4f26415a3a7cbe77dfac8e393933f8e69cc35845..0000000000000000000000000000000000000000 --- a/codes/solo1017805211/16409853.java +++ /dev/null @@ -1,24 +0,0 @@ - -/** - * 冒泡排序函数 - * aa bb cc - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - // 你的代码，使无序数组 a 变得有序 - - for (int i = 0; i < n - 1; i++) { - for (int j = 0; j < n - i - 1; j++) { - if (a[j] > a[j + 1]) { - // 交换 a[j] 和 a[j+1] - int temp = a[j]; - a[j] = a[j + 1]; - a[j + 1] = temp; - } - } - } -} //end - - - diff --git a/codes/solo1017805211/16441292.java b/codes/solo1017805211/16441292.java deleted file mode 100644 index e690f9a9b055c58bcf8953b26ea0229f1cf29be5..0000000000000000000000000000000000000000 --- a/codes/solo1017805211/16441292.java +++ /dev/null @@ -1,22 +0,0 @@ - -/** - * 冒泡排序函数 - * aa bb cc - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - - for (int i = 0; i < n - 1; i++) { - for (int j = 0; j < n - i - 1; j++) { - if (a[j] > a[j + 1]) { - int temp = a[j]; - a[j] = a[j + 1]; - a[j + 1] = temp; - } - } - } -} //end - - - diff --git a/codes/solo1017805211/16442270.java b/codes/solo1017805211/16442270.java deleted file mode 100644 index af9b35f05cf177bbd34a0f8444ddf3538f21fd27..0000000000000000000000000000000000000000 --- a/codes/solo1017805211/16442270.java +++ /dev/null @@ -1,23 +0,0 @@ - -/** - * 冒泡排序函数 - * aa bb cc - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - - for (int i = 0; i < n - 1; i++) { - for (int j = 0; j < n - i - 1; j++) { - if (a[j] > a[j + 1]) { - // 交换 a[j] 和 a[j+1] - int temp = a[j]; - a[j] = a[j + 1]; - a[j + 1] = temp; - } - } - } -} //end - - - diff --git a/codes/solo1017805211/16445723.java b/codes/solo1017805211/16445723.java deleted file mode 100644 index 0bd357cede16d08f3939a80269d6eecbbe4bd330..0000000000000000000000000000000000000000 --- a/codes/solo1017805211/16445723.java +++ /dev/null @@ -1,20 +0,0 @@ -/** - * 冒泡排序函数 - * aa bb cc - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - // 你的代码，使无序数组 a 变得有序 - - for (int i = 0; i < n - 1; i++) { - for (int j = 0; j < n - i - 1; j++) { - if (a[j] > a[j + 1]) { - // 交换 a[j] 和 a[j+1] - int temp = a[j]; - a[j] = a[j + 1]; - a[j + 1] = temp; - } - } - } -} //end \ No newline at end of file diff --git a/codes/solo1017805211/16558637.java b/codes/solo1017805211/16558637.java deleted file mode 100644 index 0bd357cede16d08f3939a80269d6eecbbe4bd330..0000000000000000000000000000000000000000 --- a/codes/solo1017805211/16558637.java +++ /dev/null @@ -1,20 +0,0 @@ -/** - * 冒泡排序函数 - * aa bb cc - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - // 你的代码，使无序数组 a 变得有序 - - for (int i = 0; i < n - 1; i++) { - for (int j = 0; j < n - i - 1; j++) { - if (a[j] > a[j + 1]) { - // 交换 a[j] 和 a[j+1] - int temp = a[j]; - a[j] = a[j + 1]; - a[j + 1] = temp; - } - } - } -} //end \ No newline at end of file diff --git a/codes/someoneunknown/.keep b/codes/someoneunknown/.keep deleted file mode 100644 index e69de29bb2d1d6434b8b29ae775ad8c2e48c5391..0000000000000000000000000000000000000000 diff --git a/codes/someoneunknown/15815800.java b/codes/someoneunknown/15815800.java deleted file mode 100644 index 6e9861fa3ec6d5a2553cdccd1bb1e977430c671b..0000000000000000000000000000000000000000 --- a/codes/someoneunknown/15815800.java +++ /dev/null @@ -1,19 +0,0 @@ -/** - * 冒泡排序函数 - * aa bb cc - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - // 你的代码，使无序数组 a 变得有序 - for (int i = 0; i < n - 1; i++) { - for (int j = 0; j < n - i - 1; j++) { - if (a[j] > a[j + 1]) { - - int temp = a[j]; - a[j] = a[j + 1]; - a[j + 1] = temp; - } - } - } -} //end \ No newline at end of file diff --git a/codes/sqScripter/.keep b/codes/sqScripter/.keep deleted file mode 100644 index e69de29bb2d1d6434b8b29ae775ad8c2e48c5391..0000000000000000000000000000000000000000 diff --git a/codes/sqScripter/15846693.java b/codes/sqScripter/15846693.java deleted file mode 100644 index 6e9861fa3ec6d5a2553cdccd1bb1e977430c671b..0000000000000000000000000000000000000000 --- a/codes/sqScripter/15846693.java +++ /dev/null @@ -1,19 +0,0 @@ -/** - * 冒泡排序函数 - * aa bb cc - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - // 你的代码，使无序数组 a 变得有序 - for (int i = 0; i < n - 1; i++) { - for (int j = 0; j < n - i - 1; j++) { - if (a[j] > a[j + 1]) { - - int temp = a[j]; - a[j] = a[j + 1]; - a[j + 1] = temp; - } - } - } -} //end \ No newline at end of file diff --git a/codes/ss12wzh/15780057.java b/codes/ss12wzh/15780057.java deleted file mode 100644 index 9123477451afb71c57427f7ed2e4dadd122f7d4d..0000000000000000000000000000000000000000 --- a/codes/ss12wzh/15780057.java +++ /dev/null @@ -1,26 +0,0 @@ -/** - * 冒泡排序函数 - * 冒泡排序是一种简单的排序算法，它重复地走访过要排序的元素，一次比较两个元素，如果他们的顺序错误就把他们交换过来。 - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int[] a, int n) { - for (int i = 0; i < n - 1; i++) { - // 标记是否有交换，用于优化，如果在一趟排序中没有发生交换，则数组已经有序 - boolean swapped = false; - for (int j = 0; j < n - i - 1; j++) { - // 如果前一个元素大于后一个元素，则交换它们 - if (a[j] > a[j + 1]) { - int temp = a[j]; - a[j] = a[j + 1]; - a[j + 1] = temp; - // 发生了交换，标记为true - swapped = true; - } - } - // 如果在一趟排序中没有发生交换，则数组已经有序，可以提前结束 - if (!swapped) { - break; - } - } -} //end diff --git a/codes/ssr88888888/10999180.java b/codes/ssr88888888/10999180.java deleted file mode 100644 index 607a9246394a817e793043af61e051c104c68f46..0000000000000000000000000000000000000000 --- a/codes/ssr88888888/10999180.java +++ /dev/null @@ -1,18 +0,0 @@ -/** - * 冒泡 排序 函数 - * aa bb cc - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - // 你的代码，使无序数组 a 变得有序 - for (int i = 0; i < n; i++) { - for (int j = 0; j < i; j++) { - if (a[i] < a[j]) { - int t = a[i]; - a[i] = a[j]; - a[j] = t; - } - } - } -}//end diff --git a/codes/sssdzh/15830739.java b/codes/sssdzh/15830739.java deleted file mode 100644 index e54f7b633ade570b745b22a5e33b37689b3302ef..0000000000000000000000000000000000000000 --- a/codes/sssdzh/15830739.java +++ /dev/null @@ -1,27 +0,0 @@ -/** - * 冒泡排序函数 - * 遍历数组，通过相邻元素比较和交换，将最大（或最小）的元素逐渐“浮”到数组的一端。 - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - for (int i = 0; i < n - 1; i++) { - // 标记变量，用于检测本次循环是否发生了交换，如果没有交换说明数组已经有序 - boolean swapped = false; - for (int j = 0; j < n - i - 1; j++) { - // 如果当前元素大于下一个元素，则交换它们 - if (a[j] > a[j + 1]) { - // 交换 a[j] 和 a[j+1] - int temp = a[j]; - a[j] = a[j + 1]; - a[j + 1] = temp; - // 标记本次循环发生了交换 - swapped = true; - } - } - // 如果在某一轮循环中没有发生交换，说明数组已经有序，直接退出 - if (!swapped) { - break; - } - } -} //end diff --git a/codes/sssyl547222/15827096.jaba b/codes/sssyl547222/15827096.jaba deleted file mode 100644 index e69de29bb2d1d6434b8b29ae775ad8c2e48c5391..0000000000000000000000000000000000000000 diff --git a/codes/sssyl547222/15827096.java b/codes/sssyl547222/15827096.java deleted file mode 100644 index d0df6489a5a58eb7b4201e8e0d93e002f2a9e0b4..0000000000000000000000000000000000000000 --- a/codes/sssyl547222/15827096.java +++ /dev/null @@ -1,18 +0,0 @@ -/** - * 冒泡排序函数 - * 对数组a进行升序排序 - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - for(int i = 0; i < n - 1; i++){ - for(int j = 0; j < n - 1 - i; j++){ - if(a[j] > a[j + 1]){ - // 交换a[j]和a[j+1] - int temp = a[j]; - a[j] = a[j + 1]; - a[j + 1] = temp; - } - } - } -} //end diff --git a/codes/ssy123/15792965.java b/codes/ssy123/15792965.java deleted file mode 100644 index cf9befa49e98ccbe1d988b8a5353d8a6936cd135..0000000000000000000000000000000000000000 --- a/codes/ssy123/15792965.java +++ /dev/null @@ -1,21 +0,0 @@ -/** - * 冒泡排序函数 - * 该函数对输入的数组进行升序排序 - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int[] a, int n) { - // 遍历所有数组元素 - for (int i = 0; i < n - 1; i++) { - // Last i elements are already in place - for (int j = 0; j < n - i - 1; j++) { - // 如果当前元素大于下一个元素，则交换它们 - if (a[j] > a[j + 1]) { - // 交换 a[j] 和 a[j+1] - int temp = a[j]; - a[j] = a[j + 1]; - a[j + 1] = temp; - } - } - } -} // end diff --git a/codes/ssya12/15718593.java b/codes/ssya12/15718593.java deleted file mode 100644 index 987377810b5beca8eb4bf5eafeee5db45e234a87..0000000000000000000000000000000000000000 --- a/codes/ssya12/15718593.java +++ /dev/null @@ -1,20 +0,0 @@ -/** - * 冒泡排序函数 - * aa bb cc - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - // 你的代码，使无序数组 a 变得有序 - for(int i = 0; i < n; i++) { - for(int liuy = 0; liuy < n - i - 1; liuy++) { - if(a[liuy] > a[liuy + 1]) { - int temp = a[liuy]; - a [liuy] = a[liuy + 1]; - a[liuy + 1] = temp; - } - } - } - - -} //end,liuy diff --git a/codes/steven_0324/15724446.java b/codes/steven_0324/15724446.java deleted file mode 100644 index 23f1972941851fa068cc96dde758fc2decdee46b..0000000000000000000000000000000000000000 --- a/codes/steven_0324/15724446.java +++ /dev/null @@ -1,18 +0,0 @@ -/** - * 冒泡排序函数 - * 该函数用于对整数数组进行升序排序 - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - for (int i = 0; i < n - 1; i++) { - for (int j = 0; j < n - i - 1; j++) { - if (a[j] > a[j + 1]) { - // 如果前一个元素大于后一个元素，则交换它们的位置 - int temp = a[j]; - a[j] = a[j + 1]; - a[j + 1] = temp; - } - } - } -} //end diff --git a/codes/stevenchendy/10044195.java b/codes/stevenchendy/10044195.java deleted file mode 100644 index 3a58202bb9c66c8e83646f483eda20ecd868fe77..0000000000000000000000000000000000000000 --- a/codes/stevenchendy/10044195.java +++ /dev/null @@ -1,25 +0,0 @@ -/** - * 冒泡排序函数 - * aa bb cc - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - // 你的代码，使无序数组 a 变得有序 - for(int i=0;i a[j+1]){ - int temp = a[j]; - a[j] = a[j+1]; - a[j+1] = temp; - } - } - } - -} //end - - - - - - diff --git a/codes/stevending1st/15193096.java b/codes/stevending1st/15193096.java deleted file mode 100644 index 79c1730e4ff0c9fad91986d55cf468a66886ddce..0000000000000000000000000000000000000000 --- a/codes/stevending1st/15193096.java +++ /dev/null @@ -1,17 +0,0 @@ -/** - * 冒泡排序函数 - * aa bb cc - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - for(int i = 0; i < n - 1; i++) { - for(int j = 0; j < n -1 - i; j++) { - if( a[j] > a[j + 1]) { - int temp = a[j+1]; - a[j+1] = a[j]; - a[j] = temp; - } - } - } -} //end diff --git a/codes/subNvue/11264972.java b/codes/subNvue/11264972.java deleted file mode 100644 index 9e7534d4b41cf071c848fa4d5c08c6519526b6e3..0000000000000000000000000000000000000000 --- a/codes/subNvue/11264972.java +++ /dev/null @@ -1,18 +0,0 @@ -/** - * 冒泡 排序 函数 - * aa bb cc - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - // 你的代码，使无序数组 a 变得有序 - for (int i = 0; i < n; i++) { - for (int j = 0; j < i; j++) { - if (a[i] < a[j]) { - int t = a[i]; - a[i] = a[j]; - a[j] = t; - } - } - } -}//end \ No newline at end of file diff --git a/codes/suisuiya/15775252.java b/codes/suisuiya/15775252.java deleted file mode 100644 index 987377810b5beca8eb4bf5eafeee5db45e234a87..0000000000000000000000000000000000000000 --- a/codes/suisuiya/15775252.java +++ /dev/null @@ -1,20 +0,0 @@ -/** - * 冒泡排序函数 - * aa bb cc - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - // 你的代码，使无序数组 a 变得有序 - for(int i = 0; i < n; i++) { - for(int liuy = 0; liuy < n - i - 1; liuy++) { - if(a[liuy] > a[liuy + 1]) { - int temp = a[liuy]; - a [liuy] = a[liuy + 1]; - a[liuy + 1] = temp; - } - } - } - - -} //end,liuy diff --git a/codes/suixin186/15758969.java b/codes/suixin186/15758969.java deleted file mode 100644 index f2b711a46fe664a20752955f5730ee67702ccb8b..0000000000000000000000000000000000000000 --- a/codes/suixin186/15758969.java +++ /dev/null @@ -1,20 +0,0 @@ -/** - * 冒泡排序函数 - * aa bb cc - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - // 你的代码，使无序数组 a 变得有序 - for(int i = 0; i < n; i++) { - for(int huat = 0; huat < n - i - 1; huat++) { - if(a[huat] > a[huat + 1]) { - int temp = a[huat]; - a [huat] = a[huat + 1]; - a[huat + 1] = temp; - } - } - } - - -} //end,huat diff --git a/codes/suiyue97/15816307.java b/codes/suiyue97/15816307.java deleted file mode 100644 index 8a9fb77715574062dc84306babe1fe613d81637f..0000000000000000000000000000000000000000 --- a/codes/suiyue97/15816307.java +++ /dev/null @@ -1,18 +0,0 @@ -/** - * 冒泡排序函数 - * 使用冒泡排序算法对数组进行升序排序 - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - for (int i = 0; i < n - 1; i++) { - for (int j = 0; j < n - i - 1; j++) { - // 如果前一个元素大于后一个元素，则交换它们的位置 - if (a[j] > a[j + 1]) { - int temp = a[j]; - a[j] = a[j + 1]; - a[j + 1] = temp; - } - } - } -} //end diff --git a/codes/sundong/15615609.java b/codes/sundong/15615609.java deleted file mode 100644 index d3167e566374947810dbdac59a0170afb6f17e2a..0000000000000000000000000000000000000000 --- a/codes/sundong/15615609.java +++ /dev/null @@ -1,22 +0,0 @@ -/** - * 冒泡排序函数 - * 通过相邻元素两两比较和交换，将较大的元素逐步“浮”到数组的末尾，实现排序。 - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int[] a, int n) { - // 外层循环控制排序的轮数 - for (int i = 0; i < n - 1; i++) { - // 内层循环控制每轮排序的比较次数 - for (int j = 0; j < n - 1 - i; j++) { - // 如果当前元素大于下一个元素，则交换它们的位置 - if (a[j] > a[j + 1]) { - // 交换 a[j] 和 a[j+1] - int temp = a[j]; - a[j] = a[j + 1]; - a[j + 1] = temp; - } - } - } - // 当所有轮排序完成后，数组 a 变得有序 -} // end diff --git a/codes/sunfei2024/15869590.java b/codes/sunfei2024/15869590.java deleted file mode 100644 index 24f513b3219ac31ac3dcffe774647aa7bfdac254..0000000000000000000000000000000000000000 --- a/codes/sunfei2024/15869590.java +++ /dev/null @@ -1,11 +0,0 @@ -public static void bubbleSort(int [] a, int n){ - for (int i = 0; i < n - 1; i++) { - for (int j = 0; j < n - 1 - i; j++) { - if (a[j] > a[j + 1]) { - int temp = a[j]; - a[j] = a[j + 1]; - a[j + 1] = temp; - } - } - } -} diff --git a/codes/sunjinglei/9956147.java b/codes/sunjinglei/9956147.java deleted file mode 100644 index 2421b8ea296d1bf6cc7965ff16134efa6b97cb4e..0000000000000000000000000000000000000000 --- a/codes/sunjinglei/9956147.java +++ /dev/null @@ -1,17 +0,0 @@ -/** - * 冒泡排序函数 - * aa bb cc - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - for (int i = 0; i < n- 1; i++) { - for (int j = 0; j < n-1 - i; j++) { - if (a[j] > a[j + 1]) { - int temp = a[j]; - a[j] = a[j+1]; - a[j+1] = temp; - } - } - } -} //end diff --git a/codes/sunxiaoke/15838991.java b/codes/sunxiaoke/15838991.java deleted file mode 100644 index 47e0d6efa8bfa49fe95c91537dccda0c09563b63..0000000000000000000000000000000000000000 --- a/codes/sunxiaoke/15838991.java +++ /dev/null @@ -1,18 +0,0 @@ -/** - * 冒泡排序函数 - * 功能：对数组进行升序排序 - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int[] a, int n) { - for (int i = 0; i < n - 1; i++) { // 遍历数组，从第一个元素到倒数第二个元素 - for (int j = 0; j < n - 1 - i; j++) { // 每次比较相邻的元素，最后一个元素已经是当前轮的最大值，无需再比较 - if (a[j] > a[j + 1]) { // 如果前一个元素大于后一个元素，则交换它们的位置 - // 交换 a[j] 和 a[j+1] - int temp = a[j]; - a[j] = a[j + 1]; - a[j + 1] = temp; - } - } - } -} // end diff --git a/codes/sunxiaoshou/15541950.java b/codes/sunxiaoshou/15541950.java deleted file mode 100644 index d6663ea3aec7b12487e70eda00f69b4e138ee78b..0000000000000000000000000000000000000000 --- a/codes/sunxiaoshou/15541950.java +++ /dev/null @@ -1,12 +0,0 @@ -public static void bubbleSort(int [] a,int n){ - for (int i = 0; i < n - 1; i++) { - for (int j = 0; j < n - 1 - i; j++) { - if (a[j] > a[j + 1]) { - // 交换 a[j] 和 a[j+1] - int temp = a[j]; - a[j] = a[j + 1]; - a[j + 1] = temp; - } - } - } -}//end diff --git a/codes/sunys312/10087139.java b/codes/sunys312/10087139.java deleted file mode 100644 index 0557f90f540f8b0c04fb2072d29b81d24b5942ff..0000000000000000000000000000000000000000 --- a/codes/sunys312/10087139.java +++ /dev/null @@ -1,19 +0,0 @@ -/** - * 冒泡排序函数 - * aa bb cc - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - // 你的代码，使无序数组 a 变得有序 - for(int i=0;ia[j+1]) { //每次都是和它的下一个元素比 - int t = a[j]; //符合条件则交换 - a[j] = a[j+1]; - a[j+1] = t; - } - } - } - -} //end diff --git a/codes/suporisom/.keep b/codes/suporisom/.keep deleted file mode 100644 index e69de29bb2d1d6434b8b29ae775ad8c2e48c5391..0000000000000000000000000000000000000000 diff --git a/codes/suporisom/15815852.java b/codes/suporisom/15815852.java deleted file mode 100644 index 6e9861fa3ec6d5a2553cdccd1bb1e977430c671b..0000000000000000000000000000000000000000 --- a/codes/suporisom/15815852.java +++ /dev/null @@ -1,19 +0,0 @@ -/** - * 冒泡排序函数 - * aa bb cc - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - // 你的代码，使无序数组 a 变得有序 - for (int i = 0; i < n - 1; i++) { - for (int j = 0; j < n - i - 1; j++) { - if (a[j] > a[j + 1]) { - - int temp = a[j]; - a[j] = a[j + 1]; - a[j + 1] = temp; - } - } - } -} //end \ No newline at end of file diff --git a/codes/survivor/15602447.java b/codes/survivor/15602447.java deleted file mode 100644 index c2afaa2414da1853e4500b02c6de9068b64aeafe..0000000000000000000000000000000000000000 --- a/codes/survivor/15602447.java +++ /dev/null @@ -1,18 +0,0 @@ -/** - * 冒泡排序函数 - * aa bb cc - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - for(int i = 0; i < n-1 ; i++){ - for (int j = 0;j < n-1-i;j++){ - if(a[j] > a[j+1]){ - int temp = a[j]; - a[j] = a[j+1]; - a[j+1] = temp; - } - } - } - -} //end diff --git a/codes/sushi13075929819/.keep b/codes/sushi13075929819/.keep deleted file mode 100644 index e69de29bb2d1d6434b8b29ae775ad8c2e48c5391..0000000000000000000000000000000000000000 diff --git a/codes/sushi13075929819/10971905.java b/codes/sushi13075929819/10971905.java deleted file mode 100644 index 021bb4e4536312340c366b2810e04b694ed73130..0000000000000000000000000000000000000000 --- a/codes/sushi13075929819/10971905.java +++ /dev/null @@ -1,11 +0,0 @@ -public static void bubbleSort(int [] c, int n) { - for (int i=0 ; ic[j+1]) { - int temp=c[j]; - c[j]=c[j+1]; - c[j+1]=temp; - } - } - } -} diff --git a/codes/susuplus/11211308.java b/codes/susuplus/11211308.java deleted file mode 100644 index 4d7083fe05ce3e6d3fadd59d6d55e2cbc50d546d..0000000000000000000000000000000000000000 --- a/codes/susuplus/11211308.java +++ /dev/null @@ -1,22 +0,0 @@ -/** - * 冒泡排序函数 - * aa bb cc - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - // 你的代码，使无序数组 a 变得有序 - int i, j; - - for(i=0; ia[j]){ - int temp; - temp = a[j-1]; - a[j-1] = a[j]; - a[j] = temp; - } - } - } - -} //end \ No newline at end of file diff --git a/codes/sususu/11260612.java b/codes/sususu/11260612.java deleted file mode 100644 index 1c8889947f924214c71a3c3f202500b4780dc281..0000000000000000000000000000000000000000 --- a/codes/sususu/11260612.java +++ /dev/null @@ -1,11 +0,0 @@ -public static void bubbleSort(int [] a,int n){ - for(int i = 0; i < n-1 ; i++){ - for (int j = 0;j < n-1-i;j++){ - if(a[j] > a[j+1]){ - int temp = a[j]; - a[j] = a[j+1]; - a[j+1] = temp; - } - } - } -} \ No newline at end of file diff --git a/codes/suyingjie/.keep b/codes/suyingjie/.keep deleted file mode 100644 index e69de29bb2d1d6434b8b29ae775ad8c2e48c5391..0000000000000000000000000000000000000000 diff --git a/codes/suyingjie/15845547.java b/codes/suyingjie/15845547.java deleted file mode 100644 index 6426772fb479b07ed3be21ef1867921d1dbb194c..0000000000000000000000000000000000000000 --- a/codes/suyingjie/15845547.java +++ /dev/null @@ -1,20 +0,0 @@ -/** - * 冒泡排序函数 - * aa bb cc - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - // 你的代码，使无序数组 a 变得有序 - for(int i = 0; i < n; i++) { - for(int j = 0; j < n - i - 1; j++) { - if(a[j] > a[j + 1]) { - int temp = a[j]; - a [j] = a[j + 1]; - a[j + 1] = temp; - } - } - } - - -} //end \ No newline at end of file diff --git a/codes/sw12345677/15860800.java b/codes/sw12345677/15860800.java deleted file mode 100644 index 54c5f3869cd16ee9e7c2b77895a39fae63f05dbc..0000000000000000000000000000000000000000 --- a/codes/sw12345677/15860800.java +++ /dev/null @@ -1,20 +0,0 @@ -/** - * 冒泡排序函数 - * aa bb cc - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - // 你的代码，使无序数组 a 变得有序 - for(int i = 0; i < n; i++) { - for(int liuy = 0; liuy < n - i - 1; liuy++) { - if(a[liuy] > a[liuy + 1]) { - int temp = a[liuy]; - a [liuy] = a[liuy + 1]; - a[liuy + 1] = temp; - } - } - } - - -} //end,liuy \ No newline at end of file diff --git a/codes/swgger/11211222.java b/codes/swgger/11211222.java deleted file mode 100644 index 9e7534d4b41cf071c848fa4d5c08c6519526b6e3..0000000000000000000000000000000000000000 --- a/codes/swgger/11211222.java +++ /dev/null @@ -1,18 +0,0 @@ -/** - * 冒泡 排序 函数 - * aa bb cc - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - // 你的代码，使无序数组 a 变得有序 - for (int i = 0; i < n; i++) { - for (int j = 0; j < i; j++) { - if (a[i] < a[j]) { - int t = a[i]; - a[i] = a[j]; - a[j] = t; - } - } - } -}//end \ No newline at end of file diff --git a/codes/sxb1110/15840824.java b/codes/sxb1110/15840824.java deleted file mode 100644 index ae82e695cbfd360050241c3f1f592658c8c1d4e7..0000000000000000000000000000000000000000 --- a/codes/sxb1110/15840824.java +++ /dev/null @@ -1,35 +0,0 @@ -/** - - * 冒泡排序函数 - - * aa bb cc - - * @param a 待排序的数组 - - * @param n 待排序的数组长度 - - */ - -public static void bubbleSort(int [] a, int n){ - - for(int i = 0; i < n-1 ; i++){ - - for (int j = 0;j < n-1-i;j++){ - - if(a[j] > a[j+1]){ - - int temp = a[j]; - - a[j] = a[j+1]; - - a[j+1] = temp; - - } - - } - - } - - - -} //end diff --git a/codes/sym1453052794/15771464.java b/codes/sym1453052794/15771464.java deleted file mode 100644 index ab3d8f390cfa4cee1947d39872e75bac48b3058a..0000000000000000000000000000000000000000 --- a/codes/sym1453052794/15771464.java +++ /dev/null @@ -1,11 +0,0 @@ -public static void bubbleSort(int [] a, int n) { - for (int i=0 ; ia[j+1]) { - int temp=a[j]; - a[j]=a[j+1]; - a[j+1]=temp; - } - } - } -} diff --git a/codes/sym1453052794/15821043.java b/codes/sym1453052794/15821043.java deleted file mode 100644 index c2afaa2414da1853e4500b02c6de9068b64aeafe..0000000000000000000000000000000000000000 --- a/codes/sym1453052794/15821043.java +++ /dev/null @@ -1,18 +0,0 @@ -/** - * 冒泡排序函数 - * aa bb cc - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - for(int i = 0; i < n-1 ; i++){ - for (int j = 0;j < n-1-i;j++){ - if(a[j] > a[j+1]){ - int temp = a[j]; - a[j] = a[j+1]; - a[j+1] = temp; - } - } - } - -} //end diff --git a/codes/sym1453052794/15821842.java b/codes/sym1453052794/15821842.java deleted file mode 100644 index 20575dc4ccc75a5bf6af9ea4614fcfa2a84fdeaf..0000000000000000000000000000000000000000 --- a/codes/sym1453052794/15821842.java +++ /dev/null @@ -1,19 +0,0 @@ -/** - * 冒泡排序函数 - * aa bb cc - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - // 你的代码，使无序数组 a 变得有序 - for (int i = 0; i < n - 1; i++) { - for (int j = 0; j < n - i - 1; j++) { - if (a[j] > a[j + 1]) { - // 交换元素 - int temp = a[j]; - a[j] = a[j + 1]; - a[j + 1] = temp; - } - } - } -} //end diff --git a/codes/sym1453052794/15822577.java b/codes/sym1453052794/15822577.java deleted file mode 100644 index 20575dc4ccc75a5bf6af9ea4614fcfa2a84fdeaf..0000000000000000000000000000000000000000 --- a/codes/sym1453052794/15822577.java +++ /dev/null @@ -1,19 +0,0 @@ -/** - * 冒泡排序函数 - * aa bb cc - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - // 你的代码，使无序数组 a 变得有序 - for (int i = 0; i < n - 1; i++) { - for (int j = 0; j < n - i - 1; j++) { - if (a[j] > a[j + 1]) { - // 交换元素 - int temp = a[j]; - a[j] = a[j + 1]; - a[j + 1] = temp; - } - } - } -} //end diff --git a/codes/sym1453052794/15843194.java b/codes/sym1453052794/15843194.java deleted file mode 100644 index 20575dc4ccc75a5bf6af9ea4614fcfa2a84fdeaf..0000000000000000000000000000000000000000 --- a/codes/sym1453052794/15843194.java +++ /dev/null @@ -1,19 +0,0 @@ -/** - * 冒泡排序函数 - * aa bb cc - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - // 你的代码，使无序数组 a 变得有序 - for (int i = 0; i < n - 1; i++) { - for (int j = 0; j < n - i - 1; j++) { - if (a[j] > a[j + 1]) { - // 交换元素 - int temp = a[j]; - a[j] = a[j + 1]; - a[j + 1] = temp; - } - } - } -} //end diff --git a/codes/syst1m/15514292.java b/codes/syst1m/15514292.java deleted file mode 100644 index 20575dc4ccc75a5bf6af9ea4614fcfa2a84fdeaf..0000000000000000000000000000000000000000 --- a/codes/syst1m/15514292.java +++ /dev/null @@ -1,19 +0,0 @@ -/** - * 冒泡排序函数 - * aa bb cc - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - // 你的代码，使无序数组 a 变得有序 - for (int i = 0; i < n - 1; i++) { - for (int j = 0; j < n - i - 1; j++) { - if (a[j] > a[j + 1]) { - // 交换元素 - int temp = a[j]; - a[j] = a[j + 1]; - a[j + 1] = temp; - } - } - } -} //end diff --git a/codes/t1785968235/15860463.java b/codes/t1785968235/15860463.java deleted file mode 100644 index 987377810b5beca8eb4bf5eafeee5db45e234a87..0000000000000000000000000000000000000000 --- a/codes/t1785968235/15860463.java +++ /dev/null @@ -1,20 +0,0 @@ -/** - * 冒泡排序函数 - * aa bb cc - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - // 你的代码，使无序数组 a 变得有序 - for(int i = 0; i < n; i++) { - for(int liuy = 0; liuy < n - i - 1; liuy++) { - if(a[liuy] > a[liuy + 1]) { - int temp = a[liuy]; - a [liuy] = a[liuy + 1]; - a[liuy + 1] = temp; - } - } - } - - -} //end,liuy diff --git a/codes/taishai/.keep b/codes/taishai/.keep deleted file mode 100644 index e69de29bb2d1d6434b8b29ae775ad8c2e48c5391..0000000000000000000000000000000000000000 diff --git a/codes/taishai/15867030.java b/codes/taishai/15867030.java deleted file mode 100644 index 6426772fb479b07ed3be21ef1867921d1dbb194c..0000000000000000000000000000000000000000 --- a/codes/taishai/15867030.java +++ /dev/null @@ -1,20 +0,0 @@ -/** - * 冒泡排序函数 - * aa bb cc - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - // 你的代码，使无序数组 a 变得有序 - for(int i = 0; i < n; i++) { - for(int j = 0; j < n - i - 1; j++) { - if(a[j] > a[j + 1]) { - int temp = a[j]; - a [j] = a[j + 1]; - a[j + 1] = temp; - } - } - } - - -} //end \ No newline at end of file diff --git a/codes/tangda/.keep b/codes/tangda/.keep deleted file mode 100644 index e69de29bb2d1d6434b8b29ae775ad8c2e48c5391..0000000000000000000000000000000000000000 diff --git a/codes/tangda/15764487.java b/codes/tangda/15764487.java deleted file mode 100644 index 6426772fb479b07ed3be21ef1867921d1dbb194c..0000000000000000000000000000000000000000 --- a/codes/tangda/15764487.java +++ /dev/null @@ -1,20 +0,0 @@ -/** - * 冒泡排序函数 - * aa bb cc - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - // 你的代码，使无序数组 a 变得有序 - for(int i = 0; i < n; i++) { - for(int j = 0; j < n - i - 1; j++) { - if(a[j] > a[j + 1]) { - int temp = a[j]; - a [j] = a[j + 1]; - a[j + 1] = temp; - } - } - } - - -} //end \ No newline at end of file diff --git a/codes/tangmingqing1998/11752180.java b/codes/tangmingqing1998/11752180.java deleted file mode 100644 index c732e78f8d4d6ff439c2083fecaaf3b12ef72dd4..0000000000000000000000000000000000000000 --- a/codes/tangmingqing1998/11752180.java +++ /dev/null @@ -1,13 +0,0 @@ -public static void bubbleSort(int[] arr, int n) { - // 冒泡排序 - for (int i = 0; i < n - 1; i++) { - for (int j = 0; j < n - i - 1; j++) { - if (arr[j] > arr[j + 1]) { - // 交换元素 - int temp = arr[j]; - arr[j] = arr[j + 1]; - arr[j + 1] = temp; - } - } - } -} \ No newline at end of file diff --git a/codes/tangxiaoting/15835893.java b/codes/tangxiaoting/15835893.java deleted file mode 100644 index ae82e695cbfd360050241c3f1f592658c8c1d4e7..0000000000000000000000000000000000000000 --- a/codes/tangxiaoting/15835893.java +++ /dev/null @@ -1,35 +0,0 @@ -/** - - * 冒泡排序函数 - - * aa bb cc - - * @param a 待排序的数组 - - * @param n 待排序的数组长度 - - */ - -public static void bubbleSort(int [] a, int n){ - - for(int i = 0; i < n-1 ; i++){ - - for (int j = 0;j < n-1-i;j++){ - - if(a[j] > a[j+1]){ - - int temp = a[j]; - - a[j] = a[j+1]; - - a[j+1] = temp; - - } - - } - - } - - - -} //end diff --git a/codes/taohua/.keep b/codes/taohua/.keep deleted file mode 100644 index e69de29bb2d1d6434b8b29ae775ad8c2e48c5391..0000000000000000000000000000000000000000 diff --git a/codes/taohua/15867385.java b/codes/taohua/15867385.java deleted file mode 100644 index 6426772fb479b07ed3be21ef1867921d1dbb194c..0000000000000000000000000000000000000000 --- a/codes/taohua/15867385.java +++ /dev/null @@ -1,20 +0,0 @@ -/** - * 冒泡排序函数 - * aa bb cc - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - // 你的代码，使无序数组 a 变得有序 - for(int i = 0; i < n; i++) { - for(int j = 0; j < n - i - 1; j++) { - if(a[j] > a[j + 1]) { - int temp = a[j]; - a [j] = a[j + 1]; - a[j + 1] = temp; - } - } - } - - -} //end \ No newline at end of file diff --git a/codes/taoz123/15720694.java b/codes/taoz123/15720694.java deleted file mode 100644 index 987377810b5beca8eb4bf5eafeee5db45e234a87..0000000000000000000000000000000000000000 --- a/codes/taoz123/15720694.java +++ /dev/null @@ -1,20 +0,0 @@ -/** - * 冒泡排序函数 - * aa bb cc - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - // 你的代码，使无序数组 a 变得有序 - for(int i = 0; i < n; i++) { - for(int liuy = 0; liuy < n - i - 1; liuy++) { - if(a[liuy] > a[liuy + 1]) { - int temp = a[liuy]; - a [liuy] = a[liuy + 1]; - a[liuy + 1] = temp; - } - } - } - - -} //end,liuy diff --git a/codes/tdnginx/11207793.java b/codes/tdnginx/11207793.java deleted file mode 100644 index 9e7534d4b41cf071c848fa4d5c08c6519526b6e3..0000000000000000000000000000000000000000 --- a/codes/tdnginx/11207793.java +++ /dev/null @@ -1,18 +0,0 @@ -/** - * 冒泡 排序 函数 - * aa bb cc - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - // 你的代码，使无序数组 a 变得有序 - for (int i = 0; i < n; i++) { - for (int j = 0; j < i; j++) { - if (a[i] < a[j]) { - int t = a[i]; - a[i] = a[j]; - a[j] = t; - } - } - } -}//end \ No newline at end of file diff --git a/codes/techoc/18512141.java b/codes/techoc/18512141.java deleted file mode 100644 index 80a371f7cdacbb1af34ff836de3a0e5bab2ae2c6..0000000000000000000000000000000000000000 --- a/codes/techoc/18512141.java +++ /dev/null @@ -1,20 +0,0 @@ -public static void bubbleSort(int[] a, int n) { - boolean swapped; - for (int i = 0; i < n - 1; i++) { - swapped = false; - for (int j = 0; j < n - 1 - i; j++) { - // 比较相邻元素，如果顺序错误就交换 - if (a[j] > a[j + 1]) { - // 交换 a[j] 和 a[j + 1] - int temp = a[j]; - a[j] = a[j + 1]; - a[j + 1] = temp; - swapped = true; - } - } - // 如果在这一轮排序中没有发生交换，说明数组已经有序，可以提前结束 - if (!swapped) { - break; - } - } -} diff --git a/codes/techstars/.keep b/codes/techstars/.keep deleted file mode 100644 index e69de29bb2d1d6434b8b29ae775ad8c2e48c5391..0000000000000000000000000000000000000000 diff --git a/codes/techstars/15774401.java b/codes/techstars/15774401.java deleted file mode 100644 index 6426772fb479b07ed3be21ef1867921d1dbb194c..0000000000000000000000000000000000000000 --- a/codes/techstars/15774401.java +++ /dev/null @@ -1,20 +0,0 @@ -/** - * 冒泡排序函数 - * aa bb cc - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - // 你的代码，使无序数组 a 变得有序 - for(int i = 0; i < n; i++) { - for(int j = 0; j < n - i - 1; j++) { - if(a[j] > a[j + 1]) { - int temp = a[j]; - a [j] = a[j + 1]; - a[j + 1] = temp; - } - } - } - - -} //end \ No newline at end of file diff --git a/codes/template/11204937.java b/codes/template/11204937.java deleted file mode 100644 index 03e2ce1ac322f11189075c78e3073f785dc5a0fd..0000000000000000000000000000000000000000 --- a/codes/template/11204937.java +++ /dev/null @@ -1,23 +0,0 @@ -/** - * 冒泡排序函数 - * aa bb cc - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - // 你的代码，使无序数组 a 变得有序 - for (int i = 0; i < n-1; i++) { - for (int j = 0; j < n-1-i; j++) { - if (a[j] >= a[j+1]) { - int temp = a[j]; - a[j] = a[j+1]; - a[j+1] = temp; - } - } - } - - System.out.print("冒泡排序的结果是： "); - for (int i : a) { - System.out.print(i + " "); - } -} //end \ No newline at end of file diff --git a/codes/tender/15568442.java b/codes/tender/15568442.java deleted file mode 100644 index 233ced8b3bc1576c50c75a5b08217cf01201a693..0000000000000000000000000000000000000000 --- a/codes/tender/15568442.java +++ /dev/null @@ -1,28 +0,0 @@ -/** - * 冒泡排序函数 - * 通过重复地遍历要排序的数组，比较每对相邻的元素，并在必要时交换它们的位置， - * 遍历数组的工作是重复地进行直到没有再需要交换，也就是说该数组已经排序完成。 - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - for (int i = 0; i < n - 1; i++) { - // 创建一个标志位，用于检测这一趟是否有交换过 - boolean swapped = false; - for (int j = 0; j < n - i - 1; j++) { - // 如果当前元素大于下一个元素，则交换它们 - if (a[j] > a[j + 1]) { - // 交换 a[j] 和 a[j+1] - int temp = a[j]; - a[j] = a[j + 1]; - a[j + 1] = temp; - // 标志位设为 true，表示这一趟发生了交换 - swapped = true; - } - } - // 如果这一趟没有发生交换，说明数组已经有序，可以提前结束排序 - if (!swapped) { - break; - } - } -} //end diff --git a/codes/tfboy168/11207647.java b/codes/tfboy168/11207647.java deleted file mode 100644 index cdabc2e0876ad629e41ff055727cf3af34be8917..0000000000000000000000000000000000000000 --- a/codes/tfboy168/11207647.java +++ /dev/null @@ -1,20 +0,0 @@ -/** - * 冒泡排序函数 - * aa bb cc - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - // 你的代码，使无序数组 a 变得有序 - for (int i = 0; i < n; i++) { - for (int j = i + 1; j < n; j++) { - if (a[i] > a[j]) { - int temp = a[j]; - a[j] = a[i]; - a[i] = temp; - - } - } - } - -} //end \ No newline at end of file diff --git a/codes/tg666tg/15860299.java b/codes/tg666tg/15860299.java deleted file mode 100644 index 987377810b5beca8eb4bf5eafeee5db45e234a87..0000000000000000000000000000000000000000 --- a/codes/tg666tg/15860299.java +++ /dev/null @@ -1,20 +0,0 @@ -/** - * 冒泡排序函数 - * aa bb cc - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - // 你的代码，使无序数组 a 变得有序 - for(int i = 0; i < n; i++) { - for(int liuy = 0; liuy < n - i - 1; liuy++) { - if(a[liuy] > a[liuy + 1]) { - int temp = a[liuy]; - a [liuy] = a[liuy + 1]; - a[liuy + 1] = temp; - } - } - } - - -} //end,liuy diff --git a/codes/tgtian/.keep b/codes/tgtian/.keep deleted file mode 100644 index e69de29bb2d1d6434b8b29ae775ad8c2e48c5391..0000000000000000000000000000000000000000 diff --git a/codes/tgtian/15866236.java b/codes/tgtian/15866236.java deleted file mode 100644 index 6426772fb479b07ed3be21ef1867921d1dbb194c..0000000000000000000000000000000000000000 --- a/codes/tgtian/15866236.java +++ /dev/null @@ -1,20 +0,0 @@ -/** - * 冒泡排序函数 - * aa bb cc - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - // 你的代码，使无序数组 a 变得有序 - for(int i = 0; i < n; i++) { - for(int j = 0; j < n - i - 1; j++) { - if(a[j] > a[j + 1]) { - int temp = a[j]; - a [j] = a[j + 1]; - a[j + 1] = temp; - } - } - } - - -} //end \ No newline at end of file diff --git a/codes/theSeven/15555656.java b/codes/theSeven/15555656.java deleted file mode 100644 index aca9c89d081ebdaa9c91e4c35a5ecdc9f2215aab..0000000000000000000000000000000000000000 --- a/codes/theSeven/15555656.java +++ /dev/null @@ -1,19 +0,0 @@ -/** - * 冒泡排序函数 - * aa bb cc - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - // 你的代码，使无序数组 a 变得有序 - for (int i = 0; i < n - 1; i++) { - for (int j = 0; j < n - i - 1; j++) { - if (a[j] > a[j + 1]) { - int temp = a[j]; - a[j] = a[j + 1]; - a[j + 1] = temp; - } - } - } - -} //end diff --git a/codes/thesky11/.keep b/codes/thesky11/.keep deleted file mode 100644 index e69de29bb2d1d6434b8b29ae775ad8c2e48c5391..0000000000000000000000000000000000000000 diff --git a/codes/thesky11/15811112.java b/codes/thesky11/15811112.java deleted file mode 100644 index 6426772fb479b07ed3be21ef1867921d1dbb194c..0000000000000000000000000000000000000000 --- a/codes/thesky11/15811112.java +++ /dev/null @@ -1,20 +0,0 @@ -/** - * 冒泡排序函数 - * aa bb cc - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - // 你的代码，使无序数组 a 变得有序 - for(int i = 0; i < n; i++) { - for(int j = 0; j < n - i - 1; j++) { - if(a[j] > a[j + 1]) { - int temp = a[j]; - a [j] = a[j + 1]; - a[j + 1] = temp; - } - } - } - - -} //end \ No newline at end of file diff --git a/codes/thisisanuo/15720471.java b/codes/thisisanuo/15720471.java deleted file mode 100644 index 3ca4ca932763a4c4917007b3836868da1ce6fac8..0000000000000000000000000000000000000000 --- a/codes/thisisanuo/15720471.java +++ /dev/null @@ -1,20 +0,0 @@ -/** - * 冒泡排序函数 - * 功能：对数组进行升序排序 - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - // 外层循环控制排序趟数 - for (int i = 0; i < n - 1; i++) { - // 内层循环控制每一趟的排序过程 - for (int j = 0; j < n - 1 - i; j++) { - // 如果当前元素大于下一个元素，则交换它们的位置 - if (a[j] > a[j + 1]) { - int temp = a[j]; - a[j] = a[j + 1]; - a[j + 1] = temp; - } - } - } -} //end diff --git a/codes/thisisericq/15715035.java b/codes/thisisericq/15715035.java deleted file mode 100644 index 79d173396fe87eb976257bce169471d147dc1314..0000000000000000000000000000000000000000 --- a/codes/thisisericq/15715035.java +++ /dev/null @@ -1,18 +0,0 @@ -/** - * 冒泡排序函数 - * 通过相邻元素两两比较并交换位置，使较大的元素逐渐“浮”到数组的末尾，从而实现排序。 - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int[] a, int n) { - for (int i = 0; i < n - 1; i++) { // 外层循环控制比较的轮数 - for (int j = 0; j < n - i - 1; j++) { // 内层循环控制每轮的比较次数 - if (a[j] > a[j + 1]) { // 如果前一个元素大于后一个元素，则交换它们的位置 - // 交换 a[j] 和 a[j+1] - int temp = a[j]; - a[j] = a[j + 1]; - a[j + 1] = temp; - } - } - } -} // end diff --git a/codes/thisisluosheng/15730125.java b/codes/thisisluosheng/15730125.java deleted file mode 100644 index 3ca4ca932763a4c4917007b3836868da1ce6fac8..0000000000000000000000000000000000000000 --- a/codes/thisisluosheng/15730125.java +++ /dev/null @@ -1,20 +0,0 @@ -/** - * 冒泡排序函数 - * 功能：对数组进行升序排序 - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - // 外层循环控制排序趟数 - for (int i = 0; i < n - 1; i++) { - // 内层循环控制每一趟的排序过程 - for (int j = 0; j < n - 1 - i; j++) { - // 如果当前元素大于下一个元素，则交换它们的位置 - if (a[j] > a[j + 1]) { - int temp = a[j]; - a[j] = a[j + 1]; - a[j + 1] = temp; - } - } - } -} //end diff --git a/codes/thisislwl/15583856.java b/codes/thisislwl/15583856.java deleted file mode 100644 index c2afaa2414da1853e4500b02c6de9068b64aeafe..0000000000000000000000000000000000000000 --- a/codes/thisislwl/15583856.java +++ /dev/null @@ -1,18 +0,0 @@ -/** - * 冒泡排序函数 - * aa bb cc - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - for(int i = 0; i < n-1 ; i++){ - for (int j = 0;j < n-1-i;j++){ - if(a[j] > a[j+1]){ - int temp = a[j]; - a[j] = a[j+1]; - a[j+1] = temp; - } - } - } - -} //end diff --git a/codes/thisisqlbw/15722233.java b/codes/thisisqlbw/15722233.java deleted file mode 100644 index 3ca4ca932763a4c4917007b3836868da1ce6fac8..0000000000000000000000000000000000000000 --- a/codes/thisisqlbw/15722233.java +++ /dev/null @@ -1,20 +0,0 @@ -/** - * 冒泡排序函数 - * 功能：对数组进行升序排序 - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - // 外层循环控制排序趟数 - for (int i = 0; i < n - 1; i++) { - // 内层循环控制每一趟的排序过程 - for (int j = 0; j < n - 1 - i; j++) { - // 如果当前元素大于下一个元素，则交换它们的位置 - if (a[j] > a[j + 1]) { - int temp = a[j]; - a[j] = a[j + 1]; - a[j + 1] = temp; - } - } - } -} //end diff --git a/codes/thisissmdmy/15724112.java b/codes/thisissmdmy/15724112.java deleted file mode 100644 index 3ca4ca932763a4c4917007b3836868da1ce6fac8..0000000000000000000000000000000000000000 --- a/codes/thisissmdmy/15724112.java +++ /dev/null @@ -1,20 +0,0 @@ -/** - * 冒泡排序函数 - * 功能：对数组进行升序排序 - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - // 外层循环控制排序趟数 - for (int i = 0; i < n - 1; i++) { - // 内层循环控制每一趟的排序过程 - for (int j = 0; j < n - 1 - i; j++) { - // 如果当前元素大于下一个元素，则交换它们的位置 - if (a[j] > a[j + 1]) { - int temp = a[j]; - a[j] = a[j + 1]; - a[j + 1] = temp; - } - } - } -} //end diff --git a/codes/threestones/15517626.java b/codes/threestones/15517626.java deleted file mode 100644 index e55c540a4cba34b5207c25070adaa4dfcef3ad1d..0000000000000000000000000000000000000000 --- a/codes/threestones/15517626.java +++ /dev/null @@ -1,18 +0,0 @@ - /** - * 冒泡排序函数 - * aa bb cc - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] arr, int n){ - // 你的代码，使无序数组 a 变得有序 - for (int i = 0; i < n; i++) { - for (int j = (i + 1); j < n; j++) { - if (arr[i] > arr[j]) { - int temp = arr[i]; - arr[i] = arr[j]; - arr[j] = temp; - } - } - } -} //end diff --git a/codes/tian0311/15831475.java b/codes/tian0311/15831475.java deleted file mode 100644 index b74e1c29d136555a849ff306489d6aa13f3cad29..0000000000000000000000000000000000000000 --- a/codes/tian0311/15831475.java +++ /dev/null @@ -1,26 +0,0 @@ -/** - * 冒泡排序函数 - * 该函数使用冒泡排序算法对数组进行升序排序 - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int[] a, int n) { - for (int i = 0; i < n - 1; i++) { - // 标记是否发生交换，用于优化，如果在内层循环中没有发生交换，说明已经有序 - boolean swapped = false; - for (int j = 0; j < n - i - 1; j++) { - // 如果前一个元素大于后一个元素，则交换它们 - if (a[j] > a[j + 1]) { - int temp = a[j]; - a[j] = a[j + 1]; - a[j + 1] = temp; - // 发生了交换 - swapped = true; - } - } - // 如果在内层循环中没有发生交换，说明已经有序，可以提前结束排序 - if (!swapped) { - break; - } - } -} //end diff --git a/codes/tiandao186/15758999.java b/codes/tiandao186/15758999.java deleted file mode 100644 index f2b711a46fe664a20752955f5730ee67702ccb8b..0000000000000000000000000000000000000000 --- a/codes/tiandao186/15758999.java +++ /dev/null @@ -1,20 +0,0 @@ -/** - * 冒泡排序函数 - * aa bb cc - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - // 你的代码，使无序数组 a 变得有序 - for(int i = 0; i < n; i++) { - for(int huat = 0; huat < n - i - 1; huat++) { - if(a[huat] > a[huat + 1]) { - int temp = a[huat]; - a [huat] = a[huat + 1]; - a[huat + 1] = temp; - } - } - } - - -} //end,huat diff --git a/codes/tingtingya/15775825.java b/codes/tingtingya/15775825.java deleted file mode 100644 index 987377810b5beca8eb4bf5eafeee5db45e234a87..0000000000000000000000000000000000000000 --- a/codes/tingtingya/15775825.java +++ /dev/null @@ -1,20 +0,0 @@ -/** - * 冒泡排序函数 - * aa bb cc - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - // 你的代码，使无序数组 a 变得有序 - for(int i = 0; i < n; i++) { - for(int liuy = 0; liuy < n - i - 1; liuy++) { - if(a[liuy] > a[liuy + 1]) { - int temp = a[liuy]; - a [liuy] = a[liuy + 1]; - a[liuy + 1] = temp; - } - } - } - - -} //end,liuy diff --git a/codes/titita/.keep b/codes/titita/.keep deleted file mode 100644 index e69de29bb2d1d6434b8b29ae775ad8c2e48c5391..0000000000000000000000000000000000000000 diff --git a/codes/titita/15866821.java b/codes/titita/15866821.java deleted file mode 100644 index 6426772fb479b07ed3be21ef1867921d1dbb194c..0000000000000000000000000000000000000000 --- a/codes/titita/15866821.java +++ /dev/null @@ -1,20 +0,0 @@ -/** - * 冒泡排序函数 - * aa bb cc - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - // 你的代码，使无序数组 a 变得有序 - for(int i = 0; i < n; i++) { - for(int j = 0; j < n - i - 1; j++) { - if(a[j] > a[j + 1]) { - int temp = a[j]; - a [j] = a[j + 1]; - a[j + 1] = temp; - } - } - } - - -} //end \ No newline at end of file diff --git a/codes/titiya/15830842.java b/codes/titiya/15830842.java deleted file mode 100644 index 987377810b5beca8eb4bf5eafeee5db45e234a87..0000000000000000000000000000000000000000 --- a/codes/titiya/15830842.java +++ /dev/null @@ -1,20 +0,0 @@ -/** - * 冒泡排序函数 - * aa bb cc - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - // 你的代码，使无序数组 a 变得有序 - for(int i = 0; i < n; i++) { - for(int liuy = 0; liuy < n - i - 1; liuy++) { - if(a[liuy] > a[liuy + 1]) { - int temp = a[liuy]; - a [liuy] = a[liuy + 1]; - a[liuy + 1] = temp; - } - } - } - - -} //end,liuy diff --git a/codes/tjjcdxmy/.keep b/codes/tjjcdxmy/.keep deleted file mode 100644 index e69de29bb2d1d6434b8b29ae775ad8c2e48c5391..0000000000000000000000000000000000000000 diff --git a/codes/tjjcdxmy/15844593.java b/codes/tjjcdxmy/15844593.java deleted file mode 100644 index 6e9861fa3ec6d5a2553cdccd1bb1e977430c671b..0000000000000000000000000000000000000000 --- a/codes/tjjcdxmy/15844593.java +++ /dev/null @@ -1,19 +0,0 @@ -/** - * 冒泡排序函数 - * aa bb cc - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - // 你的代码，使无序数组 a 变得有序 - for (int i = 0; i < n - 1; i++) { - for (int j = 0; j < n - i - 1; j++) { - if (a[j] > a[j + 1]) { - - int temp = a[j]; - a[j] = a[j + 1]; - a[j + 1] = temp; - } - } - } -} //end \ No newline at end of file diff --git a/codes/toutouya/15742811.java b/codes/toutouya/15742811.java deleted file mode 100644 index 987377810b5beca8eb4bf5eafeee5db45e234a87..0000000000000000000000000000000000000000 --- a/codes/toutouya/15742811.java +++ /dev/null @@ -1,20 +0,0 @@ -/** - * 冒泡排序函数 - * aa bb cc - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - // 你的代码，使无序数组 a 变得有序 - for(int i = 0; i < n; i++) { - for(int liuy = 0; liuy < n - i - 1; liuy++) { - if(a[liuy] > a[liuy + 1]) { - int temp = a[liuy]; - a [liuy] = a[liuy + 1]; - a[liuy + 1] = temp; - } - } - } - - -} //end,liuy diff --git a/codes/tr1120753883/15634698.java b/codes/tr1120753883/15634698.java deleted file mode 100644 index 6d56cc245b65789ffc55510e1407e393e8fa8a7a..0000000000000000000000000000000000000000 --- a/codes/tr1120753883/15634698.java +++ /dev/null @@ -1,20 +0,0 @@ -/** - * 冒泡排序函数 - * aa bb cc - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - // 你的代码，使无序数组 a 变得有序 - for(int i = 0; i < n; i++) { - for(int luoluo = 0; luoluo < n - i - 1; luoluo++) { - if(a[luoluo] > a[luoluo + 1]) { - int temp = a[luoluo]; - a [luoluo] = a[luoluo + 1]; - a[luoluo + 1] = temp; - } - } - } - - -} //end,luoluo diff --git a/codes/ttfei123/15719497.java b/codes/ttfei123/15719497.java deleted file mode 100644 index 987377810b5beca8eb4bf5eafeee5db45e234a87..0000000000000000000000000000000000000000 --- a/codes/ttfei123/15719497.java +++ /dev/null @@ -1,20 +0,0 @@ -/** - * 冒泡排序函数 - * aa bb cc - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - // 你的代码，使无序数组 a 变得有序 - for(int i = 0; i < n; i++) { - for(int liuy = 0; liuy < n - i - 1; liuy++) { - if(a[liuy] > a[liuy + 1]) { - int temp = a[liuy]; - a [liuy] = a[liuy + 1]; - a[liuy + 1] = temp; - } - } - } - - -} //end,liuy diff --git a/codes/ttyy23/15846026.java b/codes/ttyy23/15846026.java deleted file mode 100644 index 987377810b5beca8eb4bf5eafeee5db45e234a87..0000000000000000000000000000000000000000 --- a/codes/ttyy23/15846026.java +++ /dev/null @@ -1,20 +0,0 @@ -/** - * 冒泡排序函数 - * aa bb cc - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - // 你的代码，使无序数组 a 变得有序 - for(int i = 0; i < n; i++) { - for(int liuy = 0; liuy < n - i - 1; liuy++) { - if(a[liuy] > a[liuy + 1]) { - int temp = a[liuy]; - a [liuy] = a[liuy + 1]; - a[liuy + 1] = temp; - } - } - } - - -} //end,liuy diff --git a/codes/ttyylb/11228246.java b/codes/ttyylb/11228246.java deleted file mode 100644 index 9e7534d4b41cf071c848fa4d5c08c6519526b6e3..0000000000000000000000000000000000000000 --- a/codes/ttyylb/11228246.java +++ /dev/null @@ -1,18 +0,0 @@ -/** - * 冒泡 排序 函数 - * aa bb cc - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - // 你的代码，使无序数组 a 变得有序 - for (int i = 0; i < n; i++) { - for (int j = 0; j < i; j++) { - if (a[i] < a[j]) { - int t = a[i]; - a[i] = a[j]; - a[j] = t; - } - } - } -}//end \ No newline at end of file diff --git a/codes/tuboshu/.keep b/codes/tuboshu/.keep deleted file mode 100644 index e69de29bb2d1d6434b8b29ae775ad8c2e48c5391..0000000000000000000000000000000000000000 diff --git a/codes/tuboshu/15767771.java b/codes/tuboshu/15767771.java deleted file mode 100644 index 6426772fb479b07ed3be21ef1867921d1dbb194c..0000000000000000000000000000000000000000 --- a/codes/tuboshu/15767771.java +++ /dev/null @@ -1,20 +0,0 @@ -/** - * 冒泡排序函数 - * aa bb cc - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - // 你的代码，使无序数组 a 变得有序 - for(int i = 0; i < n; i++) { - for(int j = 0; j < n - i - 1; j++) { - if(a[j] > a[j + 1]) { - int temp = a[j]; - a [j] = a[j + 1]; - a[j + 1] = temp; - } - } - } - - -} //end \ No newline at end of file diff --git a/codes/tuoera/11301685.java b/codes/tuoera/11301685.java deleted file mode 100644 index cacd12f1e4e4360dd1ffa22f3741e376110bcde4..0000000000000000000000000000000000000000 --- a/codes/tuoera/11301685.java +++ /dev/null @@ -1,18 +0,0 @@ -/** - * 冒泡排序函数 - * aa bb cc - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - // 你的代码，使无序数组 a 变得有序 - for(int i=0;ia[j+1]){ - a[j] = a[j]+a[j+1]; - a[j+1] = a[j]-a[j+1]; - a[j] = a[j]-a[j+1]; - } - } - } -} //end \ No newline at end of file diff --git a/codes/turinglegacy/.keep b/codes/turinglegacy/.keep deleted file mode 100644 index e69de29bb2d1d6434b8b29ae775ad8c2e48c5391..0000000000000000000000000000000000000000 diff --git a/codes/turinglegacy/15775469.java b/codes/turinglegacy/15775469.java deleted file mode 100644 index 6426772fb479b07ed3be21ef1867921d1dbb194c..0000000000000000000000000000000000000000 --- a/codes/turinglegacy/15775469.java +++ /dev/null @@ -1,20 +0,0 @@ -/** - * 冒泡排序函数 - * aa bb cc - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - // 你的代码，使无序数组 a 变得有序 - for(int i = 0; i < n; i++) { - for(int j = 0; j < n - i - 1; j++) { - if(a[j] > a[j + 1]) { - int temp = a[j]; - a [j] = a[j + 1]; - a[j + 1] = temp; - } - } - } - - -} //end \ No newline at end of file diff --git a/codes/txb0318/.15528488.java.swp b/codes/txb0318/.15528488.java.swp deleted file mode 100644 index 93fb79d277edf45d1b90460e29ff67fa6bf0d246..0000000000000000000000000000000000000000 Binary files a/codes/txb0318/.15528488.java.swp and /dev/null differ diff --git a/codes/txb0318/15528488.java b/codes/txb0318/15528488.java deleted file mode 100644 index b722b465a9a6157557acda313e0d97364276cdf8..0000000000000000000000000000000000000000 --- a/codes/txb0318/15528488.java +++ /dev/null @@ -1,20 +0,0 @@ -/** - * 冒泡排序函数 - * aa bb cc - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - // 你的代码，使无序数组 a 变得有序 - int len = a.length; - for(int i = 0 ; i < len - 1 ; i ++){ - for(int j = 0 ; j < len - 1 - i; j++){ - if(a[j] > a[j + 1]){ - int temp = a[j]; - a[j] = a[j+1]; - a[j+1] = temp; - } - } - } - -} diff --git a/codes/uacdtsun/11202127.java b/codes/uacdtsun/11202127.java deleted file mode 100644 index b9bf7818d9ffdce1bf2bd0863a51890bffa3f951..0000000000000000000000000000000000000000 --- a/codes/uacdtsun/11202127.java +++ /dev/null @@ -1,11 +0,0 @@ -public static void bubbleSort(int [] a, int n) { - for (int i=0 ; ia[j+1]) { - int temp=a[j]; - a[j]=a[j+1]; - a[j+1]=temp; - } - } - } -} \ No newline at end of file diff --git a/codes/uasda921/.keep b/codes/uasda921/.keep deleted file mode 100644 index e69de29bb2d1d6434b8b29ae775ad8c2e48c5391..0000000000000000000000000000000000000000 diff --git a/codes/uasda921/15782380.java b/codes/uasda921/15782380.java deleted file mode 100644 index 667eee0f585ec38ce639cb36d80df080e935946d..0000000000000000000000000000000000000000 --- a/codes/uasda921/15782380.java +++ /dev/null @@ -1,11 +0,0 @@ -public static void bubbleSort(int [] a,int n){ - for(int i = 0; i < n-1 ; i++){ - for (int j = 0;j < n-1-i;j++){ - if(a[j] > a[j+1]){ - int temp = a[j]; - a[j] = a[j+1]; - a[j+1] = temp; - } - } - } -} \ No newline at end of file diff --git a/codes/uavjuju/10971568.java b/codes/uavjuju/10971568.java deleted file mode 100644 index ab3d8f390cfa4cee1947d39872e75bac48b3058a..0000000000000000000000000000000000000000 --- a/codes/uavjuju/10971568.java +++ /dev/null @@ -1,11 +0,0 @@ -public static void bubbleSort(int [] a, int n) { - for (int i=0 ; ia[j+1]) { - int temp=a[j]; - a[j]=a[j+1]; - a[j+1]=temp; - } - } - } -} diff --git a/codes/uetvuetv/.keep b/codes/uetvuetv/.keep deleted file mode 100644 index e69de29bb2d1d6434b8b29ae775ad8c2e48c5391..0000000000000000000000000000000000000000 diff --git a/codes/uetvuetv/11207718.java b/codes/uetvuetv/11207718.java deleted file mode 100644 index 83497d9a50b2195c0f83f28598452b59573c98ad..0000000000000000000000000000000000000000 --- a/codes/uetvuetv/11207718.java +++ /dev/null @@ -1,18 +0,0 @@ -/** - * 冒泡 排序 函数 - * aa bb cc - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - // 你的代码，使无序数组 a 变得有序 - for (int i = 0; i < n; i++) { - for (int j = 0; j < i; j++) { - if (a[i] < a[j]) { - int t = a[i]; - a[i] = a[j]; - a[j] = t; - } - } - } -}//end \ No newline at end of file diff --git a/codes/uibottommm/.keep b/codes/uibottommm/.keep deleted file mode 100644 index e69de29bb2d1d6434b8b29ae775ad8c2e48c5391..0000000000000000000000000000000000000000 diff --git a/codes/uibottommm/15844862.java b/codes/uibottommm/15844862.java deleted file mode 100644 index 6e9861fa3ec6d5a2553cdccd1bb1e977430c671b..0000000000000000000000000000000000000000 --- a/codes/uibottommm/15844862.java +++ /dev/null @@ -1,19 +0,0 @@ -/** - * 冒泡排序函数 - * aa bb cc - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - // 你的代码，使无序数组 a 变得有序 - for (int i = 0; i < n - 1; i++) { - for (int j = 0; j < n - i - 1; j++) { - if (a[j] > a[j + 1]) { - - int temp = a[j]; - a[j] = a[j + 1]; - a[j + 1] = temp; - } - } - } -} //end \ No newline at end of file diff --git a/codes/uioplck/11253331.java b/codes/uioplck/11253331.java deleted file mode 100644 index cdabc2e0876ad629e41ff055727cf3af34be8917..0000000000000000000000000000000000000000 --- a/codes/uioplck/11253331.java +++ /dev/null @@ -1,20 +0,0 @@ -/** - * 冒泡排序函数 - * aa bb cc - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - // 你的代码，使无序数组 a 变得有序 - for (int i = 0; i < n; i++) { - for (int j = i + 1; j < n; j++) { - if (a[i] > a[j]) { - int temp = a[j]; - a[j] = a[i]; - a[i] = temp; - - } - } - } - -} //end \ No newline at end of file diff --git a/codes/uiuiya/15772564.java b/codes/uiuiya/15772564.java deleted file mode 100644 index 987377810b5beca8eb4bf5eafeee5db45e234a87..0000000000000000000000000000000000000000 --- a/codes/uiuiya/15772564.java +++ /dev/null @@ -1,20 +0,0 @@ -/** - * 冒泡排序函数 - * aa bb cc - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - // 你的代码，使无序数组 a 变得有序 - for(int i = 0; i < n; i++) { - for(int liuy = 0; liuy < n - i - 1; liuy++) { - if(a[liuy] > a[liuy + 1]) { - int temp = a[liuy]; - a [liuy] = a[liuy + 1]; - a[liuy + 1] = temp; - } - } - } - - -} //end,liuy diff --git a/codes/umiapp/11244024.java b/codes/umiapp/11244024.java deleted file mode 100644 index 7db1ed71c900652c30e8b1c3e9172e685287856a..0000000000000000000000000000000000000000 --- a/codes/umiapp/11244024.java +++ /dev/null @@ -1,11 +0,0 @@ -public static void bubbleSort(int []arr, int n) { - for(int i=0; i < n-1; i++) { - for(int j=0; j < n-i-1; j++) { - if(arr[j]>arr[j+1]) { - int temp = arr[j+1]; - arr[j+1] = arr[j]; - arr[j] = temp; - } - } - } -} \ No newline at end of file diff --git a/codes/uniqueO/11369940.java b/codes/uniqueO/11369940.java deleted file mode 100644 index 8d589d7edfe50246fe5deff283186d81a64dc137..0000000000000000000000000000000000000000 --- a/codes/uniqueO/11369940.java +++ /dev/null @@ -1,21 +0,0 @@ -/** - * 冒泡排序函数 - * aa bb cc - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a,int n){ - int temp =0; - for(int i = 0;ia[j+1]){ - temp = a[j]; - a[j] = a[j+1]; - a[j+1] = temp; - } - } - } - - - -} \ No newline at end of file diff --git a/codes/upgrade/11267063.java b/codes/upgrade/11267063.java deleted file mode 100644 index 9e7534d4b41cf071c848fa4d5c08c6519526b6e3..0000000000000000000000000000000000000000 --- a/codes/upgrade/11267063.java +++ /dev/null @@ -1,18 +0,0 @@ -/** - * 冒泡 排序 函数 - * aa bb cc - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - // 你的代码，使无序数组 a 变得有序 - for (int i = 0; i < n; i++) { - for (int j = 0; j < i; j++) { - if (a[i] < a[j]) { - int t = a[i]; - a[i] = a[j]; - a[j] = t; - } - } - } -}//end \ No newline at end of file diff --git a/codes/user-2352414618/15578257.java b/codes/user-2352414618/15578257.java deleted file mode 100644 index b4a53704066c29418799bf143a2309f0e90fec5a..0000000000000000000000000000000000000000 --- a/codes/user-2352414618/15578257.java +++ /dev/null @@ -1,19 +0,0 @@ -/** - * 冒泡排序函数 - * aa bb cc - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - // 你的代码，使无序数组 a 变得有序 - for(int i=0;ia[j+1]){ - int tmp = a[j]; - a[j] = a[j+1]; - a[j+1] = tmp; - } - } - } - -} //end diff --git a/codes/user-9548709343/14554338.java b/codes/user-9548709343/14554338.java deleted file mode 100644 index 0f6d81b71f67894d2dfd50a9b025b2b125e3f367..0000000000000000000000000000000000000000 --- a/codes/user-9548709343/14554338.java +++ /dev/null @@ -1,20 +0,0 @@ -/** - * 冒泡排序函数 - * aa bb cc - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - // 你的代码，使无序数组 a 变得有序 - for (int i = 0; i < n - 1; i++) { - for (int j = 0; j < n - i - 1; j++) { - if (a[j] > a[j + 1]) { - int temp = a[j]; - a[j] = a[j + 1]; - a[j + 1] = temp; - } - } - } - - -} //end diff --git a/codes/uukkya/15846280.java b/codes/uukkya/15846280.java deleted file mode 100644 index 987377810b5beca8eb4bf5eafeee5db45e234a87..0000000000000000000000000000000000000000 --- a/codes/uukkya/15846280.java +++ /dev/null @@ -1,20 +0,0 @@ -/** - * 冒泡排序函数 - * aa bb cc - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - // 你的代码，使无序数组 a 变得有序 - for(int i = 0; i < n; i++) { - for(int liuy = 0; liuy < n - i - 1; liuy++) { - if(a[liuy] > a[liuy + 1]) { - int temp = a[liuy]; - a [liuy] = a[liuy + 1]; - a[liuy + 1] = temp; - } - } - } - - -} //end,liuy diff --git a/codes/vajiangjiang/15837419.java b/codes/vajiangjiang/15837419.java deleted file mode 100644 index 47e0d6efa8bfa49fe95c91537dccda0c09563b63..0000000000000000000000000000000000000000 --- a/codes/vajiangjiang/15837419.java +++ /dev/null @@ -1,18 +0,0 @@ -/** - * 冒泡排序函数 - * 功能：对数组进行升序排序 - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int[] a, int n) { - for (int i = 0; i < n - 1; i++) { // 遍历数组，从第一个元素到倒数第二个元素 - for (int j = 0; j < n - 1 - i; j++) { // 每次比较相邻的元素，最后一个元素已经是当前轮的最大值，无需再比较 - if (a[j] > a[j + 1]) { // 如果前一个元素大于后一个元素，则交换它们的位置 - // 交换 a[j] 和 a[j+1] - int temp = a[j]; - a[j] = a[j + 1]; - a[j + 1] = temp; - } - } - } -} // end diff --git a/codes/vanguard/.keep b/codes/vanguard/.keep deleted file mode 100644 index e69de29bb2d1d6434b8b29ae775ad8c2e48c5391..0000000000000000000000000000000000000000 diff --git a/codes/vanguard/15772450.java b/codes/vanguard/15772450.java deleted file mode 100644 index 6426772fb479b07ed3be21ef1867921d1dbb194c..0000000000000000000000000000000000000000 --- a/codes/vanguard/15772450.java +++ /dev/null @@ -1,20 +0,0 @@ -/** - * 冒泡排序函数 - * aa bb cc - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - // 你的代码，使无序数组 a 变得有序 - for(int i = 0; i < n; i++) { - for(int j = 0; j < n - i - 1; j++) { - if(a[j] > a[j + 1]) { - int temp = a[j]; - a [j] = a[j + 1]; - a[j + 1] = temp; - } - } - } - - -} //end \ No newline at end of file diff --git a/codes/vermouth001/15833957.java b/codes/vermouth001/15833957.java deleted file mode 100644 index 4d8473847a34f1d6d2b6f63b4bdb888189b415c4..0000000000000000000000000000000000000000 --- a/codes/vermouth001/15833957.java +++ /dev/null @@ -1,26 +0,0 @@ -/** - * 冒泡排序函数 - * 对数组进行升序排序 - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int[] a, int n) { - for (int i = 0; i < n - 1; i++) { - // 标记，表示这一趟是否有交换，优化冒泡排序性能 - boolean swapped = false; - for (int j = 0; j < n - i - 1; j++) { - // 如果前一个元素大于后一个元素，则交换它们 - if (a[j] > a[j + 1]) { - int temp = a[j]; - a[j] = a[j + 1]; - a[j + 1] = temp; - // 发生了交换，标记为true - swapped = true; - } - } - // 如果在内层循环中没有发生交换，说明数组已经有序，提前退出 - if (!swapped) { - break; - } - } -} //end diff --git a/codes/victory2/15555436.java b/codes/victory2/15555436.java deleted file mode 100644 index c2afaa2414da1853e4500b02c6de9068b64aeafe..0000000000000000000000000000000000000000 --- a/codes/victory2/15555436.java +++ /dev/null @@ -1,18 +0,0 @@ -/** - * 冒泡排序函数 - * aa bb cc - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - for(int i = 0; i < n-1 ; i++){ - for (int j = 0;j < n-1-i;j++){ - if(a[j] > a[j+1]){ - int temp = a[j]; - a[j] = a[j+1]; - a[j+1] = temp; - } - } - } - -} //end diff --git a/codes/viewport/11328946.java b/codes/viewport/11328946.java deleted file mode 100644 index 272a12fc81d3dd0e857bba9ae001c15818fb7123..0000000000000000000000000000000000000000 --- a/codes/viewport/11328946.java +++ /dev/null @@ -1,18 +0,0 @@ - /** - * 冒泡排序函数 - * aa bb cc - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ - public static void bubbleSort(int [] arr, int n){ - // 你的代码，使无序数组 a 变得有序 - for (int i = 0; i < n; i++) { - for (int j = (i + 1); j < n; j++) { - if (arr[i] > arr[j]) { - int temp = arr[i]; - arr[i] = arr[j]; - arr[j] = temp; - } - } - } - } //end \ No newline at end of file diff --git a/codes/vipsoso/11207552.java b/codes/vipsoso/11207552.java deleted file mode 100644 index deb2438785c696d09e985c35997c2f2bc5445a90..0000000000000000000000000000000000000000 --- a/codes/vipsoso/11207552.java +++ /dev/null @@ -1,18 +0,0 @@ -/** - * 冒泡排序函数 - * aa bb cc - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - // 你的代码，使无序数组 a 变得有序 - for (int i=0 ; ia[k+1]) { - int temp=a[k]; - a[k]=a[k+1]; - a[k+1]=temp; - } - } - } -} //end \ No newline at end of file diff --git a/codes/vodka001/15830352.java b/codes/vodka001/15830352.java deleted file mode 100644 index f7adf9b5712e0d2f86600fcc16710a3f2c1fc263..0000000000000000000000000000000000000000 --- a/codes/vodka001/15830352.java +++ /dev/null @@ -1,18 +0,0 @@ -/** - * 冒泡排序函数 - * 通过相邻元素比较和交换的方式，将数组中的元素按照从小到大的顺序排列 - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int[] a, int n) { - for (int i = 0; i < n - 1; i++) { // 外层循环控制比较轮数 - for (int j = 0; j < n - 1 - i; j++) { // 内层循环控制每轮比较次数 - // 如果前一个元素大于后一个元素，则交换它们的位置 - if (a[j] > a[j + 1]) { - int temp = a[j]; - a[j] = a[j + 1]; - a[j + 1] = temp; - } - } - } -} // end diff --git a/codes/vv0102/.keep b/codes/vv0102/.keep deleted file mode 100644 index e69de29bb2d1d6434b8b29ae775ad8c2e48c5391..0000000000000000000000000000000000000000 diff --git a/codes/vv0102/15831508.java b/codes/vv0102/15831508.java deleted file mode 100644 index d40803fb8fd6db6216a346341ff5180f0b773922..0000000000000000000000000000000000000000 --- a/codes/vv0102/15831508.java +++ /dev/null @@ -1,20 +0,0 @@ -/** - * 冒泡排序函数 - * aa bb cc - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - // 你的代码，使无序数组 a 变得有序 - for(int i = 0; i < n; i++) { - for(int j = 0; j < n - i - 1; j++) { - if(a[j] > a[j + 1]) { - int temp = a[j]; - a [j] = a[j + 1]; - a[j + 1] = temp; - } - } - } - - -} //end \ No newline at end of file diff --git a/codes/vv89889901/11286616.java b/codes/vv89889901/11286616.java deleted file mode 100644 index cdabc2e0876ad629e41ff055727cf3af34be8917..0000000000000000000000000000000000000000 --- a/codes/vv89889901/11286616.java +++ /dev/null @@ -1,20 +0,0 @@ -/** - * 冒泡排序函数 - * aa bb cc - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - // 你的代码，使无序数组 a 变得有序 - for (int i = 0; i < n; i++) { - for (int j = i + 1; j < n; j++) { - if (a[i] > a[j]) { - int temp = a[j]; - a[j] = a[i]; - a[i] = temp; - - } - } - } - -} //end \ No newline at end of file diff --git a/codes/w13097865367/15857389.java b/codes/w13097865367/15857389.java deleted file mode 100644 index 271d2f1dfec9c226694fa24afe300e49f150ca51..0000000000000000000000000000000000000000 --- a/codes/w13097865367/15857389.java +++ /dev/null @@ -1,18 +0,0 @@ -/** - * 冒泡排序函数 - * 将数组a按照从小到大的顺序排序 - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int[] a, int n) { - for (int i = 0; i < n - 1; i++) { // 外层循环，决定冒泡的趟数 - for (int j = 0; j < n - 1 - i; j++) { // 内层循环，决定每趟比较的次数 - if (a[j] > a[j + 1]) { // 如果当前元素大于下一个元素，则交换它们的位置 - // 交换a[j]和a[j + 1] - int temp = a[j]; - a[j] = a[j + 1]; - a[j + 1] = temp; - } - } - } -} // end diff --git a/codes/w18438720464/15860134.java b/codes/w18438720464/15860134.java deleted file mode 100644 index 987377810b5beca8eb4bf5eafeee5db45e234a87..0000000000000000000000000000000000000000 --- a/codes/w18438720464/15860134.java +++ /dev/null @@ -1,20 +0,0 @@ -/** - * 冒泡排序函数 - * aa bb cc - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - // 你的代码，使无序数组 a 变得有序 - for(int i = 0; i < n; i++) { - for(int liuy = 0; liuy < n - i - 1; liuy++) { - if(a[liuy] > a[liuy + 1]) { - int temp = a[liuy]; - a [liuy] = a[liuy + 1]; - a[liuy + 1] = temp; - } - } - } - - -} //end,liuy diff --git a/codes/w188555/.keep b/codes/w188555/.keep deleted file mode 100644 index e69de29bb2d1d6434b8b29ae775ad8c2e48c5391..0000000000000000000000000000000000000000 diff --git a/codes/w188555/10043819.java b/codes/w188555/10043819.java deleted file mode 100644 index 667eee0f585ec38ce639cb36d80df080e935946d..0000000000000000000000000000000000000000 --- a/codes/w188555/10043819.java +++ /dev/null @@ -1,11 +0,0 @@ -public static void bubbleSort(int [] a,int n){ - for(int i = 0; i < n-1 ; i++){ - for (int j = 0;j < n-1-i;j++){ - if(a[j] > a[j+1]){ - int temp = a[j]; - a[j] = a[j+1]; - a[j+1] = temp; - } - } - } -} \ No newline at end of file diff --git a/codes/w193005/15783193.java b/codes/w193005/15783193.java deleted file mode 100644 index ae82e695cbfd360050241c3f1f592658c8c1d4e7..0000000000000000000000000000000000000000 --- a/codes/w193005/15783193.java +++ /dev/null @@ -1,35 +0,0 @@ -/** - - * 冒泡排序函数 - - * aa bb cc - - * @param a 待排序的数组 - - * @param n 待排序的数组长度 - - */ - -public static void bubbleSort(int [] a, int n){ - - for(int i = 0; i < n-1 ; i++){ - - for (int j = 0;j < n-1-i;j++){ - - if(a[j] > a[j+1]){ - - int temp = a[j]; - - a[j] = a[j+1]; - - a[j+1] = temp; - - } - - } - - } - - - -} //end diff --git a/codes/w3172773640/15857664.java b/codes/w3172773640/15857664.java deleted file mode 100644 index 271d2f1dfec9c226694fa24afe300e49f150ca51..0000000000000000000000000000000000000000 --- a/codes/w3172773640/15857664.java +++ /dev/null @@ -1,18 +0,0 @@ -/** - * 冒泡排序函数 - * 将数组a按照从小到大的顺序排序 - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int[] a, int n) { - for (int i = 0; i < n - 1; i++) { // 外层循环，决定冒泡的趟数 - for (int j = 0; j < n - 1 - i; j++) { // 内层循环，决定每趟比较的次数 - if (a[j] > a[j + 1]) { // 如果当前元素大于下一个元素，则交换它们的位置 - // 交换a[j]和a[j + 1] - int temp = a[j]; - a[j] = a[j + 1]; - a[j + 1] = temp; - } - } - } -} // end diff --git a/codes/w964061684/15543696.java b/codes/w964061684/15543696.java deleted file mode 100644 index 37b075a0be9c25a60677452997e4e67194d3ee9b..0000000000000000000000000000000000000000 --- a/codes/w964061684/15543696.java +++ /dev/null @@ -1,17 +0,0 @@ -/** - * 冒泡排序函数 - * 这是一个简单的冒泡排序实现，通过相邻元素之间的比较和交换，将较大的元素逐渐“冒泡”到数组的末尾。 - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - for (int i = 0; i < n - 1; i++) { // 外层循环控制需要排序的轮数 - for (int j = 0; j < n - i - 1; j++) { // 内层循环控制每轮需要比较的次数 - if (a[j] > a[j + 1]) { // 如果前一个元素大于后一个元素，则交换它们的位置 - int temp = a[j]; - a[j] = a[j + 1]; - a[j + 1] = temp; - } - } - } -} //end diff --git a/codes/walicode/9651246.java b/codes/walicode/9651246.java deleted file mode 100755 index 7aa905f3acb901a1a470d411df1ce71f7e107a4f..0000000000000000000000000000000000000000 --- a/codes/walicode/9651246.java +++ /dev/null @@ -1,24 +0,0 @@ -/** - * 冒泡排序函数 - * aa bb cc - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - // 你的代码，使无序数组 a 变得有序 - for(int j=0;ja[i+1]) - { - temp=a[i]; - a[i]=a[i+1]; - a[i+1]=temp; - } - } - } - //System.out.println(a); - -} //end diff --git a/codes/wang001/15732362.java b/codes/wang001/15732362.java deleted file mode 100644 index 7ec373aee12c8b4795c0d670e772620e90ee630e..0000000000000000000000000000000000000000 --- a/codes/wang001/15732362.java +++ /dev/null @@ -1,18 +0,0 @@ -/** - * 冒泡排序函数 - * 通过对相邻的元素进行两两比较，顺序相反则进行交换，每一轮比较会将当前未排序部分的最大值“冒泡”到未排序部分的末尾。 - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int[] a, int n) { - for (int i = 0; i < n - 1; i++) { // 外层循环控制所有轮数 - for (int j = 0; j < n - i - 1; j++) { // 内层循环控制每轮比较的次数 - if (a[j] > a[j + 1]) { // 如果前一个元素大于后一个元素，则交换它们 - // 交换 a[j] 和 a[j+1] - int temp = a[j]; - a[j] = a[j + 1]; - a[j + 1] = temp; - } - } - } -} // end diff --git a/codes/wang123123/15816325.java b/codes/wang123123/15816325.java deleted file mode 100644 index 8a9fb77715574062dc84306babe1fe613d81637f..0000000000000000000000000000000000000000 --- a/codes/wang123123/15816325.java +++ /dev/null @@ -1,18 +0,0 @@ -/** - * 冒泡排序函数 - * 使用冒泡排序算法对数组进行升序排序 - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - for (int i = 0; i < n - 1; i++) { - for (int j = 0; j < n - i - 1; j++) { - // 如果前一个元素大于后一个元素，则交换它们的位置 - if (a[j] > a[j + 1]) { - int temp = a[j]; - a[j] = a[j + 1]; - a[j + 1] = temp; - } - } - } -} //end diff --git a/codes/wang_lz/15895908.java b/codes/wang_lz/15895908.java deleted file mode 100644 index c3c44a07bda6d384ed775628494388990bfc999a..0000000000000000000000000000000000000000 --- a/codes/wang_lz/15895908.java +++ /dev/null @@ -1,20 +0,0 @@ -/** - * 冒泡排序函数 - * aa bb cc - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ - public static void bubbleSort(int [] a, int n){ - // 你的代码，使无序数组 a 变得有序 - for(int i=0;ia[j]){ - int tmp =a[j]; - a[j]=a[j-1]; - a[j-1]=tmp; - } - } - } - - - } //end diff --git a/codes/wangaobin/15830618.java b/codes/wangaobin/15830618.java deleted file mode 100644 index ae82e695cbfd360050241c3f1f592658c8c1d4e7..0000000000000000000000000000000000000000 --- a/codes/wangaobin/15830618.java +++ /dev/null @@ -1,35 +0,0 @@ -/** - - * 冒泡排序函数 - - * aa bb cc - - * @param a 待排序的数组 - - * @param n 待排序的数组长度 - - */ - -public static void bubbleSort(int [] a, int n){ - - for(int i = 0; i < n-1 ; i++){ - - for (int j = 0;j < n-1-i;j++){ - - if(a[j] > a[j+1]){ - - int temp = a[j]; - - a[j] = a[j+1]; - - a[j+1] = temp; - - } - - } - - } - - - -} //end diff --git a/codes/wangeditor/11461619.java b/codes/wangeditor/11461619.java deleted file mode 100644 index 4d7083fe05ce3e6d3fadd59d6d55e2cbc50d546d..0000000000000000000000000000000000000000 --- a/codes/wangeditor/11461619.java +++ /dev/null @@ -1,22 +0,0 @@ -/** - * 冒泡排序函数 - * aa bb cc - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - // 你的代码，使无序数组 a 变得有序 - int i, j; - - for(i=0; ia[j]){ - int temp; - temp = a[j-1]; - a[j-1] = a[j]; - a[j] = temp; - } - } - } - -} //end \ No newline at end of file diff --git a/codes/wangjingru/15775677.java b/codes/wangjingru/15775677.java deleted file mode 100644 index d612a9d6324e9ddde1fce6ccb74b38a12b4e973d..0000000000000000000000000000000000000000 --- a/codes/wangjingru/15775677.java +++ /dev/null @@ -1,27 +0,0 @@ -/** - * 冒泡排序函数 - * 将无序数组通过冒泡排序算法变为有序数组 - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - for (int i = 0; i < n - 1; i++) { - // 设置一个标志位，用于优化算法，减少不必要的比较 - boolean swapped = false; - for (int j = 0; j < n - i - 1; j++) { - // 如果前一个元素比后一个元素大，则交换它们的位置 - if (a[j] > a[j + 1]) { - int temp = a[j]; - a[j] = a[j + 1]; - a[j + 1] = temp; - // 如果有元素交换，则标志位设为true - swapped = true; - } - } - // 如果没有元素交换，说明数组已经有序，可以提前结束排序 - if (!swapped) { - break; - } - } -} //end - diff --git a/codes/wangjz18551603897/9965927.java b/codes/wangjz18551603897/9965927.java deleted file mode 100644 index 16bc25dc40a1438270d0545a3b4461f5666ddf96..0000000000000000000000000000000000000000 --- a/codes/wangjz18551603897/9965927.java +++ /dev/null @@ -1,21 +0,0 @@ -/** - * 冒泡排序函数 - * aa bb cc - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - // 你的代码，使无序数组 a 变得有序 - int temp;//定义一个临时变量 - for(int i=0;i a[j + 1]) { - int temp = a[j]; - a [j] = a[j + 1]; - a[j + 1] = temp; - } - } - } - - -} //end \ No newline at end of file diff --git a/codes/wangliping111/15556238.java b/codes/wangliping111/15556238.java deleted file mode 100644 index c2afaa2414da1853e4500b02c6de9068b64aeafe..0000000000000000000000000000000000000000 --- a/codes/wangliping111/15556238.java +++ /dev/null @@ -1,18 +0,0 @@ -/** - * 冒泡排序函数 - * aa bb cc - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - for(int i = 0; i < n-1 ; i++){ - for (int j = 0;j < n-1-i;j++){ - if(a[j] > a[j+1]){ - int temp = a[j]; - a[j] = a[j+1]; - a[j+1] = temp; - } - } - } - -} //end diff --git a/codes/wanglumin/15110274.java b/codes/wanglumin/15110274.java deleted file mode 100644 index 5f207500d6a828838d90238c3e56435882f6e210..0000000000000000000000000000000000000000 --- a/codes/wanglumin/15110274.java +++ /dev/null @@ -1,13 +0,0 @@ -public static void bubbleSort(int [] a,int n){ - - for (int i = 0; i < n - 1; i++) { - for (int j = 0; j < n - 1 - i; j++) { - if (a[j] > a[j + 1]) { - // 交换相邻两个元素 - int temp = a[j]; - a[j] = a[j + 1]; - a[j + 1] = temp; - } - } - } -} diff --git a/codes/wangsheng112/.keep b/codes/wangsheng112/.keep deleted file mode 100644 index e69de29bb2d1d6434b8b29ae775ad8c2e48c5391..0000000000000000000000000000000000000000 diff --git a/codes/wangsheng112/15741948.java b/codes/wangsheng112/15741948.java deleted file mode 100644 index 6e9861fa3ec6d5a2553cdccd1bb1e977430c671b..0000000000000000000000000000000000000000 --- a/codes/wangsheng112/15741948.java +++ /dev/null @@ -1,19 +0,0 @@ -/** - * 冒泡排序函数 - * aa bb cc - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - // 你的代码，使无序数组 a 变得有序 - for (int i = 0; i < n - 1; i++) { - for (int j = 0; j < n - i - 1; j++) { - if (a[j] > a[j + 1]) { - - int temp = a[j]; - a[j] = a[j + 1]; - a[j + 1] = temp; - } - } - } -} //end \ No newline at end of file diff --git a/codes/wangth/12284554.java b/codes/wangth/12284554.java deleted file mode 100644 index f4fc0654debe582b6b04dd007fb92d8c7de1ecdb..0000000000000000000000000000000000000000 --- a/codes/wangth/12284554.java +++ /dev/null @@ -1,18 +0,0 @@ -/** - * 冒泡排序函数 - * aa bb cc - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - // 你的代码，使无序数组 a 变得有序 - for (int i = 0; i < n; i++) { - for (int j = 0; j < n; j++) { - if (j < n-1 && a[j] > a[j+1]) { - int temp = a[j]; - a[j] = a[j+1]; - a[j+1] = temp; - } - } - } -} diff --git a/codes/wangyaru01/9678121.java b/codes/wangyaru01/9678121.java deleted file mode 100644 index 3923f7078601d75004d88bf75be136d418c09154..0000000000000000000000000000000000000000 --- a/codes/wangyaru01/9678121.java +++ /dev/null @@ -1,22 +0,0 @@ -/** - * 冒泡排序函数 - * aa bb cc - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - // 你的代码，使无序数组 a 变得有序 - int i, j; - - for(i=0; ia[j]){ - int temp; - temp = a[j-1]; - a[j-1] = a[j]; - a[j] = temp; - } - } - } - -} //end diff --git a/codes/wangzixuan654/.keep b/codes/wangzixuan654/.keep deleted file mode 100644 index e69de29bb2d1d6434b8b29ae775ad8c2e48c5391..0000000000000000000000000000000000000000 diff --git a/codes/wangzixuan654/15815873.java b/codes/wangzixuan654/15815873.java deleted file mode 100644 index 6e9861fa3ec6d5a2553cdccd1bb1e977430c671b..0000000000000000000000000000000000000000 --- a/codes/wangzixuan654/15815873.java +++ /dev/null @@ -1,19 +0,0 @@ -/** - * 冒泡排序函数 - * aa bb cc - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - // 你的代码，使无序数组 a 变得有序 - for (int i = 0; i < n - 1; i++) { - for (int j = 0; j < n - i - 1; j++) { - if (a[j] > a[j + 1]) { - - int temp = a[j]; - a[j] = a[j + 1]; - a[j + 1] = temp; - } - } - } -} //end \ No newline at end of file diff --git a/codes/wanmeijuhao/15724276.java b/codes/wanmeijuhao/15724276.java deleted file mode 100644 index 44f7cc659a02fe8bcf8c0e9f02334fe2a6a9ff87..0000000000000000000000000000000000000000 --- a/codes/wanmeijuhao/15724276.java +++ /dev/null @@ -1,26 +0,0 @@ -/** - * 冒泡排序函数 - * 将无序数组通过冒泡排序算法变为有序数组 - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - for (int i = 0; i < n - 1; i++) { - // 设置一个标志位，用于优化算法，减少不必要的比较 - boolean swapped = false; - for (int j = 0; j < n - i - 1; j++) { - // 如果前一个元素比后一个元素大，则交换它们的位置 - if (a[j] > a[j + 1]) { - int temp = a[j]; - a[j] = a[j + 1]; - a[j + 1] = temp; - // 如果有元素交换，则标志位设为true - swapped = true; - } - } - // 如果没有元素交换，说明数组已经有序，可以提前结束排序 - if (!swapped) { - break; - } - } -} //end diff --git a/codes/wanwanya/15775672.java b/codes/wanwanya/15775672.java deleted file mode 100644 index 987377810b5beca8eb4bf5eafeee5db45e234a87..0000000000000000000000000000000000000000 --- a/codes/wanwanya/15775672.java +++ /dev/null @@ -1,20 +0,0 @@ -/** - * 冒泡排序函数 - * aa bb cc - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - // 你的代码，使无序数组 a 变得有序 - for(int i = 0; i < n; i++) { - for(int liuy = 0; liuy < n - i - 1; liuy++) { - if(a[liuy] > a[liuy + 1]) { - int temp = a[liuy]; - a [liuy] = a[liuy + 1]; - a[liuy + 1] = temp; - } - } - } - - -} //end,liuy diff --git a/codes/waste985/15615158.java b/codes/waste985/15615158.java deleted file mode 100644 index 53566f4d2876e70f2fa80c1d571a7a778ade860c..0000000000000000000000000000000000000000 --- a/codes/waste985/15615158.java +++ /dev/null @@ -1,17 +0,0 @@ -/** - * 冒泡排序函数 - * 通过相邻元素两两比较并交换，将较大的元素逐渐交换到数组的末尾，达到排序的目的。 - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int[] a, int n) { - for (int i = 0; i < n - 1; i++) { // 外层循环，控制遍历的轮数 - for (int j = 0; j < n - 1 - i; j++) { // 内层循环，从前往后比较相邻元素 - if (a[j] > a[j + 1]) { // 如果前一个元素大于后一个元素，则交换它们 - int temp = a[j]; - a[j] = a[j + 1]; - a[j + 1] = temp; - } - } - } -} // end diff --git a/codes/waterdrop/15514437.java b/codes/waterdrop/15514437.java deleted file mode 100644 index 91b9a83d57ddf638ec0451596dd95402b887f1fc..0000000000000000000000000000000000000000 --- a/codes/waterdrop/15514437.java +++ /dev/null @@ -1,26 +0,0 @@ -/** - * 冒泡排序函数 - * 对数组a进行升序排序 - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - for (int i = 0; i < n - 1; i++) { - // 设置一个标志位，表示本趟是否有交换 - boolean swapped = false; - for (int j = 0; j < n - i - 1; j++) { - // 如果前一个元素比后一个元素大，则交换它们 - if (a[j] > a[j + 1]) { - int temp = a[j]; - a[j] = a[j + 1]; - a[j + 1] = temp; - // 表示本趟发生了交换 - swapped = true; - } - } - // 如果本趟没有发生交换，说明数组已经有序，可以提前结束 - if (!swapped) { - break; - } - } -} // end diff --git a/codes/waveriders/.keep b/codes/waveriders/.keep deleted file mode 100644 index e69de29bb2d1d6434b8b29ae775ad8c2e48c5391..0000000000000000000000000000000000000000 diff --git a/codes/waveriders/15772349.java b/codes/waveriders/15772349.java deleted file mode 100644 index 6426772fb479b07ed3be21ef1867921d1dbb194c..0000000000000000000000000000000000000000 --- a/codes/waveriders/15772349.java +++ /dev/null @@ -1,20 +0,0 @@ -/** - * 冒泡排序函数 - * aa bb cc - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - // 你的代码，使无序数组 a 变得有序 - for(int i = 0; i < n; i++) { - for(int j = 0; j < n - i - 1; j++) { - if(a[j] > a[j + 1]) { - int temp = a[j]; - a [j] = a[j + 1]; - a[j + 1] = temp; - } - } - } - - -} //end \ No newline at end of file diff --git a/codes/wb-qtt862918/9675682.java b/codes/wb-qtt862918/9675682.java deleted file mode 100644 index 165e3b80ddc639eedebabf011b2b2b6db8bb462b..0000000000000000000000000000000000000000 --- a/codes/wb-qtt862918/9675682.java +++ /dev/null @@ -1,20 +0,0 @@ -/** - * 冒泡排序函数 - * aa bb cc - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - // 你的代码，使无序数组 a 变得有序 - int temp=0; //定义一个临时变量 - for(int i=0;i a[j+1]){ - int temp = a[j]; - a[j] = a[j+1]; - a[j+1] = temp; - } - } - } - -} //end \ No newline at end of file diff --git a/codes/wcjm2023/11233911.java b/codes/wcjm2023/11233911.java deleted file mode 100644 index 029e9d84c1474520908887693e69aabcb7ff0aba..0000000000000000000000000000000000000000 --- a/codes/wcjm2023/11233911.java +++ /dev/null @@ -1,28 +0,0 @@ -/** - * 冒泡排序函数 - * aa bb cc - * @param a 待排序的数组 - * @param n 待排序的数组长度 -*/ -public static void bubbleSort(int [] a, int n){ - int j , k; - int flag = n ;//flag来记录最后交换的位置，也就是排序的尾边界 - - while (flag > 0){//排序未结束标志 - k = flag; //k 来记录遍历的尾边界 - flag = 0; - - for(j=1; j a[j]){//前面的数字大于后面的数字就交换 - //交换a[j-1]和a[j] - int temp; - temp = a[j-1]; - a[j-1] = a[j]; - a[j]=temp; - - //表示交换过数据; - flag = j;//记录最新的尾边界. - } - } - } -} \ No newline at end of file diff --git a/codes/wdg1994/15654397.java b/codes/wdg1994/15654397.java deleted file mode 100644 index 9a7a71cd52191bcff90e688901904eb1a85cc943..0000000000000000000000000000000000000000 --- a/codes/wdg1994/15654397.java +++ /dev/null @@ -1,21 +0,0 @@ -/** - * 冒泡排序函数 - * 冒泡排序是一种简单的排序算法，它重复地遍历要排序的数列，一次比较两个元素，如果他们的顺序错误就把他们交换过来。 - * 遍历数列的工作是重复地进行直到没有再需要交换，也就是说该数列已经排序完成。 - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int[] a, int n) { - // 外层循环控制排序趟数 - for (int i = 0; i < n - 1; i++) { - // 内层循环进行每一趟的排序 - for (int j = 0; j < n - i - 1; j++) { - // 如果前一个元素大于后一个元素，则交换这两个元素的位置 - if (a[j] > a[j + 1]) { - int temp = a[j]; - a[j] = a[j + 1]; - a[j + 1] = temp; - } - } - } -} //end diff --git a/codes/wdnmd123/10967263.java b/codes/wdnmd123/10967263.java deleted file mode 100644 index 029e9d84c1474520908887693e69aabcb7ff0aba..0000000000000000000000000000000000000000 --- a/codes/wdnmd123/10967263.java +++ /dev/null @@ -1,28 +0,0 @@ -/** - * 冒泡排序函数 - * aa bb cc - * @param a 待排序的数组 - * @param n 待排序的数组长度 -*/ -public static void bubbleSort(int [] a, int n){ - int j , k; - int flag = n ;//flag来记录最后交换的位置，也就是排序的尾边界 - - while (flag > 0){//排序未结束标志 - k = flag; //k 来记录遍历的尾边界 - flag = 0; - - for(j=1; j a[j]){//前面的数字大于后面的数字就交换 - //交换a[j-1]和a[j] - int temp; - temp = a[j-1]; - a[j-1] = a[j]; - a[j]=temp; - - //表示交换过数据; - flag = j;//记录最新的尾边界. - } - } - } -} \ No newline at end of file diff --git a/codes/web-dream/.keep b/codes/web-dream/.keep deleted file mode 100644 index e69de29bb2d1d6434b8b29ae775ad8c2e48c5391..0000000000000000000000000000000000000000 diff --git a/codes/web-dream/15776234.java b/codes/web-dream/15776234.java deleted file mode 100644 index 6426772fb479b07ed3be21ef1867921d1dbb194c..0000000000000000000000000000000000000000 --- a/codes/web-dream/15776234.java +++ /dev/null @@ -1,20 +0,0 @@ -/** - * 冒泡排序函数 - * aa bb cc - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - // 你的代码，使无序数组 a 变得有序 - for(int i = 0; i < n; i++) { - for(int j = 0; j < n - i - 1; j++) { - if(a[j] > a[j + 1]) { - int temp = a[j]; - a [j] = a[j + 1]; - a[j + 1] = temp; - } - } - } - - -} //end \ No newline at end of file diff --git a/codes/web3dapp/10996679.java b/codes/web3dapp/10996679.java deleted file mode 100644 index b9bf7818d9ffdce1bf2bd0863a51890bffa3f951..0000000000000000000000000000000000000000 --- a/codes/web3dapp/10996679.java +++ /dev/null @@ -1,11 +0,0 @@ -public static void bubbleSort(int [] a, int n) { - for (int i=0 ; ia[j+1]) { - int temp=a[j]; - a[j]=a[j+1]; - a[j+1]=temp; - } - } - } -} \ No newline at end of file diff --git a/codes/web4usss/.keep b/codes/web4usss/.keep deleted file mode 100644 index e69de29bb2d1d6434b8b29ae775ad8c2e48c5391..0000000000000000000000000000000000000000 diff --git a/codes/web4usss/15844605.java b/codes/web4usss/15844605.java deleted file mode 100644 index 6e9861fa3ec6d5a2553cdccd1bb1e977430c671b..0000000000000000000000000000000000000000 --- a/codes/web4usss/15844605.java +++ /dev/null @@ -1,19 +0,0 @@ -/** - * 冒泡排序函数 - * aa bb cc - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - // 你的代码，使无序数组 a 变得有序 - for (int i = 0; i < n - 1; i++) { - for (int j = 0; j < n - i - 1; j++) { - if (a[j] > a[j + 1]) { - - int temp = a[j]; - a[j] = a[j + 1]; - a[j + 1] = temp; - } - } - } -} //end \ No newline at end of file diff --git a/codes/webAssembly/11131659.java b/codes/webAssembly/11131659.java deleted file mode 100644 index 4d7083fe05ce3e6d3fadd59d6d55e2cbc50d546d..0000000000000000000000000000000000000000 --- a/codes/webAssembly/11131659.java +++ /dev/null @@ -1,22 +0,0 @@ -/** - * 冒泡排序函数 - * aa bb cc - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - // 你的代码，使无序数组 a 变得有序 - int i, j; - - for(i=0; ia[j]){ - int temp; - temp = a[j-1]; - a[j-1] = a[j]; - a[j] = temp; - } - } - } - -} //end \ No newline at end of file diff --git a/codes/wechat/11212111.java b/codes/wechat/11212111.java deleted file mode 100644 index 1c8889947f924214c71a3c3f202500b4780dc281..0000000000000000000000000000000000000000 --- a/codes/wechat/11212111.java +++ /dev/null @@ -1,11 +0,0 @@ -public static void bubbleSort(int [] a,int n){ - for(int i = 0; i < n-1 ; i++){ - for (int j = 0;j < n-1-i;j++){ - if(a[j] > a[j+1]){ - int temp = a[j]; - a[j] = a[j+1]; - a[j+1] = temp; - } - } - } -} \ No newline at end of file diff --git a/codes/wee223/15861853.java b/codes/wee223/15861853.java deleted file mode 100644 index 54c5f3869cd16ee9e7c2b77895a39fae63f05dbc..0000000000000000000000000000000000000000 --- a/codes/wee223/15861853.java +++ /dev/null @@ -1,20 +0,0 @@ -/** - * 冒泡排序函数 - * aa bb cc - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - // 你的代码，使无序数组 a 变得有序 - for(int i = 0; i < n; i++) { - for(int liuy = 0; liuy < n - i - 1; liuy++) { - if(a[liuy] > a[liuy + 1]) { - int temp = a[liuy]; - a [liuy] = a[liuy + 1]; - a[liuy + 1] = temp; - } - } - } - - -} //end,liuy \ No newline at end of file diff --git a/codes/weiha162/15759131.java b/codes/weiha162/15759131.java deleted file mode 100644 index 76cbddd876f8669466e0a2651682cee667741713..0000000000000000000000000000000000000000 --- a/codes/weiha162/15759131.java +++ /dev/null @@ -1,20 +0,0 @@ -/** - * 冒泡排序函数 - * aa bb cc - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - // 你的代码，使无序数组 a 变得有序 - for(int i = 0; i < n; i++) { - for(int b = 0; b < n - i - 1; b++) { - if(a[b] > a[b + 1]) { - int temp = a[b]; - a [b] = a[b + 1]; - a[b + 1] = temp; - } - } - } - - -} //end diff --git a/codes/weijinhang/15838774.java b/codes/weijinhang/15838774.java deleted file mode 100644 index 47e0d6efa8bfa49fe95c91537dccda0c09563b63..0000000000000000000000000000000000000000 --- a/codes/weijinhang/15838774.java +++ /dev/null @@ -1,18 +0,0 @@ -/** - * 冒泡排序函数 - * 功能：对数组进行升序排序 - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int[] a, int n) { - for (int i = 0; i < n - 1; i++) { // 遍历数组，从第一个元素到倒数第二个元素 - for (int j = 0; j < n - 1 - i; j++) { // 每次比较相邻的元素，最后一个元素已经是当前轮的最大值，无需再比较 - if (a[j] > a[j + 1]) { // 如果前一个元素大于后一个元素，则交换它们的位置 - // 交换 a[j] 和 a[j+1] - int temp = a[j]; - a[j] = a[j + 1]; - a[j + 1] = temp; - } - } - } -} // end diff --git a/codes/weishuai/.keep b/codes/weishuai/.keep deleted file mode 100644 index e69de29bb2d1d6434b8b29ae775ad8c2e48c5391..0000000000000000000000000000000000000000 diff --git a/codes/weishuai/15795582.java b/codes/weishuai/15795582.java deleted file mode 100644 index 6426772fb479b07ed3be21ef1867921d1dbb194c..0000000000000000000000000000000000000000 --- a/codes/weishuai/15795582.java +++ /dev/null @@ -1,20 +0,0 @@ -/** - * 冒泡排序函数 - * aa bb cc - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - // 你的代码，使无序数组 a 变得有序 - for(int i = 0; i < n; i++) { - for(int j = 0; j < n - i - 1; j++) { - if(a[j] > a[j + 1]) { - int temp = a[j]; - a [j] = a[j + 1]; - a[j + 1] = temp; - } - } - } - - -} //end \ No newline at end of file diff --git a/codes/weisss/15526691.java b/codes/weisss/15526691.java deleted file mode 100644 index 20575dc4ccc75a5bf6af9ea4614fcfa2a84fdeaf..0000000000000000000000000000000000000000 --- a/codes/weisss/15526691.java +++ /dev/null @@ -1,19 +0,0 @@ -/** - * 冒泡排序函数 - * aa bb cc - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - // 你的代码，使无序数组 a 变得有序 - for (int i = 0; i < n - 1; i++) { - for (int j = 0; j < n - i - 1; j++) { - if (a[j] > a[j + 1]) { - // 交换元素 - int temp = a[j]; - a[j] = a[j + 1]; - a[j + 1] = temp; - } - } - } -} //end diff --git a/codes/weiwei1/15837298.java b/codes/weiwei1/15837298.java deleted file mode 100644 index 47e0d6efa8bfa49fe95c91537dccda0c09563b63..0000000000000000000000000000000000000000 --- a/codes/weiwei1/15837298.java +++ /dev/null @@ -1,18 +0,0 @@ -/** - * 冒泡排序函数 - * 功能：对数组进行升序排序 - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int[] a, int n) { - for (int i = 0; i < n - 1; i++) { // 遍历数组，从第一个元素到倒数第二个元素 - for (int j = 0; j < n - 1 - i; j++) { // 每次比较相邻的元素，最后一个元素已经是当前轮的最大值，无需再比较 - if (a[j] > a[j + 1]) { // 如果前一个元素大于后一个元素，则交换它们的位置 - // 交换 a[j] 和 a[j+1] - int temp = a[j]; - a[j] = a[j + 1]; - a[j + 1] = temp; - } - } - } -} // end diff --git a/codes/weiwenjie/15736197.java b/codes/weiwenjie/15736197.java deleted file mode 100644 index 363fb48393436081f17448f6c0435527a9086619..0000000000000000000000000000000000000000 --- a/codes/weiwenjie/15736197.java +++ /dev/null @@ -1,18 +0,0 @@ -/** - * 冒泡排序函数 - * 通过对相邻的元素进行两两比较，顺序相反则进行交换，每一轮比较会将当前未排序部分的最大值“冒泡”到未排序部分的末尾。 - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int[] a, int n) { - for (int i = 0; i < n - 1; i++) { // 外层循环控制所有轮数 - for (int j = 0; j < n - i - 1; j++) { // 内层循环控制每轮比较的次数 - if (a[j] > a[j + 1]) { // 如果前一个元素大于后一个元素，则交换它们 - // 交换 a[j] 和 a[j+1] - int temp = a[j]; - a[j] = a[j + 1]; - a[j + 1] = temp; - } - } - } -} // end diff --git a/codes/weiyanqiu/15624187.java b/codes/weiyanqiu/15624187.java deleted file mode 100644 index 2252b818e6125ed4f8bbd23eca03c12c15ca1757..0000000000000000000000000000000000000000 --- a/codes/weiyanqiu/15624187.java +++ /dev/null @@ -1,19 +0,0 @@ -/** - * 冒泡排序函数 - * aa bb cc - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - // 你的代码，使无序数组 a 变得有序 - for (int i = 0; i < n - 1; i++) { - for (int j = 0; j < n - i - 1; j++) { - if (a[j] > a[j + 1]) { - // 交换元素 - int temp = a[j]; - a[j] = a[j + 1]; - a[j + 1] = temp; - } - } - } -} //end \ No newline at end of file diff --git a/codes/wenhuiyu/.keep b/codes/wenhuiyu/.keep deleted file mode 100644 index e69de29bb2d1d6434b8b29ae775ad8c2e48c5391..0000000000000000000000000000000000000000 diff --git a/codes/wenhuiyu/15765207.java b/codes/wenhuiyu/15765207.java deleted file mode 100644 index 6426772fb479b07ed3be21ef1867921d1dbb194c..0000000000000000000000000000000000000000 --- a/codes/wenhuiyu/15765207.java +++ /dev/null @@ -1,20 +0,0 @@ -/** - * 冒泡排序函数 - * aa bb cc - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - // 你的代码，使无序数组 a 变得有序 - for(int i = 0; i < n; i++) { - for(int j = 0; j < n - i - 1; j++) { - if(a[j] > a[j + 1]) { - int temp = a[j]; - a [j] = a[j + 1]; - a[j + 1] = temp; - } - } - } - - -} //end \ No newline at end of file diff --git a/codes/wenjlong/18626126.java b/codes/wenjlong/18626126.java deleted file mode 100644 index fdbf8b8978e3f1740845db43268d56e03479b50a..0000000000000000000000000000000000000000 --- a/codes/wenjlong/18626126.java +++ /dev/null @@ -1,20 +0,0 @@ -/** - * 冒泡排序函数 - * aa bb cc - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int[] a, int n) { - // 外层循环控制排序趟数 - for (int i = 0; i < n - 1; i++) { - // 内层循环控制每一趟比较的次数 - for (int j = 0; j < n - i - 1; j++) { - // 如果前面的元素大于后面的元素，则交换 - if (a[j] > a[j + 1]) { - int temp = a[j]; - a[j] = a[j + 1]; - a[j + 1] = temp; - } - } - } -} diff --git a/codes/wenrou99/.keep b/codes/wenrou99/.keep deleted file mode 100644 index e69de29bb2d1d6434b8b29ae775ad8c2e48c5391..0000000000000000000000000000000000000000 diff --git a/codes/wenrou99/15831418.java b/codes/wenrou99/15831418.java deleted file mode 100644 index 6426772fb479b07ed3be21ef1867921d1dbb194c..0000000000000000000000000000000000000000 --- a/codes/wenrou99/15831418.java +++ /dev/null @@ -1,20 +0,0 @@ -/** - * 冒泡排序函数 - * aa bb cc - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - // 你的代码，使无序数组 a 变得有序 - for(int i = 0; i < n; i++) { - for(int j = 0; j < n - i - 1; j++) { - if(a[j] > a[j + 1]) { - int temp = a[j]; - a [j] = a[j + 1]; - a[j + 1] = temp; - } - } - } - - -} //end \ No newline at end of file diff --git a/codes/werxcg435/.keep b/codes/werxcg435/.keep deleted file mode 100644 index e69de29bb2d1d6434b8b29ae775ad8c2e48c5391..0000000000000000000000000000000000000000 diff --git a/codes/werxcg435/15829881.java b/codes/werxcg435/15829881.java deleted file mode 100644 index 6e9861fa3ec6d5a2553cdccd1bb1e977430c671b..0000000000000000000000000000000000000000 --- a/codes/werxcg435/15829881.java +++ /dev/null @@ -1,19 +0,0 @@ -/** - * 冒泡排序函数 - * aa bb cc - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - // 你的代码，使无序数组 a 变得有序 - for (int i = 0; i < n - 1; i++) { - for (int j = 0; j < n - i - 1; j++) { - if (a[j] > a[j + 1]) { - - int temp = a[j]; - a[j] = a[j + 1]; - a[j + 1] = temp; - } - } - } -} //end \ No newline at end of file diff --git a/codes/wesdfwerw/.keep b/codes/wesdfwerw/.keep deleted file mode 100644 index e69de29bb2d1d6434b8b29ae775ad8c2e48c5391..0000000000000000000000000000000000000000 diff --git a/codes/wesdfwerw/15831338.java b/codes/wesdfwerw/15831338.java deleted file mode 100644 index 6e9861fa3ec6d5a2553cdccd1bb1e977430c671b..0000000000000000000000000000000000000000 --- a/codes/wesdfwerw/15831338.java +++ /dev/null @@ -1,19 +0,0 @@ -/** - * 冒泡排序函数 - * aa bb cc - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - // 你的代码，使无序数组 a 变得有序 - for (int i = 0; i < n - 1; i++) { - for (int j = 0; j < n - i - 1; j++) { - if (a[j] > a[j + 1]) { - - int temp = a[j]; - a[j] = a[j + 1]; - a[j + 1] = temp; - } - } - } -} //end \ No newline at end of file diff --git a/codes/whc666/15671266.java b/codes/whc666/15671266.java deleted file mode 100644 index ff7eca84596587eab6d25e207c2cf25b1d158493..0000000000000000000000000000000000000000 --- a/codes/whc666/15671266.java +++ /dev/null @@ -1,19 +0,0 @@ -/** - * 冒泡排序函数 - * 这是一个简单的排序算法，通过重复地遍历要排序的数组， - * 比较每对相邻的项，如果它们的顺序错误就把它们交换过来。 - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - for(int i = 0; i < n-1; i++){ - for(int j = 0; j < n-i-1; j++){ - // 如果当前元素大于下一个元素，则交换它们 - if(a[j] > a[j+1]){ - int temp = a[j]; - a[j] = a[j+1]; - a[j+1] = temp; - } - } - } -} //end diff --git a/codes/whiteSteelRain/15781044.java b/codes/whiteSteelRain/15781044.java deleted file mode 100644 index c6cc828486a850419ae8683d70391fc64b42318a..0000000000000000000000000000000000000000 --- a/codes/whiteSteelRain/15781044.java +++ /dev/null @@ -1,18 +0,0 @@ -/** - * 冒泡排序函数 - * 通过相邻元素之间的比较和交换，使得每一轮迭代后最大（或最小）的元素能够“浮”到数组的末尾。 - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int[] a, int n) { - for (int i = 0; i < n - 1; i++) { // 外层循环，控制排序的轮数 - for (int j = 0; j < n - i - 1; j++) { // 内层循环，用于每轮相邻元素的比较和交换 - if (a[j] > a[j + 1]) { // 如果前一个元素大于后一个元素，则交换它们的位置 - // 交换 a[j] 和 a[j + 1] - int temp = a[j]; - a[j] = a[j + 1]; - a[j + 1] = temp; - } - } - } -} // end diff --git a/codes/windaos13/.keep b/codes/windaos13/.keep deleted file mode 100644 index e69de29bb2d1d6434b8b29ae775ad8c2e48c5391..0000000000000000000000000000000000000000 diff --git a/codes/windaos13/15841934.java b/codes/windaos13/15841934.java deleted file mode 100644 index 6e9861fa3ec6d5a2553cdccd1bb1e977430c671b..0000000000000000000000000000000000000000 --- a/codes/windaos13/15841934.java +++ /dev/null @@ -1,19 +0,0 @@ -/** - * 冒泡排序函数 - * aa bb cc - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - // 你的代码，使无序数组 a 变得有序 - for (int i = 0; i < n - 1; i++) { - for (int j = 0; j < n - i - 1; j++) { - if (a[j] > a[j + 1]) { - - int temp = a[j]; - a[j] = a[j + 1]; - a[j + 1] = temp; - } - } - } -} //end \ No newline at end of file diff --git a/codes/wingwf/15632876.java b/codes/wingwf/15632876.java deleted file mode 100644 index c2afaa2414da1853e4500b02c6de9068b64aeafe..0000000000000000000000000000000000000000 --- a/codes/wingwf/15632876.java +++ /dev/null @@ -1,18 +0,0 @@ -/** - * 冒泡排序函数 - * aa bb cc - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - for(int i = 0; i < n-1 ; i++){ - for (int j = 0;j < n-1-i;j++){ - if(a[j] > a[j+1]){ - int temp = a[j]; - a[j] = a[j+1]; - a[j+1] = temp; - } - } - } - -} //end diff --git a/codes/wisemansxl/.keep b/codes/wisemansxl/.keep deleted file mode 100644 index e69de29bb2d1d6434b8b29ae775ad8c2e48c5391..0000000000000000000000000000000000000000 diff --git a/codes/wisemansxl/15844299.java b/codes/wisemansxl/15844299.java deleted file mode 100644 index 6e9861fa3ec6d5a2553cdccd1bb1e977430c671b..0000000000000000000000000000000000000000 --- a/codes/wisemansxl/15844299.java +++ /dev/null @@ -1,19 +0,0 @@ -/** - * 冒泡排序函数 - * aa bb cc - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - // 你的代码，使无序数组 a 变得有序 - for (int i = 0; i < n - 1; i++) { - for (int j = 0; j < n - i - 1; j++) { - if (a[j] > a[j + 1]) { - - int temp = a[j]; - a[j] = a[j + 1]; - a[j + 1] = temp; - } - } - } -} //end \ No newline at end of file diff --git a/codes/witty1972/10970403.java b/codes/witty1972/10970403.java deleted file mode 100644 index 17fef721530efd49f410412d6cacc6ede8e756c3..0000000000000000000000000000000000000000 --- a/codes/witty1972/10970403.java +++ /dev/null @@ -1,18 +0,0 @@ -/** - * 冒泡排序函数 - * aa bb cc - * @param a 待排序的数组 - * @param l 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int l){ - // 你的代码，使无序数组 a 变得有序 - for (int i=0 ; ia[k+1]) { - int temp=a[k]; - a[k]=a[k+1]; - a[k+1]=temp; - } - } - } -} //end \ No newline at end of file diff --git a/codes/wjhh111/15628801.java b/codes/wjhh111/15628801.java deleted file mode 100644 index 04625a494ce3da760397a3c3c648cdbe5d0bfa71..0000000000000000000000000000000000000000 --- a/codes/wjhh111/15628801.java +++ /dev/null @@ -1,19 +0,0 @@ -/** - * 冒泡排序函数 - * aa bb cc - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - // 你的代码，使无序数组 a 变得有序 - for(int i = 0; i < n-1 ; i++){ - for (int j = 0;j < n-1-i;j++){ - if(a[j] > a[j+1]){ - int temp = a[j]; - a[j] = a[j+1]; - a[j+1] = temp; - } - } - } -} //end - diff --git a/codes/wjy030522/15582699.java b/codes/wjy030522/15582699.java deleted file mode 100644 index 23d208a4b8fdb0880b8baebff2ba2d52ee013b81..0000000000000000000000000000000000000000 --- a/codes/wjy030522/15582699.java +++ /dev/null @@ -1,18 +0,0 @@ -/** - * 冒泡排序函数 - * aa bb cc - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int[] a, int n) { - for (int i = 0; i < n - 1; i++) { - for (int j = 0; j < n - i - 1; j++) { - if (a[j] > a[j + 1]) { - // 交换a[j]和a[j+1]的位置 - int temp = a[j]; - a[j] = a[j + 1]; - a[j + 1] = temp; - } - } - } -} diff --git a/codes/wll123/10971000.java b/codes/wll123/10971000.java deleted file mode 100644 index 67a97db0f2fbb50ee06aa49da443c533d4552bcd..0000000000000000000000000000000000000000 --- a/codes/wll123/10971000.java +++ /dev/null @@ -1,11 +0,0 @@ -public static void bubbleSort(int [] a, int n) { -for (int i=0 ; ia[wll+1]) { -int temp=a[wll]; -a[wll]=a[wll+1]; -a[wll+1]=temp; -} -} -} -} diff --git a/codes/wll123/15541001.java b/codes/wll123/15541001.java deleted file mode 100644 index 324687283489419c5a6916c234a8848f65a5eb64..0000000000000000000000000000000000000000 --- a/codes/wll123/15541001.java +++ /dev/null @@ -1,20 +0,0 @@ -/** - * 冒泡排序函数 - * aa bb cc - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - // 你的代码，使无序数组 a 变得有序 - for(int i = 0; i < n; i++) { - for(int tata = 0; tata < n - i - 1; tata++) { - if(a[tata] > a[tata + 1]) { - int temp = a[tata]; - a [tata] = a[tata + 1]; - a[tata + 1] = temp; - } - } - } - - -} //end,tatazj diff --git a/codes/wmmnmd/11212424.java b/codes/wmmnmd/11212424.java deleted file mode 100644 index 8d589d7edfe50246fe5deff283186d81a64dc137..0000000000000000000000000000000000000000 --- a/codes/wmmnmd/11212424.java +++ /dev/null @@ -1,21 +0,0 @@ -/** - * 冒泡排序函数 - * aa bb cc - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a,int n){ - int temp =0; - for(int i = 0;ia[j+1]){ - temp = a[j]; - a[j] = a[j+1]; - a[j+1] = temp; - } - } - } - - - -} \ No newline at end of file diff --git a/codes/workii/9727876.java b/codes/workii/9727876.java deleted file mode 100644 index 029e9d84c1474520908887693e69aabcb7ff0aba..0000000000000000000000000000000000000000 --- a/codes/workii/9727876.java +++ /dev/null @@ -1,28 +0,0 @@ -/** - * 冒泡排序函数 - * aa bb cc - * @param a 待排序的数组 - * @param n 待排序的数组长度 -*/ -public static void bubbleSort(int [] a, int n){ - int j , k; - int flag = n ;//flag来记录最后交换的位置，也就是排序的尾边界 - - while (flag > 0){//排序未结束标志 - k = flag; //k 来记录遍历的尾边界 - flag = 0; - - for(j=1; j a[j]){//前面的数字大于后面的数字就交换 - //交换a[j-1]和a[j] - int temp; - temp = a[j-1]; - a[j-1] = a[j]; - a[j]=temp; - - //表示交换过数据; - flag = j;//记录最新的尾边界. - } - } - } -} \ No newline at end of file diff --git a/codes/wq456wrfs/.keep b/codes/wq456wrfs/.keep deleted file mode 100644 index e69de29bb2d1d6434b8b29ae775ad8c2e48c5391..0000000000000000000000000000000000000000 diff --git a/codes/wq456wrfs/15743473.java b/codes/wq456wrfs/15743473.java deleted file mode 100644 index 6e9861fa3ec6d5a2553cdccd1bb1e977430c671b..0000000000000000000000000000000000000000 --- a/codes/wq456wrfs/15743473.java +++ /dev/null @@ -1,19 +0,0 @@ -/** - * 冒泡排序函数 - * aa bb cc - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - // 你的代码，使无序数组 a 变得有序 - for (int i = 0; i < n - 1; i++) { - for (int j = 0; j < n - i - 1; j++) { - if (a[j] > a[j + 1]) { - - int temp = a[j]; - a[j] = a[j + 1]; - a[j + 1] = temp; - } - } - } -} //end \ No newline at end of file diff --git a/codes/wrtgre24513/.keep b/codes/wrtgre24513/.keep deleted file mode 100644 index e69de29bb2d1d6434b8b29ae775ad8c2e48c5391..0000000000000000000000000000000000000000 diff --git a/codes/wrtgre24513/15831250.java b/codes/wrtgre24513/15831250.java deleted file mode 100644 index 6e9861fa3ec6d5a2553cdccd1bb1e977430c671b..0000000000000000000000000000000000000000 --- a/codes/wrtgre24513/15831250.java +++ /dev/null @@ -1,19 +0,0 @@ -/** - * 冒泡排序函数 - * aa bb cc - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - // 你的代码，使无序数组 a 变得有序 - for (int i = 0; i < n - 1; i++) { - for (int j = 0; j < n - i - 1; j++) { - if (a[j] > a[j + 1]) { - - int temp = a[j]; - a[j] = a[j + 1]; - a[j + 1] = temp; - } - } - } -} //end \ No newline at end of file diff --git a/codes/wsq1234567/.keep b/codes/wsq1234567/.keep deleted file mode 100644 index e69de29bb2d1d6434b8b29ae775ad8c2e48c5391..0000000000000000000000000000000000000000 diff --git a/codes/wsq1234567/15815251.java b/codes/wsq1234567/15815251.java deleted file mode 100644 index 6e9861fa3ec6d5a2553cdccd1bb1e977430c671b..0000000000000000000000000000000000000000 --- a/codes/wsq1234567/15815251.java +++ /dev/null @@ -1,19 +0,0 @@ -/** - * 冒泡排序函数 - * aa bb cc - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - // 你的代码，使无序数组 a 变得有序 - for (int i = 0; i < n - 1; i++) { - for (int j = 0; j < n - i - 1; j++) { - if (a[j] > a[j + 1]) { - - int temp = a[j]; - a[j] = a[j + 1]; - a[j + 1] = temp; - } - } - } -} //end \ No newline at end of file diff --git a/codes/wtfock/11212229.java b/codes/wtfock/11212229.java deleted file mode 100644 index cdabc2e0876ad629e41ff055727cf3af34be8917..0000000000000000000000000000000000000000 --- a/codes/wtfock/11212229.java +++ /dev/null @@ -1,20 +0,0 @@ -/** - * 冒泡排序函数 - * aa bb cc - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - // 你的代码，使无序数组 a 变得有序 - for (int i = 0; i < n; i++) { - for (int j = i + 1; j < n; j++) { - if (a[i] > a[j]) { - int temp = a[j]; - a[j] = a[i]; - a[i] = temp; - - } - } - } - -} //end \ No newline at end of file diff --git a/codes/wu123-/15587168.java b/codes/wu123-/15587168.java deleted file mode 100644 index 2252b818e6125ed4f8bbd23eca03c12c15ca1757..0000000000000000000000000000000000000000 --- a/codes/wu123-/15587168.java +++ /dev/null @@ -1,19 +0,0 @@ -/** - * 冒泡排序函数 - * aa bb cc - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - // 你的代码，使无序数组 a 变得有序 - for (int i = 0; i < n - 1; i++) { - for (int j = 0; j < n - i - 1; j++) { - if (a[j] > a[j + 1]) { - // 交换元素 - int temp = a[j]; - a[j] = a[j + 1]; - a[j + 1] = temp; - } - } - } -} //end \ No newline at end of file diff --git a/codes/wu13935784487/15636076.java b/codes/wu13935784487/15636076.java deleted file mode 100644 index ba384e282a3ba1793fc7e59e40f742a9480a720f..0000000000000000000000000000000000000000 --- a/codes/wu13935784487/15636076.java +++ /dev/null @@ -1,20 +0,0 @@ - -/** - * 冒泡排序函数 - * aa bb cc - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - // 你的代码，使无序数组 a 变得有序 - for (int i = 0; i < n - 1; i++) { - for (int j = 0; j < n - 1 - i; j++) { - if (a[j] > a[j + 1]) { - int temp = a[j]; - a[j] = a[j + 1]; - a[j + 1] = temp; - } - } - } -} //end - diff --git a/codes/wu616562636/9947556.java b/codes/wu616562636/9947556.java deleted file mode 100644 index 835733e94dbc37ec9aa5b27d7f0347bb78d3ff13..0000000000000000000000000000000000000000 --- a/codes/wu616562636/9947556.java +++ /dev/null @@ -1,18 +0,0 @@ -/** - * 冒泡排序函数 - * aa bb cc - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - // 你的代码，使无序数组 a 变得有序 - for(int i=0;ia[j+1]){ - int tmp = a[j]; - a[j] = a[j + 1]; - a[j + 1] = tmp; - } - } - } -} //end diff --git a/codes/wuDaoya/11122066.java b/codes/wuDaoya/11122066.java deleted file mode 100644 index 9e7534d4b41cf071c848fa4d5c08c6519526b6e3..0000000000000000000000000000000000000000 --- a/codes/wuDaoya/11122066.java +++ /dev/null @@ -1,18 +0,0 @@ -/** - * 冒泡 排序 函数 - * aa bb cc - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - // 你的代码，使无序数组 a 变得有序 - for (int i = 0; i < n; i++) { - for (int j = 0; j < i; j++) { - if (a[i] < a[j]) { - int t = a[i]; - a[i] = a[j]; - a[j] = t; - } - } - } -}//end \ No newline at end of file diff --git a/codes/wucga1/11179945.java b/codes/wucga1/11179945.java deleted file mode 100644 index cdabc2e0876ad629e41ff055727cf3af34be8917..0000000000000000000000000000000000000000 --- a/codes/wucga1/11179945.java +++ /dev/null @@ -1,20 +0,0 @@ -/** - * 冒泡排序函数 - * aa bb cc - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - // 你的代码，使无序数组 a 变得有序 - for (int i = 0; i < n; i++) { - for (int j = i + 1; j < n; j++) { - if (a[i] > a[j]) { - int temp = a[j]; - a[j] = a[i]; - a[i] = temp; - - } - } - } - -} //end \ No newline at end of file diff --git a/codes/wuchangjun/15842345.java b/codes/wuchangjun/15842345.java deleted file mode 100644 index 9fa37648f7ba922c8e1188f6c5e91b31592eb54b..0000000000000000000000000000000000000000 --- a/codes/wuchangjun/15842345.java +++ /dev/null @@ -1,22 +0,0 @@ -/** - * 冒泡排序函数 - * 冒泡排序是一种简单的排序算法，它重复地遍历要排序的数列，一次比较两个元素，如果他们的顺序错误就把他们交换过来。 - * 遍历数列的工作是重复地进行直到没有再需要交换，也就是说该数列已经排序完成。 - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int[] a, int n) { - // 外层循环控制遍历的次数 - for (int i = 0; i < n - 1; i++) { - // 内层循环负责每次遍历时的相邻元素比较和交换 - for (int j = 0; j < n - i - 1; j++) { - // 如果当前元素大于下一个元素，则交换它们的位置 - if (a[j] > a[j + 1]) { - // 交换 a[j] 和 a[j+1] - int temp = a[j]; - a[j] = a[j + 1]; - a[j + 1] = temp; - } - } - } -} // end diff --git a/codes/wudi6662/.keep b/codes/wudi6662/.keep deleted file mode 100644 index e69de29bb2d1d6434b8b29ae775ad8c2e48c5391..0000000000000000000000000000000000000000 diff --git a/codes/wudi6662/15814869.java b/codes/wudi6662/15814869.java deleted file mode 100644 index 6e9861fa3ec6d5a2553cdccd1bb1e977430c671b..0000000000000000000000000000000000000000 --- a/codes/wudi6662/15814869.java +++ /dev/null @@ -1,19 +0,0 @@ -/** - * 冒泡排序函数 - * aa bb cc - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - // 你的代码，使无序数组 a 变得有序 - for (int i = 0; i < n - 1; i++) { - for (int j = 0; j < n - i - 1; j++) { - if (a[j] > a[j + 1]) { - - int temp = a[j]; - a[j] = a[j + 1]; - a[j + 1] = temp; - } - } - } -} //end \ No newline at end of file diff --git a/codes/wuli12345/15825475.java b/codes/wuli12345/15825475.java deleted file mode 100644 index 24f513b3219ac31ac3dcffe774647aa7bfdac254..0000000000000000000000000000000000000000 --- a/codes/wuli12345/15825475.java +++ /dev/null @@ -1,11 +0,0 @@ -public static void bubbleSort(int [] a, int n){ - for (int i = 0; i < n - 1; i++) { - for (int j = 0; j < n - 1 - i; j++) { - if (a[j] > a[j + 1]) { - int temp = a[j]; - a[j] = a[j + 1]; - a[j + 1] = temp; - } - } - } -} diff --git a/codes/wulibaibao/9691535.java b/codes/wulibaibao/9691535.java deleted file mode 100644 index d26e4c63f0ff629f116c8f9c7a0f50d886c1a085..0000000000000000000000000000000000000000 --- a/codes/wulibaibao/9691535.java +++ /dev/null @@ -1,20 +0,0 @@ -/** - * 冒泡排序函数 - * aa bb cc - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - // 你的代码，使无序数组 a 变得有序 - int temp;//定义一个临时变量 - for(int i=0;i a[j + 1]) { - int temp = a[j]; - a [j] = a[j + 1]; - a[j + 1] = temp; - } - } - } - - -} //end \ No newline at end of file diff --git a/codes/wupengyu/10969882.java b/codes/wupengyu/10969882.java deleted file mode 100644 index e8c00623e1098f480046be18e2267f3209083664..0000000000000000000000000000000000000000 --- a/codes/wupengyu/10969882.java +++ /dev/null @@ -1,18 +0,0 @@ -/** - * 冒泡排序函数 - * aa bb cc - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - // 你的代码，使无序数组 a 变得有序 - for (int i=0 ; ia[k+1]) { - int temp=a[k]; - a[k]=a[k+1]; - a[k+1]=temp; - } - } - } -} \ No newline at end of file diff --git a/codes/wuyifan1/.keep b/codes/wuyifan1/.keep deleted file mode 100644 index e69de29bb2d1d6434b8b29ae775ad8c2e48c5391..0000000000000000000000000000000000000000 diff --git a/codes/wuyifan1/15775795.java b/codes/wuyifan1/15775795.java deleted file mode 100644 index 9f86eb587f5fb5dee2fac7e589a1cf95128af5cc..0000000000000000000000000000000000000000 --- a/codes/wuyifan1/15775795.java +++ /dev/null @@ -1,18 +0,0 @@ -/** - * 冒泡排序函数 - * aa bb cc - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - // 你的代码，使无序数组 a 变得有序 - for(int i=0;ia[j+1]){ - a[j] = a[j]+a[j+1]; - a[j+1] = a[j]-a[j+1]; - a[j] = a[j]-a[j+1]; - } - } - } -} //end \ No newline at end of file diff --git a/codes/wuyifang8012/.keep b/codes/wuyifang8012/.keep deleted file mode 100644 index e69de29bb2d1d6434b8b29ae775ad8c2e48c5391..0000000000000000000000000000000000000000 diff --git a/codes/wuyifang8012/15815804.java b/codes/wuyifang8012/15815804.java deleted file mode 100644 index 6e9861fa3ec6d5a2553cdccd1bb1e977430c671b..0000000000000000000000000000000000000000 --- a/codes/wuyifang8012/15815804.java +++ /dev/null @@ -1,19 +0,0 @@ -/** - * 冒泡排序函数 - * aa bb cc - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - // 你的代码，使无序数组 a 变得有序 - for (int i = 0; i < n - 1; i++) { - for (int j = 0; j < n - i - 1; j++) { - if (a[j] > a[j + 1]) { - - int temp = a[j]; - a[j] = a[j + 1]; - a[j + 1] = temp; - } - } - } -} //end \ No newline at end of file diff --git a/codes/wuyiwei/.keep b/codes/wuyiwei/.keep deleted file mode 100644 index e69de29bb2d1d6434b8b29ae775ad8c2e48c5391..0000000000000000000000000000000000000000 diff --git a/codes/wuyiwei/15853979.java b/codes/wuyiwei/15853979.java deleted file mode 100644 index 6426772fb479b07ed3be21ef1867921d1dbb194c..0000000000000000000000000000000000000000 --- a/codes/wuyiwei/15853979.java +++ /dev/null @@ -1,20 +0,0 @@ -/** - * 冒泡排序函数 - * aa bb cc - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - // 你的代码，使无序数组 a 变得有序 - for(int i = 0; i < n; i++) { - for(int j = 0; j < n - i - 1; j++) { - if(a[j] > a[j + 1]) { - int temp = a[j]; - a [j] = a[j + 1]; - a[j + 1] = temp; - } - } - } - - -} //end \ No newline at end of file diff --git a/codes/wuzhenzi001/15711848.java b/codes/wuzhenzi001/15711848.java deleted file mode 100644 index b716c78c830b4135702410111305f4c87192e989..0000000000000000000000000000000000000000 --- a/codes/wuzhenzi001/15711848.java +++ /dev/null @@ -1,22 +0,0 @@ -/** - * 冒泡排序函数 - * 通过对相邻的元素进行两两比较，顺序相反则进行交换，每一轮比较会将当前未排序部分的最大值“冒泡”到未排序部分的末尾。 - * - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int[] a, int n) { - for (int i = 0; i < n - 1; i++) { // 外层循环，控制排序的轮数 - // i 表示当前已经排序好的元素个数，因此每一轮排序后，最大的元素会移到正确的位置 - for (int j = 0; j < n - i - 1; j++) { // 内层循环，控制每轮中比较的次数 - // j 表示当前比较的元素索引，从0开始到n-i-2，因为最后i个元素已经是排序好的 - if (a[j] > a[j + 1]) { // 如果当前元素大于下一个元素 - // 则交换这两个元素的位置，保证较大的元素向数组的末尾移动 - // 交换 a[j] 和 a[j+1] - int temp = a[j]; // 使用临时变量temp存储a[j]的值 - a[j] = a[j + 1]; // 将a[j+1]的值赋给a[j] - a[j + 1] = temp; // 将temp（即原来的a[j]的值）赋给a[j+1] - } - } - } -} diff --git a/codes/wwee123/15720571.java b/codes/wwee123/15720571.java deleted file mode 100644 index 987377810b5beca8eb4bf5eafeee5db45e234a87..0000000000000000000000000000000000000000 --- a/codes/wwee123/15720571.java +++ /dev/null @@ -1,20 +0,0 @@ -/** - * 冒泡排序函数 - * aa bb cc - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - // 你的代码，使无序数组 a 变得有序 - for(int i = 0; i < n; i++) { - for(int liuy = 0; liuy < n - i - 1; liuy++) { - if(a[liuy] > a[liuy + 1]) { - int temp = a[liuy]; - a [liuy] = a[liuy + 1]; - a[liuy + 1] = temp; - } - } - } - - -} //end,liuy diff --git a/codes/wwh1096046571/.keep b/codes/wwh1096046571/.keep deleted file mode 100644 index e69de29bb2d1d6434b8b29ae775ad8c2e48c5391..0000000000000000000000000000000000000000 diff --git a/codes/wwh1096046571/10040814.java b/codes/wwh1096046571/10040814.java deleted file mode 100644 index 29d27043d3c8103739e7a1d2a27e77b4cc475876..0000000000000000000000000000000000000000 --- a/codes/wwh1096046571/10040814.java +++ /dev/null @@ -1,23 +0,0 @@ -/** - * 冒泡排序函数 - * aa bb cc - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - // 你的代码，使无序数组 a 变得有序 - for (int i = 0; i < n-1; i++) { - for (int j = 0; j < n-1-i; j++) { - if (a[j] >= a[j+1]) { - int temp = a[j]; - a[j] = a[j+1]; - a[j+1] = temp; - } - } - } - - System.out.print("冒泡排序的结果是： "); - for (int i : a) { - System.out.print(i + " "); - } -} //end \ No newline at end of file diff --git a/codes/wws001227/15774783.java b/codes/wws001227/15774783.java deleted file mode 100644 index 4d9a324f5ba71d51fe6bce087bee818971b65d57..0000000000000000000000000000000000000000 --- a/codes/wws001227/15774783.java +++ /dev/null @@ -1,19 +0,0 @@ -/** - * 冒泡排序函数 - * 通过不断比较相邻元素，并交换位置（如果前一个元素大于后一个元素），将最大元素逐渐“浮”到数组的末尾， - * 重复这个过程直到整个数组有序。 - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - for (int i = 0; i < n - 1; i++) { // 外层循环，控制冒泡的轮数 - for (int j = 0; j < n - 1 - i; j++) { // 内层循环，进行相邻元素的比较和交换 - if (a[j] > a[j + 1]) { // 如果前一个元素大于后一个元素 - // 交换位置 - int temp = a[j]; - a[j] = a[j + 1]; - a[j + 1] = temp; - } - } - } -} //end diff --git a/codes/www123456/15837892.java b/codes/www123456/15837892.java deleted file mode 100644 index 24f513b3219ac31ac3dcffe774647aa7bfdac254..0000000000000000000000000000000000000000 --- a/codes/www123456/15837892.java +++ /dev/null @@ -1,11 +0,0 @@ -public static void bubbleSort(int [] a, int n){ - for (int i = 0; i < n - 1; i++) { - for (int j = 0; j < n - 1 - i; j++) { - if (a[j] > a[j + 1]) { - int temp = a[j]; - a[j] = a[j + 1]; - a[j + 1] = temp; - } - } - } -} diff --git a/codes/wxf68725032/10117253.java b/codes/wxf68725032/10117253.java deleted file mode 100644 index b80bde062ebabb5b4152ce6521bd5adbcef89438..0000000000000000000000000000000000000000 --- a/codes/wxf68725032/10117253.java +++ /dev/null @@ -1,11 +0,0 @@ -public static void bubbleSort(int [] a,int n){ - for(int i = 0; i < n-1 ; i++){ - for (int j = 0;j < n-1-i;j++){ - if(a[j] > a[j+1]){ - int temp = a[j]; - a[j] = a[j+1]; - a[j+1] = temp; - } - } - } -} diff --git a/codes/wxyaya/15684359.java b/codes/wxyaya/15684359.java deleted file mode 100644 index 987377810b5beca8eb4bf5eafeee5db45e234a87..0000000000000000000000000000000000000000 --- a/codes/wxyaya/15684359.java +++ /dev/null @@ -1,20 +0,0 @@ -/** - * 冒泡排序函数 - * aa bb cc - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - // 你的代码，使无序数组 a 变得有序 - for(int i = 0; i < n; i++) { - for(int liuy = 0; liuy < n - i - 1; liuy++) { - if(a[liuy] > a[liuy + 1]) { - int temp = a[liuy]; - a [liuy] = a[liuy + 1]; - a[liuy + 1] = temp; - } - } - } - - -} //end,liuy diff --git a/codes/wy16651754941/.keep b/codes/wy16651754941/.keep deleted file mode 100644 index e69de29bb2d1d6434b8b29ae775ad8c2e48c5391..0000000000000000000000000000000000000000 diff --git a/codes/wy16651754941/10972345.java b/codes/wy16651754941/10972345.java deleted file mode 100644 index 9eccfac593dd84bb4c285d230d4de6b8c72a1d65..0000000000000000000000000000000000000000 --- a/codes/wy16651754941/10972345.java +++ /dev/null @@ -1,11 +0,0 @@ -public static void bubbleSort(int [] a, int n) { - for (int i=0 ; ia[j+1]) { - int temp=a[j]; - a[j]=a[j+1]; - a[j+1]=temp; - } - } - } -} diff --git a/codes/wyg12345/15860946.java b/codes/wyg12345/15860946.java deleted file mode 100644 index 54c5f3869cd16ee9e7c2b77895a39fae63f05dbc..0000000000000000000000000000000000000000 --- a/codes/wyg12345/15860946.java +++ /dev/null @@ -1,20 +0,0 @@ -/** - * 冒泡排序函数 - * aa bb cc - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - // 你的代码，使无序数组 a 变得有序 - for(int i = 0; i < n; i++) { - for(int liuy = 0; liuy < n - i - 1; liuy++) { - if(a[liuy] > a[liuy + 1]) { - int temp = a[liuy]; - a [liuy] = a[liuy + 1]; - a[liuy + 1] = temp; - } - } - } - - -} //end,liuy \ No newline at end of file diff --git a/codes/wyj111/15781098.java b/codes/wyj111/15781098.java deleted file mode 100644 index 150557d77edcc32efa6e6ad83c806a01c9eef423..0000000000000000000000000000000000000000 --- a/codes/wyj111/15781098.java +++ /dev/null @@ -1,26 +0,0 @@ -/** - * 冒泡排序函数 - * 对数组a进行升序排序 - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - for (int i = 0; i < n - 1; i++) { - // 标记，表示这一趟是否有交换，优化冒泡排序性能 - boolean swapped = false; - for (int j = 0; j < n - i - 1; j++) { - // 如果前一个元素大于后一个元素，则交换它们的位置 - if (a[j] > a[j + 1]) { - int temp = a[j]; - a[j] = a[j + 1]; - a[j + 1] = temp; - // 表示有交换发生 - swapped = true; - } - } - // 如果这一趟没有发生交换，说明数组已经有序，直接退出循环 - if (!swapped) { - break; - } - } -} //end diff --git a/codes/wyk12345/9950042.java b/codes/wyk12345/9950042.java deleted file mode 100644 index e7e148134fc132dad44ff7afe942282adb454145..0000000000000000000000000000000000000000 --- a/codes/wyk12345/9950042.java +++ /dev/null @@ -1,19 +0,0 @@ -/** - * 冒泡排序函数 - * aa bb cc - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - // 你的代码，使无序数组 a 变得有序 - for (int i=0; i < n - 1; i++) { - for (int j = 0; j < n - i - 1; j++) { - if (a[j]>a[j+1]) { - int temp = a[j]; - a[j] = a[j+1]; - a[j+1] = temp; - } - } - } - -} //end diff --git a/codes/wyk18220700018/15845948.java b/codes/wyk18220700018/15845948.java deleted file mode 100644 index 6b56f2d29fa502ee28e8f29b0240b6bbc18bce73..0000000000000000000000000000000000000000 --- a/codes/wyk18220700018/15845948.java +++ /dev/null @@ -1,20 +0,0 @@ -/** - * 冒泡排序函数 - * 对数组进行冒泡排序，从小到大排序 - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - // 外层循环控制所有元素是否排序完成 - for (int i = 0; i < n - 1; i++) { - // 内层循环控制相邻元素两两比较 - for (int j = 0; j < n - 1 - i; j++) { - // 如果前一个元素大于后一个元素，则交换他们的位置 - if (a[j] > a[j + 1]) { - int temp = a[j]; - a[j] = a[j + 1]; - a[j + 1] = temp; - } - } - } -} //end diff --git a/codes/wypdao/15807776.java b/codes/wypdao/15807776.java deleted file mode 100644 index ba2505c0ca5f524914552018b96515698d2badd4..0000000000000000000000000000000000000000 --- a/codes/wypdao/15807776.java +++ /dev/null @@ -1,20 +0,0 @@ -/** -* 冒泡排序函数 -* aa bb cc -* @param a 待排序的数组 -* @param n 待排序的数组长度 -*/ -public static void bubbleSort(int [] a, int n){ - // 你的代码，使无序数组 a 变得有序 - for (int i = 0; i < n - 1; i++) { - for (int j = 0; j < n - i - 1; j++) { - if (a[j] > a[j + 1]) { - // 交换元素 - int temp = a[j]; - a[j] = a[j + 1]; - a[j + 1] = temp; - } - } - } -} //end - diff --git a/codes/wypdao/15837238.java b/codes/wypdao/15837238.java deleted file mode 100644 index 33be1b95e65b4aac0ebce48bfeb09323f568c4f7..0000000000000000000000000000000000000000 --- a/codes/wypdao/15837238.java +++ /dev/null @@ -1,19 +0,0 @@ -/** -* 冒泡排序函数 -* aa bb cc -* @param a 待排序的数组 -* @param n 待排序的数组长度 -*/ -public static void bubbleSort(int [] a, int n){ -// 你的代码，使无序数组 a 变得有序 -for (int i = 0; i < n - 1; i++) { -for (int j = 0; j < n - i - 1; j++) { -if (a[j] > a[j + 1]) { -// 交换元素 -int temp = a[j]; -a[j] = a[j + 1]; -a[j + 1] = temp; -} -} -} -} //end diff --git a/codes/wza20021216/15778780.java b/codes/wza20021216/15778780.java deleted file mode 100644 index 196cfffc1220a52fd9ddcae7aaa44001df69f2c1..0000000000000000000000000000000000000000 --- a/codes/wza20021216/15778780.java +++ /dev/null @@ -1,18 +0,0 @@ -/** - * 冒泡排序函数 - * 该函数用于对整数数组进行升序排序 - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - for(int i = 0; i < n - 1; i++){ - for(int j = 0; j < n - i - 1; j++){ - // 如果前一个元素大于后一个元素，则交换它们的位置 - if(a[j] > a[j + 1]){ - int temp = a[j]; - a[j] = a[j + 1]; - a[j + 1] = temp; - } - } - } -} //end diff --git a/codes/wzj123/15628771.java b/codes/wzj123/15628771.java deleted file mode 100644 index 4127ce2b2a03df3241338ff0d58963e659bf7652..0000000000000000000000000000000000000000 --- a/codes/wzj123/15628771.java +++ /dev/null @@ -1,20 +0,0 @@ -/** - * 冒泡排序函数 - * aa bb cc - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - // 你的代码，使无序数组 a 变得有序 - for(int i = 0; i < n; i++) { - for(int wzj = 0; wzj < n - i - 1; wzj++) { - if(a[wzj] > a[wzj + 1]) { - int temp = a[wzj]; - a [wzj] = a[wzj + 1]; - a[wzj + 1] = temp; - } - } - } - - -} //end,wzj diff --git a/codes/wzj66666/15848821.java b/codes/wzj66666/15848821.java deleted file mode 100644 index 809e6c454de4e33d540c35a26f34e2679a08693a..0000000000000000000000000000000000000000 --- a/codes/wzj66666/15848821.java +++ /dev/null @@ -1,18 +0,0 @@ -/** - * 冒泡排序函数 - * 通过相邻元素两两比较和交换，使得每一轮循环后最大（或最小）的元素“冒泡”到数组的末尾。 - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int[] a, int n) { - for (int i = 0; i < n - 1; i++) { // 外层循环控制比较轮数 - for (int j = 0; j < n - 1 - i; j++) { // 内层循环控制每轮比较的次数 - if (a[j] > a[j + 1]) { // 如果当前元素大于下一个元素，则交换它们的位置 - // 交换 a[j] 和 a[j + 1] - int temp = a[j]; - a[j] = a[j + 1]; - a[j + 1] = temp; - } - } - } -} //end diff --git a/codes/wzj666662/15860936.java b/codes/wzj666662/15860936.java deleted file mode 100644 index 271d2f1dfec9c226694fa24afe300e49f150ca51..0000000000000000000000000000000000000000 --- a/codes/wzj666662/15860936.java +++ /dev/null @@ -1,18 +0,0 @@ -/** - * 冒泡排序函数 - * 将数组a按照从小到大的顺序排序 - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int[] a, int n) { - for (int i = 0; i < n - 1; i++) { // 外层循环，决定冒泡的趟数 - for (int j = 0; j < n - 1 - i; j++) { // 内层循环，决定每趟比较的次数 - if (a[j] > a[j + 1]) { // 如果当前元素大于下一个元素，则交换它们的位置 - // 交换a[j]和a[j + 1] - int temp = a[j]; - a[j] = a[j + 1]; - a[j + 1] = temp; - } - } - } -} // end diff --git a/codes/x123456/10987993.java b/codes/x123456/10987993.java deleted file mode 100644 index 5734db7cf39e899889811c1565df67b4313f5b3a..0000000000000000000000000000000000000000 --- a/codes/x123456/10987993.java +++ /dev/null @@ -1,11 +0,0 @@ -public static void bubbleSort(int [] a, int n) { -for (int i=0 ; ia[xiangxixi+1]) { -int temp=a[xiangxixi]; -a[xiangxixi]=a[xiangxixi+1]; -a[xiangxixi+1]=temp; -} -} -} -} diff --git a/codes/x123456/15539350.java b/codes/x123456/15539350.java deleted file mode 100644 index 05f4af4cc82e38626109fbe95ac0ee530c079fa7..0000000000000000000000000000000000000000 --- a/codes/x123456/15539350.java +++ /dev/null @@ -1,20 +0,0 @@ -/** - * 冒泡排序函数 - * aa bb cc - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - // 你的代码，使无序数组 a 变得有序 - for(int i = 0; i < n; i++) { - for(int xixi = 0; xixi < n - i - 1; xixi++) { - if(a[xixi] > a[xixi + 1]) { - int temp = a[xixi]; - a [xixi] = a[xixi + 1]; - a[xixi + 1] = temp; - } - } - } - - -} //end,240316 diff --git a/codes/x13433445193/15781690.java b/codes/x13433445193/15781690.java deleted file mode 100644 index bb168f6623a64ebc93127f8e2f7bfeec81e28990..0000000000000000000000000000000000000000 --- a/codes/x13433445193/15781690.java +++ /dev/null @@ -1,18 +0,0 @@ -/** - * 冒泡排序函数 - * 功能：将无序数组通过冒泡排序变得有序 - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - for (int i = 0; i < n - 1; i++) { - for (int j = 0; j < n - i - 1; j++) { - // 如果当前元素大于下一个元素，则交换位置 - if (a[j] > a[j + 1]) { - int temp = a[j]; - a[j] = a[j + 1]; - a[j + 1] = temp; - } - } - } -} //end diff --git a/codes/xaioli/15562718.java b/codes/xaioli/15562718.java deleted file mode 100644 index 854beb62bfcf4ead3549d682ffca7f1b9f32d947..0000000000000000000000000000000000000000 --- a/codes/xaioli/15562718.java +++ /dev/null @@ -1,19 +0,0 @@ -/** - * 冒泡排序函数 - * aa bb cc - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - for(int i = 0; i < n-1 ; i++){ - for (int j = 0;j < n-1-i;j++){ - if(a[j] > a[j+1]){ - int temp = a[j]; - a[j] = a[j+1]; - a[j+1] = temp; - } - } - } - -} //end - diff --git a/codes/xcw18988783240/.keep b/codes/xcw18988783240/.keep deleted file mode 100644 index e69de29bb2d1d6434b8b29ae775ad8c2e48c5391..0000000000000000000000000000000000000000 diff --git a/codes/xcw18988783240/10972415.java b/codes/xcw18988783240/10972415.java deleted file mode 100644 index 9eccfac593dd84bb4c285d230d4de6b8c72a1d65..0000000000000000000000000000000000000000 --- a/codes/xcw18988783240/10972415.java +++ /dev/null @@ -1,11 +0,0 @@ -public static void bubbleSort(int [] a, int n) { - for (int i=0 ; ia[j+1]) { - int temp=a[j]; - a[j]=a[j+1]; - a[j+1]=temp; - } - } - } -} diff --git a/codes/xd16750866428/.keep b/codes/xd16750866428/.keep deleted file mode 100644 index e69de29bb2d1d6434b8b29ae775ad8c2e48c5391..0000000000000000000000000000000000000000 diff --git a/codes/xd16750866428/10972670.java b/codes/xd16750866428/10972670.java deleted file mode 100644 index 9eccfac593dd84bb4c285d230d4de6b8c72a1d65..0000000000000000000000000000000000000000 --- a/codes/xd16750866428/10972670.java +++ /dev/null @@ -1,11 +0,0 @@ -public static void bubbleSort(int [] a, int n) { - for (int i=0 ; ia[j+1]) { - int temp=a[j]; - a[j]=a[j+1]; - a[j+1]=temp; - } - } - } -} diff --git a/codes/xhm17860971687/.keep b/codes/xhm17860971687/.keep deleted file mode 100644 index e69de29bb2d1d6434b8b29ae775ad8c2e48c5391..0000000000000000000000000000000000000000 diff --git a/codes/xhm17860971687/10043024.java b/codes/xhm17860971687/10043024.java deleted file mode 100644 index 667eee0f585ec38ce639cb36d80df080e935946d..0000000000000000000000000000000000000000 --- a/codes/xhm17860971687/10043024.java +++ /dev/null @@ -1,11 +0,0 @@ -public static void bubbleSort(int [] a,int n){ - for(int i = 0; i < n-1 ; i++){ - for (int j = 0;j < n-1-i;j++){ - if(a[j] > a[j+1]){ - int temp = a[j]; - a[j] = a[j+1]; - a[j+1] = temp; - } - } - } -} \ No newline at end of file diff --git a/codes/xi13313987553/.keep b/codes/xi13313987553/.keep deleted file mode 100644 index e69de29bb2d1d6434b8b29ae775ad8c2e48c5391..0000000000000000000000000000000000000000 diff --git a/codes/xi13313987553/10972326.java b/codes/xi13313987553/10972326.java deleted file mode 100644 index 9eccfac593dd84bb4c285d230d4de6b8c72a1d65..0000000000000000000000000000000000000000 --- a/codes/xi13313987553/10972326.java +++ /dev/null @@ -1,11 +0,0 @@ -public static void bubbleSort(int [] a, int n) { - for (int i=0 ; ia[j+1]) { - int temp=a[j]; - a[j]=a[j+1]; - a[j+1]=temp; - } - } - } -} diff --git a/codes/xiandeya/15845628.java b/codes/xiandeya/15845628.java deleted file mode 100644 index 987377810b5beca8eb4bf5eafeee5db45e234a87..0000000000000000000000000000000000000000 --- a/codes/xiandeya/15845628.java +++ /dev/null @@ -1,20 +0,0 @@ -/** - * 冒泡排序函数 - * aa bb cc - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - // 你的代码，使无序数组 a 变得有序 - for(int i = 0; i < n; i++) { - for(int liuy = 0; liuy < n - i - 1; liuy++) { - if(a[liuy] > a[liuy + 1]) { - int temp = a[liuy]; - a [liuy] = a[liuy + 1]; - a[liuy + 1] = temp; - } - } - } - - -} //end,liuy diff --git a/codes/xiao15108075188/15845548.java b/codes/xiao15108075188/15845548.java deleted file mode 100644 index b0fe3ab1d61fcf8e776af3701e3f79518eec1ee7..0000000000000000000000000000000000000000 --- a/codes/xiao15108075188/15845548.java +++ /dev/null @@ -1,26 +0,0 @@ -/** - * 冒泡排序函数 - * 该函数使用冒泡排序算法对给定的数组进行升序排序 - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - for (int i = 0; i < n - 1; i++) { - // 标志位，表示这一趟排序是否有交换，优化冒泡排序性能 - boolean swapped = false; - for (int j = 0; j < n - i - 1; j++) { - // 如果当前元素大于下一个元素，则交换它们的位置 - if (a[j] > a[j + 1]) { - int temp = a[j]; - a[j] = a[j + 1]; - a[j + 1] = temp; - // 发生了交换，将标志位设为true - swapped = true; - } - } - // 如果没有发生交换，说明数组已经有序，可以提前结束排序 - if (!swapped) { - break; - } - } -} //end diff --git a/codes/xiao555/.java.swp b/codes/xiao555/.java.swp deleted file mode 100644 index 795788efc79a796adfe4f73a643c3ca4c175dbd3..0000000000000000000000000000000000000000 Binary files a/codes/xiao555/.java.swp and /dev/null differ diff --git a/codes/xiao555/15576144.java b/codes/xiao555/15576144.java deleted file mode 100644 index d37655e03d86725efd557432545637d3ab3e021b..0000000000000000000000000000000000000000 --- a/codes/xiao555/15576144.java +++ /dev/null @@ -1,19 +0,0 @@ -/** - * 冒泡排序函数 - * aa bb cc - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - // 你的代码，使无序数组 a 变得有序 - for (int i = 0; i < n - 1; i++) { - for (int j = 0; j < n - i - 1; j++) { - if (a[j] > a[j + 1]) { - // 交换 a[j] 和 a[j+1] - int temp = a[j]; - a[j] = a[j + 1]; - a[j + 1] = temp; - } - } - } -} //end diff --git a/codes/xiaoai/15563405.java b/codes/xiaoai/15563405.java deleted file mode 100644 index ae82e695cbfd360050241c3f1f592658c8c1d4e7..0000000000000000000000000000000000000000 --- a/codes/xiaoai/15563405.java +++ /dev/null @@ -1,35 +0,0 @@ -/** - - * 冒泡排序函数 - - * aa bb cc - - * @param a 待排序的数组 - - * @param n 待排序的数组长度 - - */ - -public static void bubbleSort(int [] a, int n){ - - for(int i = 0; i < n-1 ; i++){ - - for (int j = 0;j < n-1-i;j++){ - - if(a[j] > a[j+1]){ - - int temp = a[j]; - - a[j] = a[j+1]; - - a[j+1] = temp; - - } - - } - - } - - - -} //end diff --git a/codes/xiaochen322/15821124.java b/codes/xiaochen322/15821124.java deleted file mode 100644 index 24f513b3219ac31ac3dcffe774647aa7bfdac254..0000000000000000000000000000000000000000 --- a/codes/xiaochen322/15821124.java +++ /dev/null @@ -1,11 +0,0 @@ -public static void bubbleSort(int [] a, int n){ - for (int i = 0; i < n - 1; i++) { - for (int j = 0; j < n - 1 - i; j++) { - if (a[j] > a[j + 1]) { - int temp = a[j]; - a[j] = a[j + 1]; - a[j + 1] = temp; - } - } - } -} diff --git a/codes/xiaoduo/15742206.java b/codes/xiaoduo/15742206.java deleted file mode 100644 index 987377810b5beca8eb4bf5eafeee5db45e234a87..0000000000000000000000000000000000000000 --- a/codes/xiaoduo/15742206.java +++ /dev/null @@ -1,20 +0,0 @@ -/** - * 冒泡排序函数 - * aa bb cc - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - // 你的代码，使无序数组 a 变得有序 - for(int i = 0; i < n; i++) { - for(int liuy = 0; liuy < n - i - 1; liuy++) { - if(a[liuy] > a[liuy + 1]) { - int temp = a[liuy]; - a [liuy] = a[liuy + 1]; - a[liuy + 1] = temp; - } - } - } - - -} //end,liuy diff --git a/codes/xiaoer1/15626743.java b/codes/xiaoer1/15626743.java deleted file mode 100644 index ba0c7823c8c801b5bd59ec7814d26f2828d9f8bf..0000000000000000000000000000000000000000 --- a/codes/xiaoer1/15626743.java +++ /dev/null @@ -1,17 +0,0 @@ -/** - * 冒泡排序函数 - * 冒泡排序是一种简单的排序算法，它重复地遍历要排序的数列，一次比较两个元素，如果他们的顺序错误就把他们交换过来。 - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - for (int i = 0; i < n - 1; i++) { // 外层循环控制遍历次数 - for (int j = 0; j < n - 1 - i; j++) { // 内层循环控制每一轮的比较次数 - if (a[j] > a[j + 1]) { // 如果前一个元素大于后一个元素，则交换它们的位置 - int temp = a[j]; - a[j] = a[j + 1]; - a[j + 1] = temp; - } - } - } -} //end diff --git a/codes/xiaohanhan/15743008.java b/codes/xiaohanhan/15743008.java deleted file mode 100644 index f2b711a46fe664a20752955f5730ee67702ccb8b..0000000000000000000000000000000000000000 --- a/codes/xiaohanhan/15743008.java +++ /dev/null @@ -1,20 +0,0 @@ -/** - * 冒泡排序函数 - * aa bb cc - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - // 你的代码，使无序数组 a 变得有序 - for(int i = 0; i < n; i++) { - for(int huat = 0; huat < n - i - 1; huat++) { - if(a[huat] > a[huat + 1]) { - int temp = a[huat]; - a [huat] = a[huat + 1]; - a[huat + 1] = temp; - } - } - } - - -} //end,huat diff --git a/codes/xiaohuaya/15742515.java b/codes/xiaohuaya/15742515.java deleted file mode 100644 index 987377810b5beca8eb4bf5eafeee5db45e234a87..0000000000000000000000000000000000000000 --- a/codes/xiaohuaya/15742515.java +++ /dev/null @@ -1,20 +0,0 @@ -/** - * 冒泡排序函数 - * aa bb cc - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - // 你的代码，使无序数组 a 变得有序 - for(int i = 0; i < n; i++) { - for(int liuy = 0; liuy < n - i - 1; liuy++) { - if(a[liuy] > a[liuy + 1]) { - int temp = a[liuy]; - a [liuy] = a[liuy + 1]; - a[liuy + 1] = temp; - } - } - } - - -} //end,liuy diff --git a/codes/xiaohudui/15724769.java b/codes/xiaohudui/15724769.java deleted file mode 100644 index d612a9d6324e9ddde1fce6ccb74b38a12b4e973d..0000000000000000000000000000000000000000 --- a/codes/xiaohudui/15724769.java +++ /dev/null @@ -1,27 +0,0 @@ -/** - * 冒泡排序函数 - * 将无序数组通过冒泡排序算法变为有序数组 - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - for (int i = 0; i < n - 1; i++) { - // 设置一个标志位，用于优化算法，减少不必要的比较 - boolean swapped = false; - for (int j = 0; j < n - i - 1; j++) { - // 如果前一个元素比后一个元素大，则交换它们的位置 - if (a[j] > a[j + 1]) { - int temp = a[j]; - a[j] = a[j + 1]; - a[j + 1] = temp; - // 如果有元素交换，则标志位设为true - swapped = true; - } - } - // 如果没有元素交换，说明数组已经有序，可以提前结束排序 - if (!swapped) { - break; - } - } -} //end - diff --git a/codes/xiaohudui/:wqwq b/codes/xiaohudui/:wqwq deleted file mode 100644 index d612a9d6324e9ddde1fce6ccb74b38a12b4e973d..0000000000000000000000000000000000000000 --- a/codes/xiaohudui/:wqwq +++ /dev/null @@ -1,27 +0,0 @@ -/** - * 冒泡排序函数 - * 将无序数组通过冒泡排序算法变为有序数组 - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - for (int i = 0; i < n - 1; i++) { - // 设置一个标志位，用于优化算法，减少不必要的比较 - boolean swapped = false; - for (int j = 0; j < n - i - 1; j++) { - // 如果前一个元素比后一个元素大，则交换它们的位置 - if (a[j] > a[j + 1]) { - int temp = a[j]; - a[j] = a[j + 1]; - a[j + 1] = temp; - // 如果有元素交换，则标志位设为true - swapped = true; - } - } - // 如果没有元素交换，说明数组已经有序，可以提前结束排序 - if (!swapped) { - break; - } - } -} //end - diff --git a/codes/xiaojun614/15778779.java b/codes/xiaojun614/15778779.java deleted file mode 100644 index fd29ee9751e3ce9e14043e1e185ec6f035affc03..0000000000000000000000000000000000000000 --- a/codes/xiaojun614/15778779.java +++ /dev/null @@ -1,18 +0,0 @@ -/** - * 冒泡排序函数 - * 将无序数组通过冒泡排序变为有序数组 - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int[] a, int n) { - for (int i = 0; i < n - 1; i++) { // 外层循环，控制比较轮数 - for (int j = 0; j < n - 1 - i; j++) { // 内层循环，进行相邻元素比较 - if (a[j] > a[j + 1]) { // 如果前一个元素大于后一个元素，则交换它们 - // 交换 a[j] 和 a[j+1] - int temp = a[j]; - a[j] = a[j + 1]; - a[j + 1] = temp; - } - } - } -} // end diff --git a/codes/xiaomi167/15759142.java b/codes/xiaomi167/15759142.java deleted file mode 100644 index 76cbddd876f8669466e0a2651682cee667741713..0000000000000000000000000000000000000000 --- a/codes/xiaomi167/15759142.java +++ /dev/null @@ -1,20 +0,0 @@ -/** - * 冒泡排序函数 - * aa bb cc - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - // 你的代码，使无序数组 a 变得有序 - for(int i = 0; i < n; i++) { - for(int b = 0; b < n - i - 1; b++) { - if(a[b] > a[b + 1]) { - int temp = a[b]; - a [b] = a[b + 1]; - a[b + 1] = temp; - } - } - } - - -} //end diff --git a/codes/xiaosheng333/15692737.java b/codes/xiaosheng333/15692737.java deleted file mode 100644 index c2afaa2414da1853e4500b02c6de9068b64aeafe..0000000000000000000000000000000000000000 --- a/codes/xiaosheng333/15692737.java +++ /dev/null @@ -1,18 +0,0 @@ -/** - * 冒泡排序函数 - * aa bb cc - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - for(int i = 0; i < n-1 ; i++){ - for (int j = 0;j < n-1-i;j++){ - if(a[j] > a[j+1]){ - int temp = a[j]; - a[j] = a[j+1]; - a[j+1] = temp; - } - } - } - -} //end diff --git a/codes/xiaowang818/15651046.java b/codes/xiaowang818/15651046.java deleted file mode 100644 index efccdd392a01ad6c4c94f113aeea500c9578d82e..0000000000000000000000000000000000000000 --- a/codes/xiaowang818/15651046.java +++ /dev/null @@ -1,18 +0,0 @@ -/** - * 冒泡排序函数 - * aa bb cc - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - // 你的代码，使无序数组 a 变得有序 - for(int i = 0; i < n; i++) { - for(int j = 0; j < n - i - 1; ++j) { - if(a[j] > a[j + 1]) { - int tmp = a[j]; - a[j] = a[j + 1]; - a[j + 1] = tmp; - } - } - } -} //end diff --git a/codes/xiaowuya/15742288.java b/codes/xiaowuya/15742288.java deleted file mode 100644 index 987377810b5beca8eb4bf5eafeee5db45e234a87..0000000000000000000000000000000000000000 --- a/codes/xiaowuya/15742288.java +++ /dev/null @@ -1,20 +0,0 @@ -/** - * 冒泡排序函数 - * aa bb cc - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - // 你的代码，使无序数组 a 变得有序 - for(int i = 0; i < n; i++) { - for(int liuy = 0; liuy < n - i - 1; liuy++) { - if(a[liuy] > a[liuy + 1]) { - int temp = a[liuy]; - a [liuy] = a[liuy + 1]; - a[liuy + 1] = temp; - } - } - } - - -} //end,liuy diff --git a/codes/xiaoxiaoxiao/15833583.java b/codes/xiaoxiaoxiao/15833583.java deleted file mode 100644 index d0e7038df81a1dcd40ba57e5267839caad594f03..0000000000000000000000000000000000000000 --- a/codes/xiaoxiaoxiao/15833583.java +++ /dev/null @@ -1,19 +0,0 @@ -/** - * 冒泡排序函数 - * 冒泡排序是一种简单的排序算法，它重复地遍历要排序的数列，一次比较两个元素，如果他们的顺序错误就把他们交换过来。 - * 遍历数列的工作是重复地进行直到没有再需要交换，也就是说该数列已经排序完成。 - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - for (int i = 0; i < n - 1; i++) { // 外层循环控制比较的次数 - for (int j = 0; j < n - 1 - i; j++) { // 内层循环控制每一轮比较的次数 - // 如果前一个元素比后一个元素大，则交换它们的位置 - if (a[j] > a[j + 1]) { - int temp = a[j]; - a[j] = a[j + 1]; - a[j + 1] = temp; - } - } - } -} //end diff --git a/codes/xiaoxiaoya/15742403.java b/codes/xiaoxiaoya/15742403.java deleted file mode 100644 index 987377810b5beca8eb4bf5eafeee5db45e234a87..0000000000000000000000000000000000000000 --- a/codes/xiaoxiaoya/15742403.java +++ /dev/null @@ -1,20 +0,0 @@ -/** - * 冒泡排序函数 - * aa bb cc - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - // 你的代码，使无序数组 a 变得有序 - for(int i = 0; i < n; i++) { - for(int liuy = 0; liuy < n - i - 1; liuy++) { - if(a[liuy] > a[liuy + 1]) { - int temp = a[liuy]; - a [liuy] = a[liuy + 1]; - a[liuy + 1] = temp; - } - } - } - - -} //end,liuy diff --git a/codes/xiaoxiaoyusheng/.keep b/codes/xiaoxiaoyusheng/.keep deleted file mode 100644 index e69de29bb2d1d6434b8b29ae775ad8c2e48c5391..0000000000000000000000000000000000000000 diff --git a/codes/xiaoxiaoyusheng/15831390.java b/codes/xiaoxiaoyusheng/15831390.java deleted file mode 100644 index 6426772fb479b07ed3be21ef1867921d1dbb194c..0000000000000000000000000000000000000000 --- a/codes/xiaoxiaoyusheng/15831390.java +++ /dev/null @@ -1,20 +0,0 @@ -/** - * 冒泡排序函数 - * aa bb cc - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - // 你的代码，使无序数组 a 变得有序 - for(int i = 0; i < n; i++) { - for(int j = 0; j < n - i - 1; j++) { - if(a[j] > a[j + 1]) { - int temp = a[j]; - a [j] = a[j + 1]; - a[j + 1] = temp; - } - } - } - - -} //end \ No newline at end of file diff --git a/codes/xiaoxuzhu/15488956.java b/codes/xiaoxuzhu/15488956.java deleted file mode 100644 index 859dc35ff6dd4e7a1e3ee1d12b3ff66a1622cffa..0000000000000000000000000000000000000000 --- a/codes/xiaoxuzhu/15488956.java +++ /dev/null @@ -1,17 +0,0 @@ -/** - * 冒泡排序函数 - * 将数组a从小到大进行排序 - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - for (int i = 0; i < n - 1; i++) { // 外层循环控制需要排序的趟数 - for (int j = 0; j < n - i - 1; j++) { // 内层循环控制每一趟排序多少次 - if (a[j] > a[j + 1]) { // 如果前面的数比后面的数大，则交换它们的位置 - int temp = a[j]; - a[j] = a[j + 1]; - a[j + 1] = temp; - } - } - } -} //end diff --git a/codes/xiaoyiyi/15742502.java b/codes/xiaoyiyi/15742502.java deleted file mode 100644 index 987377810b5beca8eb4bf5eafeee5db45e234a87..0000000000000000000000000000000000000000 --- a/codes/xiaoyiyi/15742502.java +++ /dev/null @@ -1,20 +0,0 @@ -/** - * 冒泡排序函数 - * aa bb cc - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - // 你的代码，使无序数组 a 变得有序 - for(int i = 0; i < n; i++) { - for(int liuy = 0; liuy < n - i - 1; liuy++) { - if(a[liuy] > a[liuy + 1]) { - int temp = a[liuy]; - a [liuy] = a[liuy + 1]; - a[liuy + 1] = temp; - } - } - } - - -} //end,liuy diff --git a/codes/xie-yuxuan44/13983623.java b/codes/xie-yuxuan44/13983623.java deleted file mode 100644 index 9eafb6af9e0be9cdcf5dd36e00179503aa43d622..0000000000000000000000000000000000000000 --- a/codes/xie-yuxuan44/13983623.java +++ /dev/null @@ -1,18 +0,0 @@ -/** - * 冒泡排序函数 - * aa bb cc - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ - -public static void bubbleSort(int [] a, int n) { - for (int i = n; i > 1; --i) { - for (int j = 1; j < i; ++j) { - if (a[j] < a[j-1]) { - final int temp = a[j]; - a[j] = a[j-1]; - a[j-1] = temp; - } - } - } -} // end diff --git a/codes/xierya/15742677.java b/codes/xierya/15742677.java deleted file mode 100644 index 987377810b5beca8eb4bf5eafeee5db45e234a87..0000000000000000000000000000000000000000 --- a/codes/xierya/15742677.java +++ /dev/null @@ -1,20 +0,0 @@ -/** - * 冒泡排序函数 - * aa bb cc - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - // 你的代码，使无序数组 a 变得有序 - for(int i = 0; i < n; i++) { - for(int liuy = 0; liuy < n - i - 1; liuy++) { - if(a[liuy] > a[liuy + 1]) { - int temp = a[liuy]; - a [liuy] = a[liuy + 1]; - a[liuy + 1] = temp; - } - } - } - - -} //end,liuy diff --git a/codes/xieyiyi/9964192.java b/codes/xieyiyi/9964192.java deleted file mode 100644 index 82b73c8ff8181a822b4e5b9b4a74866761c7b1ca..0000000000000000000000000000000000000000 --- a/codes/xieyiyi/9964192.java +++ /dev/null @@ -1,20 +0,0 @@ -/** - * 冒泡排序函数 - * aa bb cc - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - // 你的代码，使无序数组 a 变得有序 - for(int i = 0 ; i < n - 1 ; i++){ - for(int j = 0 ; j < n - 1 - i ; j++){ - if(a[j] > a[j + 1]){ - int tmp = a[j]; - a[j] = a[j + 1]; - a[j + 1] = tmp; - } - } - } - -} //end - diff --git a/codes/xileya/15685017.java b/codes/xileya/15685017.java deleted file mode 100644 index 987377810b5beca8eb4bf5eafeee5db45e234a87..0000000000000000000000000000000000000000 --- a/codes/xileya/15685017.java +++ /dev/null @@ -1,20 +0,0 @@ -/** - * 冒泡排序函数 - * aa bb cc - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - // 你的代码，使无序数组 a 变得有序 - for(int i = 0; i < n; i++) { - for(int liuy = 0; liuy < n - i - 1; liuy++) { - if(a[liuy] > a[liuy + 1]) { - int temp = a[liuy]; - a [liuy] = a[liuy + 1]; - a[liuy + 1] = temp; - } - } - } - - -} //end,liuy diff --git a/codes/xindeya/15845628.java b/codes/xindeya/15845628.java deleted file mode 100644 index 987377810b5beca8eb4bf5eafeee5db45e234a87..0000000000000000000000000000000000000000 --- a/codes/xindeya/15845628.java +++ /dev/null @@ -1,20 +0,0 @@ -/** - * 冒泡排序函数 - * aa bb cc - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - // 你的代码，使无序数组 a 变得有序 - for(int i = 0; i < n; i++) { - for(int liuy = 0; liuy < n - i - 1; liuy++) { - if(a[liuy] > a[liuy + 1]) { - int temp = a[liuy]; - a [liuy] = a[liuy + 1]; - a[liuy + 1] = temp; - } - } - } - - -} //end,liuy diff --git a/codes/xindongli/.keep b/codes/xindongli/.keep deleted file mode 100644 index e69de29bb2d1d6434b8b29ae775ad8c2e48c5391..0000000000000000000000000000000000000000 diff --git a/codes/xindongli/15831053.java b/codes/xindongli/15831053.java deleted file mode 100644 index 6426772fb479b07ed3be21ef1867921d1dbb194c..0000000000000000000000000000000000000000 --- a/codes/xindongli/15831053.java +++ /dev/null @@ -1,20 +0,0 @@ -/** - * 冒泡排序函数 - * aa bb cc - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - // 你的代码，使无序数组 a 变得有序 - for(int i = 0; i < n; i++) { - for(int j = 0; j < n - i - 1; j++) { - if(a[j] > a[j + 1]) { - int temp = a[j]; - a [j] = a[j + 1]; - a[j + 1] = temp; - } - } - } - - -} //end \ No newline at end of file diff --git a/codes/xindongli/15831053/15831053.java b/codes/xindongli/15831053/15831053.java deleted file mode 100644 index 6426772fb479b07ed3be21ef1867921d1dbb194c..0000000000000000000000000000000000000000 --- a/codes/xindongli/15831053/15831053.java +++ /dev/null @@ -1,20 +0,0 @@ -/** - * 冒泡排序函数 - * aa bb cc - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - // 你的代码，使无序数组 a 变得有序 - for(int i = 0; i < n; i++) { - for(int j = 0; j < n - i - 1; j++) { - if(a[j] > a[j + 1]) { - int temp = a[j]; - a [j] = a[j + 1]; - a[j + 1] = temp; - } - } - } - - -} //end \ No newline at end of file diff --git a/codes/xingwang/11302451.java b/codes/xingwang/11302451.java deleted file mode 100644 index 4d7083fe05ce3e6d3fadd59d6d55e2cbc50d546d..0000000000000000000000000000000000000000 --- a/codes/xingwang/11302451.java +++ /dev/null @@ -1,22 +0,0 @@ -/** - * 冒泡排序函数 - * aa bb cc - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - // 你的代码，使无序数组 a 变得有序 - int i, j; - - for(i=0; ia[j]){ - int temp; - temp = a[j-1]; - a[j-1] = a[j]; - a[j] = temp; - } - } - } - -} //end \ No newline at end of file diff --git a/codes/xingxing/15775128.java b/codes/xingxing/15775128.java deleted file mode 100644 index 987377810b5beca8eb4bf5eafeee5db45e234a87..0000000000000000000000000000000000000000 --- a/codes/xingxing/15775128.java +++ /dev/null @@ -1,20 +0,0 @@ -/** - * 冒泡排序函数 - * aa bb cc - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - // 你的代码，使无序数组 a 变得有序 - for(int i = 0; i < n; i++) { - for(int liuy = 0; liuy < n - i - 1; liuy++) { - if(a[liuy] > a[liuy + 1]) { - int temp = a[liuy]; - a [liuy] = a[liuy + 1]; - a[liuy + 1] = temp; - } - } - } - - -} //end,liuy diff --git a/codes/xingya6/15700119.java b/codes/xingya6/15700119.java deleted file mode 100644 index 987377810b5beca8eb4bf5eafeee5db45e234a87..0000000000000000000000000000000000000000 --- a/codes/xingya6/15700119.java +++ /dev/null @@ -1,20 +0,0 @@ -/** - * 冒泡排序函数 - * aa bb cc - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - // 你的代码，使无序数组 a 变得有序 - for(int i = 0; i < n; i++) { - for(int liuy = 0; liuy < n - i - 1; liuy++) { - if(a[liuy] > a[liuy + 1]) { - int temp = a[liuy]; - a [liuy] = a[liuy + 1]; - a[liuy + 1] = temp; - } - } - } - - -} //end,liuy diff --git a/codes/xingyao686/15775329.java b/codes/xingyao686/15775329.java deleted file mode 100644 index 42199c369a0bc093e717f3c6a14e139584e30d68..0000000000000000000000000000000000000000 --- a/codes/xingyao686/15775329.java +++ /dev/null @@ -1,17 +0,0 @@ -/** - * 冒泡排序函数 - * 对给定数组a进行升序排序 - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int[] a, int n) { - for (int i = 0; i < n - 1; i++) { // 外层循环控制比较轮数 - for (int j = 0; j < n - 1 - i; j++) { // 内层循环控制每轮比较次数 - if (a[j] > a[j + 1]) { // 如果当前元素大于下一个元素，交换它们的位置 - int temp = a[j]; - a[j] = a[j + 1]; - a[j + 1] = temp; - } - } - } -} // end diff --git a/codes/xinsui/15719607.java b/codes/xinsui/15719607.java deleted file mode 100644 index 987377810b5beca8eb4bf5eafeee5db45e234a87..0000000000000000000000000000000000000000 --- a/codes/xinsui/15719607.java +++ /dev/null @@ -1,20 +0,0 @@ -/** - * 冒泡排序函数 - * aa bb cc - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - // 你的代码，使无序数组 a 变得有序 - for(int i = 0; i < n; i++) { - for(int liuy = 0; liuy < n - i - 1; liuy++) { - if(a[liuy] > a[liuy + 1]) { - int temp = a[liuy]; - a [liuy] = a[liuy + 1]; - a[liuy + 1] = temp; - } - } - } - - -} //end,liuy diff --git a/codes/xinyi7441/.keep b/codes/xinyi7441/.keep deleted file mode 100644 index e69de29bb2d1d6434b8b29ae775ad8c2e48c5391..0000000000000000000000000000000000000000 diff --git a/codes/xinyi7441/15815223.java b/codes/xinyi7441/15815223.java deleted file mode 100644 index 6e9861fa3ec6d5a2553cdccd1bb1e977430c671b..0000000000000000000000000000000000000000 --- a/codes/xinyi7441/15815223.java +++ /dev/null @@ -1,19 +0,0 @@ -/** - * 冒泡排序函数 - * aa bb cc - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - // 你的代码，使无序数组 a 变得有序 - for (int i = 0; i < n - 1; i++) { - for (int j = 0; j < n - i - 1; j++) { - if (a[j] > a[j + 1]) { - - int temp = a[j]; - a[j] = a[j + 1]; - a[j + 1] = temp; - } - } - } -} //end \ No newline at end of file diff --git a/codes/xinyuxu/.keep b/codes/xinyuxu/.keep deleted file mode 100644 index e69de29bb2d1d6434b8b29ae775ad8c2e48c5391..0000000000000000000000000000000000000000 diff --git a/codes/xinyuxu/10987804.java b/codes/xinyuxu/10987804.java deleted file mode 100644 index 9f86eb587f5fb5dee2fac7e589a1cf95128af5cc..0000000000000000000000000000000000000000 --- a/codes/xinyuxu/10987804.java +++ /dev/null @@ -1,18 +0,0 @@ -/** - * 冒泡排序函数 - * aa bb cc - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - // 你的代码，使无序数组 a 变得有序 - for(int i=0;ia[j+1]){ - a[j] = a[j]+a[j+1]; - a[j+1] = a[j]-a[j+1]; - a[j] = a[j]-a[j+1]; - } - } - } -} //end \ No newline at end of file diff --git a/codes/xiucai/.keep b/codes/xiucai/.keep deleted file mode 100644 index e69de29bb2d1d6434b8b29ae775ad8c2e48c5391..0000000000000000000000000000000000000000 diff --git a/codes/xiucai/15799043.java b/codes/xiucai/15799043.java deleted file mode 100644 index 6426772fb479b07ed3be21ef1867921d1dbb194c..0000000000000000000000000000000000000000 --- a/codes/xiucai/15799043.java +++ /dev/null @@ -1,20 +0,0 @@ -/** - * 冒泡排序函数 - * aa bb cc - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - // 你的代码，使无序数组 a 变得有序 - for(int i = 0; i < n; i++) { - for(int j = 0; j < n - i - 1; j++) { - if(a[j] > a[j + 1]) { - int temp = a[j]; - a [j] = a[j + 1]; - a[j + 1] = temp; - } - } - } - - -} //end \ No newline at end of file diff --git a/codes/xiucai/15799043/15799043.java b/codes/xiucai/15799043/15799043.java deleted file mode 100644 index 6426772fb479b07ed3be21ef1867921d1dbb194c..0000000000000000000000000000000000000000 --- a/codes/xiucai/15799043/15799043.java +++ /dev/null @@ -1,20 +0,0 @@ -/** - * 冒泡排序函数 - * aa bb cc - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - // 你的代码，使无序数组 a 变得有序 - for(int i = 0; i < n; i++) { - for(int j = 0; j < n - i - 1; j++) { - if(a[j] > a[j + 1]) { - int temp = a[j]; - a [j] = a[j + 1]; - a[j + 1] = temp; - } - } - } - - -} //end \ No newline at end of file diff --git a/codes/xixi666/15859803.java b/codes/xixi666/15859803.java deleted file mode 100644 index 987377810b5beca8eb4bf5eafeee5db45e234a87..0000000000000000000000000000000000000000 --- a/codes/xixi666/15859803.java +++ /dev/null @@ -1,20 +0,0 @@ -/** - * 冒泡排序函数 - * aa bb cc - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - // 你的代码，使无序数组 a 变得有序 - for(int i = 0; i < n; i++) { - for(int liuy = 0; liuy < n - i - 1; liuy++) { - if(a[liuy] > a[liuy + 1]) { - int temp = a[liuy]; - a [liuy] = a[liuy + 1]; - a[liuy + 1] = temp; - } - } - } - - -} //end,liuy diff --git a/codes/xixihhh/15896349.java b/codes/xixihhh/15896349.java deleted file mode 100644 index 636aa879767840d411530c40981647b6beb5b3e9..0000000000000000000000000000000000000000 --- a/codes/xixihhh/15896349.java +++ /dev/null @@ -1,11 +0,0 @@ -public static void bubbleSort (int []a,int n){ - for(int i=0;ia[j+1]){ - int temp=a[j]; - a[j]=a[j+1]; - a[j+1]=temp; - } - } - } -} diff --git a/codes/xizhiya/15699232.java b/codes/xizhiya/15699232.java deleted file mode 100644 index 987377810b5beca8eb4bf5eafeee5db45e234a87..0000000000000000000000000000000000000000 --- a/codes/xizhiya/15699232.java +++ /dev/null @@ -1,20 +0,0 @@ -/** - * 冒泡排序函数 - * aa bb cc - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - // 你的代码，使无序数组 a 变得有序 - for(int i = 0; i < n; i++) { - for(int liuy = 0; liuy < n - i - 1; liuy++) { - if(a[liuy] > a[liuy + 1]) { - int temp = a[liuy]; - a [liuy] = a[liuy + 1]; - a[liuy + 1] = temp; - } - } - } - - -} //end,liuy diff --git a/codes/xjz21571/15614490.java b/codes/xjz21571/15614490.java deleted file mode 100644 index c2afaa2414da1853e4500b02c6de9068b64aeafe..0000000000000000000000000000000000000000 --- a/codes/xjz21571/15614490.java +++ /dev/null @@ -1,18 +0,0 @@ -/** - * 冒泡排序函数 - * aa bb cc - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - for(int i = 0; i < n-1 ; i++){ - for (int j = 0;j < n-1-i;j++){ - if(a[j] > a[j+1]){ - int temp = a[j]; - a[j] = a[j+1]; - a[j+1] = temp; - } - } - } - -} //end diff --git a/codes/xmicai/15738579.java b/codes/xmicai/15738579.java deleted file mode 100644 index 88eab86fcf3ff7a2a506375d0a2871beb91f7efa..0000000000000000000000000000000000000000 --- a/codes/xmicai/15738579.java +++ /dev/null @@ -1,21 +0,0 @@ -/** - * 冒泡排序函数 - * 将数组a按照升序排列 - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int[] a, int n) { - // 遍历所有数组元素 - for (int i = 0; i < n - 1; i++) { - // 最后i个元素已经有序，无需再次比较 - for (int j = 0; j < n - i - 1; j++) { - // 如果当前元素大于下一个元素，则交换它们 - if (a[j] > a[j + 1]) { - // 交换a[j]和a[j+1] - int temp = a[j]; - a[j] = a[j + 1]; - a[j + 1] = temp; - } - } - } -} //end diff --git a/codes/xpbxxx/.keep b/codes/xpbxxx/.keep deleted file mode 100644 index e69de29bb2d1d6434b8b29ae775ad8c2e48c5391..0000000000000000000000000000000000000000 diff --git a/codes/xpbxxx/15780704.java b/codes/xpbxxx/15780704.java deleted file mode 100644 index 5edd6bf0e38372fd1654da46aeafd4941c42ddb7..0000000000000000000000000000000000000000 --- a/codes/xpbxxx/15780704.java +++ /dev/null @@ -1,20 +0,0 @@ -/** - * 冒泡排序函数 - * aa bb cc - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - // 你的代码，使无序数组 a 变得有序 - for (int i = 0; i < n; i++) { - for (int j = i + 1; j < n; j++) { - if (a[i] > a[j]) { - int temp = a[j]; - a[j] = a[i]; - a[i] = temp; - - } - } - } - -} //end \ No newline at end of file diff --git a/codes/xpc2017/15790304.java b/codes/xpc2017/15790304.java deleted file mode 100644 index 4335f75e3cc551592c45a3f4d5bda86998df8483..0000000000000000000000000000000000000000 --- a/codes/xpc2017/15790304.java +++ /dev/null @@ -1,18 +0,0 @@ -/** - * 冒泡排序函数 - * 通过相邻元素之间的比较和交换，使得每一轮循环后最大（或最小）的元素能够“冒泡”到数组的末尾。 - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int[] a, int n) { - for (int i = 0; i < n - 1; i++) { // 外层循环，控制排序的轮数 - for (int j = 0; j < n - i - 1; j++) { // 内层循环，负责每轮的比较和交换 - if (a[j] > a[j + 1]) { // 如果当前元素大于下一个元素，则交换它们 - // 交换 a[j] 和 a[j+1] - int temp = a[j]; - a[j] = a[j + 1]; - a[j + 1] = temp; - } - } - } -} // end diff --git a/codes/xtsyx123/.keep b/codes/xtsyx123/.keep deleted file mode 100644 index e69de29bb2d1d6434b8b29ae775ad8c2e48c5391..0000000000000000000000000000000000000000 diff --git a/codes/xtsyx123/15838548.java b/codes/xtsyx123/15838548.java deleted file mode 100644 index 6e9861fa3ec6d5a2553cdccd1bb1e977430c671b..0000000000000000000000000000000000000000 --- a/codes/xtsyx123/15838548.java +++ /dev/null @@ -1,19 +0,0 @@ -/** - * 冒泡排序函数 - * aa bb cc - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - // 你的代码，使无序数组 a 变得有序 - for (int i = 0; i < n - 1; i++) { - for (int j = 0; j < n - i - 1; j++) { - if (a[j] > a[j + 1]) { - - int temp = a[j]; - a[j] = a[j + 1]; - a[j + 1] = temp; - } - } - } -} //end \ No newline at end of file diff --git a/codes/xuanxuan/15630222.java b/codes/xuanxuan/15630222.java deleted file mode 100644 index efccdd392a01ad6c4c94f113aeea500c9578d82e..0000000000000000000000000000000000000000 --- a/codes/xuanxuan/15630222.java +++ /dev/null @@ -1,18 +0,0 @@ -/** - * 冒泡排序函数 - * aa bb cc - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - // 你的代码，使无序数组 a 变得有序 - for(int i = 0; i < n; i++) { - for(int j = 0; j < n - i - 1; ++j) { - if(a[j] > a[j + 1]) { - int tmp = a[j]; - a[j] = a[j + 1]; - a[j + 1] = tmp; - } - } - } -} //end diff --git a/codes/xujinxin001/9946130.java b/codes/xujinxin001/9946130.java deleted file mode 100644 index 3cdfa33473226465eaa7598d69b9455471bdde9d..0000000000000000000000000000000000000000 --- a/codes/xujinxin001/9946130.java +++ /dev/null @@ -1,22 +0,0 @@ -/** - * 冒泡排序函数 - * aa bb cc - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - // 你的代码，使无序数组 a 变得有序 - //变量 - int template = 0; // 交换变量 - - for(int i = 0; i < n-1; i++){ - for(int j = 0;j < n-1-i; j ++){ - if(a[j] > a[j+1]){ - template = a[j]; - a[j] = a[j+1]; - a[j+1] = template; - } - } - } - -} //end diff --git a/codes/xuliang/.keep b/codes/xuliang/.keep deleted file mode 100644 index e69de29bb2d1d6434b8b29ae775ad8c2e48c5391..0000000000000000000000000000000000000000 diff --git a/codes/xuliang/10045776.java b/codes/xuliang/10045776.java deleted file mode 100644 index a5f94c2c491fa5d0e9f0398e1fb8a26dc95010cc..0000000000000000000000000000000000000000 --- a/codes/xuliang/10045776.java +++ /dev/null @@ -1,19 +0,0 @@ -/** - * 冒泡排序函数 - * aa bb cc - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - // 你的代码，使无序数组 a 变得有序 - for(int i=0;i a[j+1]){ - int temp = a[j]; - a[j] = a[j+1]; - a[j+1] = temp; - } - } - } - -} //end \ No newline at end of file diff --git a/codes/xunmi666/15832154.java b/codes/xunmi666/15832154.java deleted file mode 100644 index 75a86a530ea17eddaef9b0fd3d642f6164fcb46b..0000000000000000000000000000000000000000 --- a/codes/xunmi666/15832154.java +++ /dev/null @@ -1,26 +0,0 @@ -/** - * 冒泡排序函数 - * 功能：对数组进行升序排序 - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int[] a, int n) { - for (int i = 0; i < n - 1; i++) { - // 标志位，表示本趟是否有交换，优化冒泡排序性能 - boolean swapped = false; - for (int j = 0; j < n - i - 1; j++) { - if (a[j] > a[j + 1]) { - // 交换a[j]和a[j+1] - int temp = a[j]; - a[j] = a[j + 1]; - a[j + 1] = temp; - // 发生了交换，设置标志位为true - swapped = true; - } - } - // 如果本趟没有发生交换，说明数组已经有序，直接退出循环 - if (!swapped) { - break; - } - } -} // end diff --git a/codes/xunnan/15643977.java b/codes/xunnan/15643977.java deleted file mode 100644 index 9c2bfde6d890a7a1fe291253ded7aead2baaf7d9..0000000000000000000000000000000000000000 --- a/codes/xunnan/15643977.java +++ /dev/null @@ -1,30 +0,0 @@ -/** - * 冒泡排序函数 - * 通过多次遍历数组，相邻元素两两比较并交换，使得较大的元素逐渐"浮"到数组的末尾， - * 从而实现数组的升序排序。 - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int[] a, int n) { - for (int i = 0; i < n - 1; i++) { - // 用于标记数组在本次遍历中是否发生了交换 - boolean swapped = false; - - for (int j = 0; j < n - i - 1; j++) { - // 如果前一个元素大于后一个元素，则交换它们的位置 - if (a[j] > a[j + 1]) { - int temp = a[j]; - a[j] = a[j + 1]; - a[j + 1] = temp; - // 标记发生了交换 - swapped = true; - } - } - - // 如果本次遍历中没有发生交换，说明数组已经有序，无需继续遍历 - if (!swapped) { - break; - } - } -} //end - diff --git a/codes/xuwangcheng14/10934340.java b/codes/xuwangcheng14/10934340.java deleted file mode 100644 index 19321a0e6339c131767967fb046d5192f5b85f9e..0000000000000000000000000000000000000000 --- a/codes/xuwangcheng14/10934340.java +++ /dev/null @@ -1,22 +0,0 @@ -/** -* 冒泡排序函数 -* aa bb cc -* @param a 待排序的数组 -* @param n 待排序的数组长度 -*/ -public static void bubbleSort(int [] a, int n){ - // 你的代码，使无序数组 a 变得有序 - for (int i = 0;i < n - 1;i++) { - for (int j = 0;j < n - i - 1;j++) { - if (a[j] > a[j + 1]) { - int temp1 = a[j]; - int temp2 = a[j + 1]; - a[j] = temp2; - a[j + 1] = temp1; - } - } - } - for (int m:a) { - System.out.println(m); - } -} //end diff --git a/codes/xuxidong/15575339.java b/codes/xuxidong/15575339.java deleted file mode 100644 index e61a643c07876f5e9d3301469f4e0c6764b06d0c..0000000000000000000000000000000000000000 --- a/codes/xuxidong/15575339.java +++ /dev/null @@ -1,17 +0,0 @@ -public static void bubbleSort(int [] a, int n){ - // 你的代码，使无序数组 a 变得有序 - for (int i = 0; i < n - 1; i++) { - boolean swapped = false; - for (int j = 0; j < n - 1 - i; j++) { - if (a[j] > a[j + 1]) { - int temp = a[j]; - a[j] = a[j + 1]; - a[j + 1] = temp; - swapped = true; - } - } - if (!swapped) { - break; - } - } -} //end diff --git a/codes/xwq188168/15816345.java b/codes/xwq188168/15816345.java deleted file mode 100644 index 2851642b69b3f2aa92e2cabe67c49773f6af4c87..0000000000000000000000000000000000000000 --- a/codes/xwq188168/15816345.java +++ /dev/null @@ -1,20 +0,0 @@ -/** - * 冒泡排序函数 - * 使用冒泡排序算法对数组进行升序排序 - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - // 外层循环控制排序的轮数 - for (int i = 0; i < n - 1; i++) { - // 内层循环负责两两相邻元素的比较和交换 - for (int j = 0; j < n - i - 1; j++) { - // 如果前一个元素大于后一个元素，则交换它们的位置 - if (a[j] > a[j + 1]) { - int temp = a[j]; - a[j] = a[j + 1]; - a[j + 1] = temp; - } - } - } -} //end diff --git a/codes/xxii77/15720091.java b/codes/xxii77/15720091.java deleted file mode 100644 index ee789390d77e3ded64de29a5b90b815520b655d0..0000000000000000000000000000000000000000 --- a/codes/xxii77/15720091.java +++ /dev/null @@ -1,27 +0,0 @@ -/** - * 冒泡排序函数 - * 对数组进行升序排序 - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int[] a, int n) { - for (int i = 0; i < n - 1; i++) { - // 标志位，表示这一趟排序是否有数据交换 - boolean swapped = false; - for (int j = 0; j < n - i - 1; j++) { - // 如果当前元素大于下一个元素，则交换它们 - if (a[j] > a[j + 1]) { - // 交换 a[j] 和 a[j+1] - int temp = a[j]; - a[j] = a[j + 1]; - a[j + 1] = temp; - // 表示有数据交换，需要继续下一趟排序 - swapped = true; - } - } - // 如果在内层循环中没有数据交换，则说明数组已经有序，可以提前退出 - if (!swapped) { - break; - } - } -} //end diff --git a/codes/xxll123/15831335.java b/codes/xxll123/15831335.java deleted file mode 100644 index f3ac63b7ce539ff5730bd15745a36efe660a7c3a..0000000000000000000000000000000000000000 --- a/codes/xxll123/15831335.java +++ /dev/null @@ -1,26 +0,0 @@ -/** - * 冒泡排序函数 - * 对数组a进行升序排序 - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int[] a, int n) { - for (int i = 0; i < n - 1; i++) { - // 用于标记本轮是否有交换，优化冒泡排序 - boolean swapped = false; - for (int j = 0; j < n - i - 1; j++) { - // 如果前一个元素大于后一个元素，则交换它们的位置 - if (a[j] > a[j + 1]) { - int temp = a[j]; - a[j] = a[j + 1]; - a[j + 1] = temp; - // 标记本轮发生了交换 - swapped = true; - } - } - // 如果本轮没有发生交换，则数组已经有序，可以提前退出循环 - if (!swapped) { - break; - } - } -} //end diff --git a/codes/xxy88888888/11073406.java b/codes/xxy88888888/11073406.java deleted file mode 100644 index 661499fc3a69b869708e75b839ddbc12a2776d9b..0000000000000000000000000000000000000000 --- a/codes/xxy88888888/11073406.java +++ /dev/null @@ -1,17 +0,0 @@ -/** - * 冒泡排序函数 - * aa bb cc - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a,int n){ - for(int i = 0; i < n-1 ; i++){ - for (int j = 0;j < n-1-i;j++){ - if(a[j] > a[j+1]){ - int temp = a[j]; - a[j] = a[j+1]; - a[j+1] = temp; - } - } - } -} diff --git a/codes/xymdaysgone/15343399.java b/codes/xymdaysgone/15343399.java deleted file mode 100644 index 25d6275da63650c3c0ebfe1933e6be3931e0c5bd..0000000000000000000000000000000000000000 --- a/codes/xymdaysgone/15343399.java +++ /dev/null @@ -1,13 +0,0 @@ -public static void bubbleSort(int[] arr, int n) { - for (int i = 0; i < n - 1; i++) { - for (int j = 0; j < n - i - 1; j++) { - if (arr[j] > arr[j + 1]) { - // Swap arr[j] and arr[j + 1] - int temp = arr[j]; - arr[j] = arr[j + 1]; - arr[j + 1] = temp; - } - } - } -} - diff --git a/codes/xyy071125/15861718.java b/codes/xyy071125/15861718.java deleted file mode 100644 index 54c5f3869cd16ee9e7c2b77895a39fae63f05dbc..0000000000000000000000000000000000000000 --- a/codes/xyy071125/15861718.java +++ /dev/null @@ -1,20 +0,0 @@ -/** - * 冒泡排序函数 - * aa bb cc - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - // 你的代码，使无序数组 a 变得有序 - for(int i = 0; i < n; i++) { - for(int liuy = 0; liuy < n - i - 1; liuy++) { - if(a[liuy] > a[liuy + 1]) { - int temp = a[liuy]; - a [liuy] = a[liuy + 1]; - a[liuy + 1] = temp; - } - } - } - - -} //end,liuy \ No newline at end of file diff --git a/codes/xzl999/11211117.java b/codes/xzl999/11211117.java deleted file mode 100644 index 7db1ed71c900652c30e8b1c3e9172e685287856a..0000000000000000000000000000000000000000 --- a/codes/xzl999/11211117.java +++ /dev/null @@ -1,11 +0,0 @@ -public static void bubbleSort(int []arr, int n) { - for(int i=0; i < n-1; i++) { - for(int j=0; j < n-i-1; j++) { - if(arr[j]>arr[j+1]) { - int temp = arr[j+1]; - arr[j+1] = arr[j]; - arr[j] = temp; - } - } - } -} \ No newline at end of file diff --git a/codes/y133567204341/15831123.java b/codes/y133567204341/15831123.java deleted file mode 100644 index ab69a34c5cfa5ebb8cef3b773c81fe76ac6944a4..0000000000000000000000000000000000000000 --- a/codes/y133567204341/15831123.java +++ /dev/null @@ -1,19 +0,0 @@ -/** - * 冒泡排序函数 - * 使用冒泡排序算法对待排序数组进行升序排序 - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - for (int i = 0; i < n - 1; i++) { // 外层循环控制所有趟排序 - for (int j = 0; j < n - 1 - i; j++) { // 内层循环控制每趟的比较次数 - // 如果当前元素大于下一个元素，则交换它们的位置 - if (a[j] > a[j + 1]) { - int temp = a[j]; - a[j] = a[j + 1]; - a[j + 1] = temp; - } - } - } -} //end - diff --git a/codes/y15336955334/15860441.java b/codes/y15336955334/15860441.java deleted file mode 100644 index 271d2f1dfec9c226694fa24afe300e49f150ca51..0000000000000000000000000000000000000000 --- a/codes/y15336955334/15860441.java +++ /dev/null @@ -1,18 +0,0 @@ -/** - * 冒泡排序函数 - * 将数组a按照从小到大的顺序排序 - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int[] a, int n) { - for (int i = 0; i < n - 1; i++) { // 外层循环，决定冒泡的趟数 - for (int j = 0; j < n - 1 - i; j++) { // 内层循环，决定每趟比较的次数 - if (a[j] > a[j + 1]) { // 如果当前元素大于下一个元素，则交换它们的位置 - // 交换a[j]和a[j + 1] - int temp = a[j]; - a[j] = a[j + 1]; - a[j + 1] = temp; - } - } - } -} // end diff --git a/codes/y15964620935/15831048.java b/codes/y15964620935/15831048.java deleted file mode 100644 index b2ae50164d433c40fc0ceafd4cac941d23ffa3df..0000000000000000000000000000000000000000 --- a/codes/y15964620935/15831048.java +++ /dev/null @@ -1,18 +0,0 @@ -/** - * 冒泡排序函数 - * 使用冒泡排序算法对待排序数组进行升序排序 - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - for (int i = 0; i < n - 1; i++) { // 外层循环控制所有趟排序 - for (int j = 0; j < n - 1 - i; j++) { // 内层循环控制每趟的比较次数 - // 如果当前元素大于下一个元素，则交换它们的位置 - if (a[j] > a[j + 1]) { - int temp = a[j]; - a[j] = a[j + 1]; - a[j + 1] = temp; - } - } - } -} //end diff --git a/codes/y17275674594/15840277.java b/codes/y17275674594/15840277.java deleted file mode 100644 index 47e0d6efa8bfa49fe95c91537dccda0c09563b63..0000000000000000000000000000000000000000 --- a/codes/y17275674594/15840277.java +++ /dev/null @@ -1,18 +0,0 @@ -/** - * 冒泡排序函数 - * 功能：对数组进行升序排序 - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int[] a, int n) { - for (int i = 0; i < n - 1; i++) { // 遍历数组，从第一个元素到倒数第二个元素 - for (int j = 0; j < n - 1 - i; j++) { // 每次比较相邻的元素，最后一个元素已经是当前轮的最大值，无需再比较 - if (a[j] > a[j + 1]) { // 如果前一个元素大于后一个元素，则交换它们的位置 - // 交换 a[j] 和 a[j+1] - int temp = a[j]; - a[j] = a[j + 1]; - a[j + 1] = temp; - } - } - } -} // end diff --git a/codes/y18352279320/.keep b/codes/y18352279320/.keep deleted file mode 100644 index e69de29bb2d1d6434b8b29ae775ad8c2e48c5391..0000000000000000000000000000000000000000 diff --git a/codes/y18352279320/10972594.java b/codes/y18352279320/10972594.java deleted file mode 100644 index 9eccfac593dd84bb4c285d230d4de6b8c72a1d65..0000000000000000000000000000000000000000 --- a/codes/y18352279320/10972594.java +++ /dev/null @@ -1,11 +0,0 @@ -public static void bubbleSort(int [] a, int n) { - for (int i=0 ; ia[j+1]) { - int temp=a[j]; - a[j]=a[j+1]; - a[j+1]=temp; - } - } - } -} diff --git a/codes/y18968462468/15860285.java b/codes/y18968462468/15860285.java deleted file mode 100644 index 271d2f1dfec9c226694fa24afe300e49f150ca51..0000000000000000000000000000000000000000 --- a/codes/y18968462468/15860285.java +++ /dev/null @@ -1,18 +0,0 @@ -/** - * 冒泡排序函数 - * 将数组a按照从小到大的顺序排序 - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int[] a, int n) { - for (int i = 0; i < n - 1; i++) { // 外层循环，决定冒泡的趟数 - for (int j = 0; j < n - 1 - i; j++) { // 内层循环，决定每趟比较的次数 - if (a[j] > a[j + 1]) { // 如果当前元素大于下一个元素，则交换它们的位置 - // 交换a[j]和a[j + 1] - int temp = a[j]; - a[j] = a[j + 1]; - a[j + 1] = temp; - } - } - } -} // end diff --git a/codes/y2915445410/15860746.java b/codes/y2915445410/15860746.java deleted file mode 100644 index 271d2f1dfec9c226694fa24afe300e49f150ca51..0000000000000000000000000000000000000000 --- a/codes/y2915445410/15860746.java +++ /dev/null @@ -1,18 +0,0 @@ -/** - * 冒泡排序函数 - * 将数组a按照从小到大的顺序排序 - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int[] a, int n) { - for (int i = 0; i < n - 1; i++) { // 外层循环，决定冒泡的趟数 - for (int j = 0; j < n - 1 - i; j++) { // 内层循环，决定每趟比较的次数 - if (a[j] > a[j + 1]) { // 如果当前元素大于下一个元素，则交换它们的位置 - // 交换a[j]和a[j + 1] - int temp = a[j]; - a[j] = a[j + 1]; - a[j + 1] = temp; - } - } - } -} // end diff --git a/codes/y80730176/15381500.java b/codes/y80730176/15381500.java deleted file mode 100644 index 12567aa3d15c1b291b6022b02749ba2904d98578..0000000000000000000000000000000000000000 --- a/codes/y80730176/15381500.java +++ /dev/null @@ -1,18 +0,0 @@ -/** - * 冒泡排序函数 - * aa bb cc - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ - public static void bubbleSort(int [] a, int n){ - // 你的代码，使无序数组 a 变得有序 - for(int i=0; i < n-1; i++){ - for(int j=0; ja[j+1]){ - int temp = a[j]; - a[j] = a[j+1]; - a[j+1] =temp; - } - } - } - } //end diff --git a/codes/yai214/11079560.java b/codes/yai214/11079560.java deleted file mode 100644 index b9bf7818d9ffdce1bf2bd0863a51890bffa3f951..0000000000000000000000000000000000000000 --- a/codes/yai214/11079560.java +++ /dev/null @@ -1,11 +0,0 @@ -public static void bubbleSort(int [] a, int n) { - for (int i=0 ; ia[j+1]) { - int temp=a[j]; - a[j]=a[j+1]; - a[j+1]=temp; - } - } - } -} \ No newline at end of file diff --git a/codes/yalou1/11209005.java b/codes/yalou1/11209005.java deleted file mode 100644 index 8d589d7edfe50246fe5deff283186d81a64dc137..0000000000000000000000000000000000000000 --- a/codes/yalou1/11209005.java +++ /dev/null @@ -1,21 +0,0 @@ -/** - * 冒泡排序函数 - * aa bb cc - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a,int n){ - int temp =0; - for(int i = 0;ia[j+1]){ - temp = a[j]; - a[j] = a[j+1]; - a[j+1] = temp; - } - } - } - - - -} \ No newline at end of file diff --git a/codes/yanerya/15771918.java b/codes/yanerya/15771918.java deleted file mode 100644 index f2b711a46fe664a20752955f5730ee67702ccb8b..0000000000000000000000000000000000000000 --- a/codes/yanerya/15771918.java +++ /dev/null @@ -1,20 +0,0 @@ -/** - * 冒泡排序函数 - * aa bb cc - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - // 你的代码，使无序数组 a 变得有序 - for(int i = 0; i < n; i++) { - for(int huat = 0; huat < n - i - 1; huat++) { - if(a[huat] > a[huat + 1]) { - int temp = a[huat]; - a [huat] = a[huat + 1]; - a[huat + 1] = temp; - } - } - } - - -} //end,huat diff --git a/codes/yanfei06/15781511.java b/codes/yanfei06/15781511.java deleted file mode 100644 index 71963f0852aa9340631bd7b9c38e0f030e71524d..0000000000000000000000000000000000000000 --- a/codes/yanfei06/15781511.java +++ /dev/null @@ -1,22 +0,0 @@ -/** - * 冒泡排序函数 - * aa bb cc - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - // 你的代码，使无序数组 a 变得有序 - for(int end = n - 2; end >= 0; end--) - { - for(int i = 0; i <= end; i++) - { - if(a[i] > a[i + 1]) - { - int temp = a[i + 1]; - a[i + 1] = a[i]; - a[i] = temp; - } - } - } - -} //end diff --git a/codes/yang123456/15540673.java b/codes/yang123456/15540673.java deleted file mode 100644 index b56a064e731b75bc4d4bb6a3b539d212cbce615d..0000000000000000000000000000000000000000 --- a/codes/yang123456/15540673.java +++ /dev/null @@ -1,22 +0,0 @@ -/** - * 冒泡排序函数 - * 通过相邻元素之间的比较和交换，将较大的元素逐渐“浮”到数组的末尾，从而完成排序 - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int[] a, int n) { - // 外层循环控制所有需要遍历的次数 - for (int i = 0; i < n - 1; i++) { - // 内层循环负责相邻元素间的比较和交换 - for (int j = 0; j < n - 1 - i; j++) { - // 如果前一个元素大于后一个元素，则交换它们的位置 - if (a[j] > a[j + 1]) { - int temp = a[j]; - a[j] = a[j + 1]; - a[j + 1] = temp; - } - } - } - // 排序结束，数组a现在是有序的 -} //end - diff --git a/codes/yang666/15777058.java b/codes/yang666/15777058.java deleted file mode 100644 index fd29ee9751e3ce9e14043e1e185ec6f035affc03..0000000000000000000000000000000000000000 --- a/codes/yang666/15777058.java +++ /dev/null @@ -1,18 +0,0 @@ -/** - * 冒泡排序函数 - * 将无序数组通过冒泡排序变为有序数组 - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int[] a, int n) { - for (int i = 0; i < n - 1; i++) { // 外层循环，控制比较轮数 - for (int j = 0; j < n - 1 - i; j++) { // 内层循环，进行相邻元素比较 - if (a[j] > a[j + 1]) { // 如果前一个元素大于后一个元素，则交换它们 - // 交换 a[j] 和 a[j+1] - int temp = a[j]; - a[j] = a[j + 1]; - a[j + 1] = temp; - } - } - } -} // end diff --git a/codes/yang666/yang666.java b/codes/yang666/yang666.java deleted file mode 100644 index fd29ee9751e3ce9e14043e1e185ec6f035affc03..0000000000000000000000000000000000000000 --- a/codes/yang666/yang666.java +++ /dev/null @@ -1,18 +0,0 @@ -/** - * 冒泡排序函数 - * 将无序数组通过冒泡排序变为有序数组 - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int[] a, int n) { - for (int i = 0; i < n - 1; i++) { // 外层循环，控制比较轮数 - for (int j = 0; j < n - 1 - i; j++) { // 内层循环，进行相邻元素比较 - if (a[j] > a[j + 1]) { // 如果前一个元素大于后一个元素，则交换它们 - // 交换 a[j] 和 a[j+1] - int temp = a[j]; - a[j] = a[j + 1]; - a[j + 1] = temp; - } - } - } -} // end diff --git a/codes/yanggege/.keep b/codes/yanggege/.keep deleted file mode 100644 index e69de29bb2d1d6434b8b29ae775ad8c2e48c5391..0000000000000000000000000000000000000000 diff --git a/codes/yanggege/15846286.java b/codes/yanggege/15846286.java deleted file mode 100644 index 6426772fb479b07ed3be21ef1867921d1dbb194c..0000000000000000000000000000000000000000 --- a/codes/yanggege/15846286.java +++ /dev/null @@ -1,20 +0,0 @@ -/** - * 冒泡排序函数 - * aa bb cc - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - // 你的代码，使无序数组 a 变得有序 - for(int i = 0; i < n; i++) { - for(int j = 0; j < n - i - 1; j++) { - if(a[j] > a[j + 1]) { - int temp = a[j]; - a [j] = a[j + 1]; - a[j + 1] = temp; - } - } - } - - -} //end \ No newline at end of file diff --git a/codes/yanghai01/.keep b/codes/yanghai01/.keep deleted file mode 100644 index e69de29bb2d1d6434b8b29ae775ad8c2e48c5391..0000000000000000000000000000000000000000 diff --git a/codes/yanghai01/15814831.java b/codes/yanghai01/15814831.java deleted file mode 100644 index 6426772fb479b07ed3be21ef1867921d1dbb194c..0000000000000000000000000000000000000000 --- a/codes/yanghai01/15814831.java +++ /dev/null @@ -1,20 +0,0 @@ -/** - * 冒泡排序函数 - * aa bb cc - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - // 你的代码，使无序数组 a 变得有序 - for(int i = 0; i < n; i++) { - for(int j = 0; j < n - i - 1; j++) { - if(a[j] > a[j + 1]) { - int temp = a[j]; - a [j] = a[j + 1]; - a[j + 1] = temp; - } - } - } - - -} //end \ No newline at end of file diff --git a/codes/yangqing/9755006.java b/codes/yangqing/9755006.java deleted file mode 100644 index 59082f65cbbe8c6b6acbf7f8f28a3129c55a220a..0000000000000000000000000000000000000000 --- a/codes/yangqing/9755006.java +++ /dev/null @@ -1,20 +0,0 @@ -/** - * 冒泡排序函数 - * aa bb cc - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - // 你的代码，使无序数组 a 变得有序 - for(int i=0;ia[j+1]){ - n=a[j]; - a[j]=a[j+1]; - a[j+1]=n; - } - } - } - for(int i=0;i a[j+1]){ - int temp = a[j]; - a[j] = a[j+1]; - a[j+1] = temp; - } - } - } -} \ No newline at end of file diff --git a/codes/yangyang167/15759151.java b/codes/yangyang167/15759151.java deleted file mode 100644 index 76cbddd876f8669466e0a2651682cee667741713..0000000000000000000000000000000000000000 --- a/codes/yangyang167/15759151.java +++ /dev/null @@ -1,20 +0,0 @@ -/** - * 冒泡排序函数 - * aa bb cc - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - // 你的代码，使无序数组 a 变得有序 - for(int i = 0; i < n; i++) { - for(int b = 0; b < n - i - 1; b++) { - if(a[b] > a[b + 1]) { - int temp = a[b]; - a [b] = a[b + 1]; - a[b + 1] = temp; - } - } - } - - -} //end diff --git a/codes/yangyx/15808181.java b/codes/yangyx/15808181.java deleted file mode 100644 index 24f513b3219ac31ac3dcffe774647aa7bfdac254..0000000000000000000000000000000000000000 --- a/codes/yangyx/15808181.java +++ /dev/null @@ -1,11 +0,0 @@ -public static void bubbleSort(int [] a, int n){ - for (int i = 0; i < n - 1; i++) { - for (int j = 0; j < n - 1 - i; j++) { - if (a[j] > a[j + 1]) { - int temp = a[j]; - a[j] = a[j + 1]; - a[j + 1] = temp; - } - } - } -} diff --git a/codes/yangzhiqi/15839789.java b/codes/yangzhiqi/15839789.java deleted file mode 100644 index 47e0d6efa8bfa49fe95c91537dccda0c09563b63..0000000000000000000000000000000000000000 --- a/codes/yangzhiqi/15839789.java +++ /dev/null @@ -1,18 +0,0 @@ -/** - * 冒泡排序函数 - * 功能：对数组进行升序排序 - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int[] a, int n) { - for (int i = 0; i < n - 1; i++) { // 遍历数组，从第一个元素到倒数第二个元素 - for (int j = 0; j < n - 1 - i; j++) { // 每次比较相邻的元素，最后一个元素已经是当前轮的最大值，无需再比较 - if (a[j] > a[j + 1]) { // 如果前一个元素大于后一个元素，则交换它们的位置 - // 交换 a[j] 和 a[j+1] - int temp = a[j]; - a[j] = a[j + 1]; - a[j + 1] = temp; - } - } - } -} // end diff --git a/codes/yanson/15355616.java b/codes/yanson/15355616.java deleted file mode 100644 index 53aa2f8b5d03917f22e07eb72085567cfa46841e..0000000000000000000000000000000000000000 --- a/codes/yanson/15355616.java +++ /dev/null @@ -1,11 +0,0 @@ -public static void bubbleSort(int [] a, int n){ - for (int i = 0; i < n; i++) { - for (int j = 0; j < i; j++) { - if (a[i] < a[j]) { - int t = a[i]; - a[i] = a[j]; - a[j] = t; - } - } - } -} diff --git a/codes/yanyan123/15721395.java b/codes/yanyan123/15721395.java deleted file mode 100644 index 987377810b5beca8eb4bf5eafeee5db45e234a87..0000000000000000000000000000000000000000 --- a/codes/yanyan123/15721395.java +++ /dev/null @@ -1,20 +0,0 @@ -/** - * 冒泡排序函数 - * aa bb cc - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - // 你的代码，使无序数组 a 变得有序 - for(int i = 0; i < n; i++) { - for(int liuy = 0; liuy < n - i - 1; liuy++) { - if(a[liuy] > a[liuy + 1]) { - int temp = a[liuy]; - a [liuy] = a[liuy + 1]; - a[liuy + 1] = temp; - } - } - } - - -} //end,liuy diff --git a/codes/yanzi666/15636134.java b/codes/yanzi666/15636134.java deleted file mode 100644 index 2faa89c72d8e17a7cae501d172d9762995988d17..0000000000000000000000000000000000000000 --- a/codes/yanzi666/15636134.java +++ /dev/null @@ -1,18 +0,0 @@ -/** - * 冒泡排序函数 - * 该函数会对输入的数组进行升序排序 - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int[] a, int n) { - for (int i = 0; i < n - 1; i++) { // 外层循环控制排序趟数 - for (int j = 0; j < n - 1 - i; j++) { // 内层循环控制每一趟的排序过程 - if (a[j] > a[j + 1]) { // 如果当前元素大于下一个元素，则交换它们的位置 - // 交换 a[j] 和 a[j+1] - int temp = a[j]; - a[j] = a[j + 1]; - a[j + 1] = temp; - } - } - } -} // end diff --git a/codes/yaodaojidegou/15816443.java b/codes/yaodaojidegou/15816443.java deleted file mode 100644 index 2851642b69b3f2aa92e2cabe67c49773f6af4c87..0000000000000000000000000000000000000000 --- a/codes/yaodaojidegou/15816443.java +++ /dev/null @@ -1,20 +0,0 @@ -/** - * 冒泡排序函数 - * 使用冒泡排序算法对数组进行升序排序 - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - // 外层循环控制排序的轮数 - for (int i = 0; i < n - 1; i++) { - // 内层循环负责两两相邻元素的比较和交换 - for (int j = 0; j < n - i - 1; j++) { - // 如果前一个元素大于后一个元素，则交换它们的位置 - if (a[j] > a[j + 1]) { - int temp = a[j]; - a[j] = a[j + 1]; - a[j + 1] = temp; - } - } - } -} //end diff --git a/codes/yatou888/15861472.java b/codes/yatou888/15861472.java deleted file mode 100644 index 14984b85ffa2111df883df4858ac150a950766e3..0000000000000000000000000000000000000000 --- a/codes/yatou888/15861472.java +++ /dev/null @@ -1,26 +0,0 @@ -/** - * 冒泡排序函数 - * 通过多次遍历数组，每次比较相邻元素并交换位置，使得较大的元素逐渐“浮”到数组的末尾。 - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - for (int i = 0; i < n - 1; i++) { - // 每一轮排序的标记，用于判断是否有交换发生 - boolean swapped = false; - for (int j = 0; j < n - i - 1; j++) { - // 如果当前元素大于下一个元素，则交换它们的位置 - if (a[j] > a[j + 1]) { - int temp = a[j]; - a[j] = a[j + 1]; - a[j + 1] = temp; - // 标记有交换发生 - swapped = true; - } - } - // 如果这一轮没有发生交换，说明数组已经有序，直接退出循环 - if (!swapped) { - break; - } - } -} //end diff --git a/codes/yeats_liao/.keep b/codes/yeats_liao/.keep deleted file mode 100644 index e69de29bb2d1d6434b8b29ae775ad8c2e48c5391..0000000000000000000000000000000000000000 diff --git a/codes/yeats_liao/9946775.java b/codes/yeats_liao/9946775.java deleted file mode 100644 index 408e7021b7c91a3e0806901aa30f7b99f287ac3e..0000000000000000000000000000000000000000 --- a/codes/yeats_liao/9946775.java +++ /dev/null @@ -1,19 +0,0 @@ -/** - * 冒泡排序函数 - * aa bb cc - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - // 你的代码，使无序数组 a 变得有序 - for(int i = 0 ; i < n - 1 ; i++){ - for(int j = 0 ; j < n - 1 - i ; j++){ - if(a[j] > a[j + 1]){ - int tmp = a[j]; - a[j] = a[j + 1]; - a[j + 1] = tmp; - } - } - } - -} //end diff --git a/codes/yeyeya/15775016.java b/codes/yeyeya/15775016.java deleted file mode 100644 index 987377810b5beca8eb4bf5eafeee5db45e234a87..0000000000000000000000000000000000000000 --- a/codes/yeyeya/15775016.java +++ /dev/null @@ -1,20 +0,0 @@ -/** - * 冒泡排序函数 - * aa bb cc - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - // 你的代码，使无序数组 a 变得有序 - for(int i = 0; i < n; i++) { - for(int liuy = 0; liuy < n - i - 1; liuy++) { - if(a[liuy] > a[liuy + 1]) { - int temp = a[liuy]; - a [liuy] = a[liuy + 1]; - a[liuy + 1] = temp; - } - } - } - - -} //end,liuy diff --git a/codes/yf200304/.keep b/codes/yf200304/.keep deleted file mode 100644 index e69de29bb2d1d6434b8b29ae775ad8c2e48c5391..0000000000000000000000000000000000000000 diff --git a/codes/yf200304/15843198.java b/codes/yf200304/15843198.java deleted file mode 100644 index 6e9861fa3ec6d5a2553cdccd1bb1e977430c671b..0000000000000000000000000000000000000000 --- a/codes/yf200304/15843198.java +++ /dev/null @@ -1,19 +0,0 @@ -/** - * 冒泡排序函数 - * aa bb cc - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - // 你的代码，使无序数组 a 变得有序 - for (int i = 0; i < n - 1; i++) { - for (int j = 0; j < n - i - 1; j++) { - if (a[j] > a[j + 1]) { - - int temp = a[j]; - a[j] = a[j + 1]; - a[j + 1] = temp; - } - } - } -} //end \ No newline at end of file diff --git a/codes/yf20030921/15807359.java b/codes/yf20030921/15807359.java deleted file mode 100644 index 24f513b3219ac31ac3dcffe774647aa7bfdac254..0000000000000000000000000000000000000000 --- a/codes/yf20030921/15807359.java +++ /dev/null @@ -1,11 +0,0 @@ -public static void bubbleSort(int [] a, int n){ - for (int i = 0; i < n - 1; i++) { - for (int j = 0; j < n - 1 - i; j++) { - if (a[j] > a[j + 1]) { - int temp = a[j]; - a[j] = a[j + 1]; - a[j + 1] = temp; - } - } - } -} diff --git a/codes/yhfysun/15523539.java b/codes/yhfysun/15523539.java deleted file mode 100644 index 854beb62bfcf4ead3549d682ffca7f1b9f32d947..0000000000000000000000000000000000000000 --- a/codes/yhfysun/15523539.java +++ /dev/null @@ -1,19 +0,0 @@ -/** - * 冒泡排序函数 - * aa bb cc - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - for(int i = 0; i < n-1 ; i++){ - for (int j = 0;j < n-1-i;j++){ - if(a[j] > a[j+1]){ - int temp = a[j]; - a[j] = a[j+1]; - a[j+1] = temp; - } - } - } - -} //end - diff --git a/codes/yigekongbai/.keep b/codes/yigekongbai/.keep deleted file mode 100644 index e69de29bb2d1d6434b8b29ae775ad8c2e48c5391..0000000000000000000000000000000000000000 diff --git a/codes/yigekongbai/15867120.java b/codes/yigekongbai/15867120.java deleted file mode 100644 index 6426772fb479b07ed3be21ef1867921d1dbb194c..0000000000000000000000000000000000000000 --- a/codes/yigekongbai/15867120.java +++ /dev/null @@ -1,20 +0,0 @@ -/** - * 冒泡排序函数 - * aa bb cc - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - // 你的代码，使无序数组 a 变得有序 - for(int i = 0; i < n; i++) { - for(int j = 0; j < n - i - 1; j++) { - if(a[j] > a[j + 1]) { - int temp = a[j]; - a [j] = a[j + 1]; - a[j + 1] = temp; - } - } - } - - -} //end \ No newline at end of file diff --git a/codes/yiiixxxx/15688342.java b/codes/yiiixxxx/15688342.java deleted file mode 100644 index 240d048c4f9fe406136ace647eee2cbd7197b2ed..0000000000000000000000000000000000000000 --- a/codes/yiiixxxx/15688342.java +++ /dev/null @@ -1,27 +0,0 @@ -/** - * 冒泡排序函数 - * 依次比较相邻的元素，如果顺序错误则交换它们，直到没有需要交换的元素为止。 - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int[] a, int n) { - for (int i = 0; i < n - 1; i++) { - // 标记是否有交换，用于优化在某一趟排序中无交换时提前结束 - boolean swapped = false; - for (int j = 0; j < n - i - 1; j++) { - // 如果当前元素大于下一个元素，则交换它们 - if (a[j] > a[j + 1]) { - // 交换 a[j] 和 a[j+1] - int temp = a[j]; - a[j] = a[j + 1]; - a[j + 1] = temp; - // 标记本趟有交换发生 - swapped = true; - } - } - // 如果某一趟排序中没有发生交换，说明数组已经有序，可以提前结束排序 - if (!swapped) { - break; - } - } -} // end diff --git a/codes/yikanji/10160695.java b/codes/yikanji/10160695.java deleted file mode 100644 index bd82b07de14dad4d7c8b6b8bd1e16555dbfb44b5..0000000000000000000000000000000000000000 --- a/codes/yikanji/10160695.java +++ /dev/null @@ -1,18 +0,0 @@ -/** - * 冒泡排序函数 - * aa bb cc - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - // 你的代码，使无序数组 a 变得有序 - for (int i = 0; i < n; i++) { - for (int j = n - 1; j > i; j--) { - if (a[j] < a[j-1]) { - int temp = a[j]; - a[j] = a[j-1]; - a[j-1] = temp; - } - } - } -} //end diff --git a/codes/yimengzhiyan/16563760.java b/codes/yimengzhiyan/16563760.java deleted file mode 100644 index 8527e1c6e49720f73cb92fa5ed1ee9ee1a2c56e1..0000000000000000000000000000000000000000 --- a/codes/yimengzhiyan/16563760.java +++ /dev/null @@ -1,18 +0,0 @@ -/** - * 冒泡排序函数 - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n) { - for (int i = 0; i < n - 1; i++) { - for (int j = 0; j < n - 1 - i; j++) { - if (a[j] > a[j + 1]) { - // 交换 a[j] 和 a[j + 1] - int temp = a[j]; - a[j] = a[j + 1]; - a[j + 1] = temp; - } - } - } -} - diff --git a/codes/yinrr123/15627843.java b/codes/yinrr123/15627843.java deleted file mode 100644 index f6bba3727ed30eed0810143729439c8b003522b2..0000000000000000000000000000000000000000 --- a/codes/yinrr123/15627843.java +++ /dev/null @@ -1,20 +0,0 @@ -/** - * 冒泡排序函数 - * aa bb cc - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - // 你的代码，使无序数组 a 变得有序 - for(int i = 0; i < n; i++) { - for(int yinrr = 0; yinrr < n - i - 1; yinrr++) { - if(a[yinrr] > a[yinrr + 1]) { - int temp = a[yinrr]; - a [yinrr] = a[yinrr + 1]; - a[yinrr + 1] = temp; - } - } - } - - -} //end,yinrrzj diff --git a/codes/yisheng/15775181.java b/codes/yisheng/15775181.java deleted file mode 100644 index 987377810b5beca8eb4bf5eafeee5db45e234a87..0000000000000000000000000000000000000000 --- a/codes/yisheng/15775181.java +++ /dev/null @@ -1,20 +0,0 @@ -/** - * 冒泡排序函数 - * aa bb cc - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - // 你的代码，使无序数组 a 变得有序 - for(int i = 0; i < n; i++) { - for(int liuy = 0; liuy < n - i - 1; liuy++) { - if(a[liuy] > a[liuy + 1]) { - int temp = a[liuy]; - a [liuy] = a[liuy + 1]; - a[liuy + 1] = temp; - } - } - } - - -} //end,liuy diff --git a/codes/yisuiyuan/.java b/codes/yisuiyuan/.java deleted file mode 100644 index e69de29bb2d1d6434b8b29ae775ad8c2e48c5391..0000000000000000000000000000000000000000 diff --git a/codes/yisuiyuan/15539123.java b/codes/yisuiyuan/15539123.java deleted file mode 100644 index 65c0185585de579edb6caf41a9f8509595e21046..0000000000000000000000000000000000000000 --- a/codes/yisuiyuan/15539123.java +++ /dev/null @@ -1,19 +0,0 @@ -/** - * 冒泡排序函数 - * aa bb cc - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int[] a, int n) { - // 你的代码，使无序数组 a 变得有序 - for (int i = 0; i < n - 1; i++) { - for (int j = 0; j < n - i - 1; j++) { - if (a[j] > a[j + 1]) { - // 交换a[j]和a[j+1] - int temp = a[j]; - a[j] = a[j + 1]; - a[j + 1] = temp; - } - } - } - } // end diff --git a/codes/yixiak/15186898.java b/codes/yixiak/15186898.java deleted file mode 100644 index c53c87605e83bad70d7f5a3ec2b4f3965ca69f9d..0000000000000000000000000000000000000000 --- a/codes/yixiak/15186898.java +++ /dev/null @@ -1,19 +0,0 @@ -/** - * 冒泡排序函数 - * aa bb cc - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - // 你的代码，使无序数组 a 变得有序 - for (int i = 0; i < n; i++) { - for (int j = i + 1; j < n; j++) { - if (a[i] > a[j]) { - int tmp = a[j]; - a[j] = a[i]; - a[i] = tmp; - } - } - } - -} //end \ No newline at end of file diff --git a/codes/yiyi123/15684743.java b/codes/yiyi123/15684743.java deleted file mode 100644 index 54c5f3869cd16ee9e7c2b77895a39fae63f05dbc..0000000000000000000000000000000000000000 --- a/codes/yiyi123/15684743.java +++ /dev/null @@ -1,20 +0,0 @@ -/** - * 冒泡排序函数 - * aa bb cc - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - // 你的代码，使无序数组 a 变得有序 - for(int i = 0; i < n; i++) { - for(int liuy = 0; liuy < n - i - 1; liuy++) { - if(a[liuy] > a[liuy + 1]) { - int temp = a[liuy]; - a [liuy] = a[liuy + 1]; - a[liuy + 1] = temp; - } - } - } - - -} //end,liuy \ No newline at end of file diff --git a/codes/yiyicoder/15630262.java b/codes/yiyicoder/15630262.java deleted file mode 100644 index 9de98c3feda56594aba5c4720c49ec34b7158aa0..0000000000000000000000000000000000000000 --- a/codes/yiyicoder/15630262.java +++ /dev/null @@ -1,20 +0,0 @@ -/** - * 冒泡排序函数 - * 对数组进行冒泡排序，使其变得有序 - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int[] a, int n) { - // 外层循环，控制需要排序的轮数 - for (int i = 0; i < n - 1; i++) { - // 内层循环，控制每轮需要比较的次数 - for (int j = 0; j < n - 1 - i; j++) { - // 如果当前元素大于下一个元素，则交换它们的位置 - if (a[j] > a[j + 1]) { - int temp = a[j]; - a[j] = a[j + 1]; - a[j + 1] = temp; - } - } - } -} // end diff --git a/codes/yiyiguowang/15885939.java b/codes/yiyiguowang/15885939.java deleted file mode 100644 index 636aa879767840d411530c40981647b6beb5b3e9..0000000000000000000000000000000000000000 --- a/codes/yiyiguowang/15885939.java +++ /dev/null @@ -1,11 +0,0 @@ -public static void bubbleSort (int []a,int n){ - for(int i=0;ia[j+1]){ - int temp=a[j]; - a[j]=a[j+1]; - a[j+1]=temp; - } - } - } -} diff --git a/codes/yj1198222879/9947891.java b/codes/yj1198222879/9947891.java deleted file mode 100644 index dad23608af8a7494731fa2b37881b8ccd926c8bc..0000000000000000000000000000000000000000 --- a/codes/yj1198222879/9947891.java +++ /dev/null @@ -1,19 +0,0 @@ -/** - * 冒泡排序函数 - * aa bb cc - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - // 你的代码，使无序数组 a 变得有序 - int i,j; - for (i=n-1; i>0; i--) { - for (j=0; j a[j+1]) { - int tmp = a[j]; - a[j] = a[j+1]; - a[j+1] = tmp; - } - } - } -} //end diff --git a/codes/yjh123456/15542529.java b/codes/yjh123456/15542529.java deleted file mode 100644 index 1a35e9c62ccaa8e1277e39f70a2a6b18b17b001e..0000000000000000000000000000000000000000 --- a/codes/yjh123456/15542529.java +++ /dev/null @@ -1,20 +0,0 @@ -/** - * 冒泡排序函数 - * aa bb cc - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - // 你的代码，使无序数组 a 变得有序 - for(int i = 0; i < n; i++) { - for(int xtians = 0; xtians < n - i - 1; xtians++) { - if(a[xtians] > a[xtians + 1]) { - int temp = a[xtians]; - a [xtians] = a[xtians + 1]; - a[xtians + 1] = temp; - } - } - } - - -} //end,ok结束 diff --git a/codes/yk12345/15606552.java b/codes/yk12345/15606552.java deleted file mode 100644 index c2afaa2414da1853e4500b02c6de9068b64aeafe..0000000000000000000000000000000000000000 --- a/codes/yk12345/15606552.java +++ /dev/null @@ -1,18 +0,0 @@ -/** - * 冒泡排序函数 - * aa bb cc - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - for(int i = 0; i < n-1 ; i++){ - for (int j = 0;j < n-1-i;j++){ - if(a[j] > a[j+1]){ - int temp = a[j]; - a[j] = a[j+1]; - a[j+1] = temp; - } - } - } - -} //end diff --git a/codes/ylolpeng/11122754.java b/codes/ylolpeng/11122754.java deleted file mode 100644 index a833d8d31b2581029ab106b60f560dd2c73ff238..0000000000000000000000000000000000000000 --- a/codes/ylolpeng/11122754.java +++ /dev/null @@ -1,24 +0,0 @@ -/** - * 冒泡排序函数 - * aa bb cc - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - // 你的代码，使无序数组 a 变得有序 - for(int j=0;ja[i+1]) - { - temp=a[i]; - a[i]=a[i+1]; - a[i+1]=temp; - } - } - } - //System.out.println(a); - -} //end \ No newline at end of file diff --git a/codes/yls3050933027/15895415.java b/codes/yls3050933027/15895415.java deleted file mode 100644 index 099cd10dadf83c9c03052cd36783da4ad3e211e0..0000000000000000000000000000000000000000 --- a/codes/yls3050933027/15895415.java +++ /dev/null @@ -1,27 +0,0 @@ -/** - * 冒泡排序函数 - * 对数组a进行升序排序 - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int[] a, int n) { - for (int i = 0; i < n - 1; i++) { - // 设置一个标志位，用于判断本轮是否发生了交换 - boolean swapped = false; - for (int j = 0; j < n - i - 1; j++) { - // 如果前一个元素大于后一个元素，则交换它们 - if (a[j] > a[j + 1]) { - int temp = a[j]; - a[j] = a[j + 1]; - a[j + 1] = temp; - // 发生了交换，设置标志位为true - swapped = true; - } - } - // 如果本轮没有发生交换，说明数组已经有序，可以提前结束排序 - if (!swapped) { - break; - } - } -} // end - diff --git a/codes/ymx2026/11211004.java b/codes/ymx2026/11211004.java deleted file mode 100644 index 153827af839d9541a28ed18f3452d9fe079c6061..0000000000000000000000000000000000000000 --- a/codes/ymx2026/11211004.java +++ /dev/null @@ -1,19 +0,0 @@ -/** - * 冒泡排序函数 - * aa bb cc - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - // 你的代码，使无序数组 a 变得有序 - for(int i=0;ia[j+1]){ - int t=a[j]; - a[j]=a[j+1]; - a[j+1]=t; - } - } - } - -} //end \ No newline at end of file diff --git a/codes/yoU_Qu/15526866.java b/codes/yoU_Qu/15526866.java deleted file mode 100644 index 2f5fcde8f2411450332b695ff18c212024f86b31..0000000000000000000000000000000000000000 --- a/codes/yoU_Qu/15526866.java +++ /dev/null @@ -1,22 +0,0 @@ -/** - * 冒泡排序函数 - * aa bb cc - * @param a 待排序的数组 - * @param n 待排序的数组长度 -**/ - -public static void bubbleSort(int [] a, int n){ - // 你的代码，使无序数组 a 变得有序 - - for (int i = 0; i < n - 1; i++) { - for (int j = 0; j < n - i - 1; j++) { - if (a[j] > a[j + 1]) { - // 交换元素 - int temp = a[j]; - a[j] = a[j + 1]; - a[j + 1] = temp; - } - } - } -} //end - diff --git a/codes/you1229/15774816.java b/codes/you1229/15774816.java deleted file mode 100644 index 2edb0357715551f102797dc96d8ba23399c6f2bb..0000000000000000000000000000000000000000 --- a/codes/you1229/15774816.java +++ /dev/null @@ -1,18 +0,0 @@ -/** - * 冒泡排序函数 - * 该函数使用冒泡排序算法对数组进行升序排序 - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int[] a, int n) { - for (int i = 0; i < n - 1; i++) { // 外层循环控制所有轮次的比较 - for (int j = 0; j < n - i - 1; j++) { // 内层循环控制每轮的比较次数 - if (a[j] > a[j + 1]) { // 如果前一个元素大于后一个元素，则交换它们的位置 - // 交换 a[j] 和 a[j+1] - int temp = a[j]; - a[j] = a[j + 1]; - a[j + 1] = temp; - } - } - } -} // end diff --git a/codes/yp33posit/.keep b/codes/yp33posit/.keep deleted file mode 100644 index e69de29bb2d1d6434b8b29ae775ad8c2e48c5391..0000000000000000000000000000000000000000 diff --git a/codes/yp33posit/15840404.java b/codes/yp33posit/15840404.java deleted file mode 100644 index 6e9861fa3ec6d5a2553cdccd1bb1e977430c671b..0000000000000000000000000000000000000000 --- a/codes/yp33posit/15840404.java +++ /dev/null @@ -1,19 +0,0 @@ -/** - * 冒泡排序函数 - * aa bb cc - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - // 你的代码，使无序数组 a 变得有序 - for (int i = 0; i < n - 1; i++) { - for (int j = 0; j < n - i - 1; j++) { - if (a[j] > a[j + 1]) { - - int temp = a[j]; - a[j] = a[j + 1]; - a[j + 1] = temp; - } - } - } -} //end \ No newline at end of file diff --git a/codes/yqh15977954304/15861888.java b/codes/yqh15977954304/15861888.java deleted file mode 100644 index 987377810b5beca8eb4bf5eafeee5db45e234a87..0000000000000000000000000000000000000000 --- a/codes/yqh15977954304/15861888.java +++ /dev/null @@ -1,20 +0,0 @@ -/** - * 冒泡排序函数 - * aa bb cc - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - // 你的代码，使无序数组 a 变得有序 - for(int i = 0; i < n; i++) { - for(int liuy = 0; liuy < n - i - 1; liuy++) { - if(a[liuy] > a[liuy + 1]) { - int temp = a[liuy]; - a [liuy] = a[liuy + 1]; - a[liuy + 1] = temp; - } - } - } - - -} //end,liuy diff --git a/codes/yrr456/15542411.java b/codes/yrr456/15542411.java deleted file mode 100644 index 3ea950914ef6ca7a530393ef2ca61c960b899923..0000000000000000000000000000000000000000 --- a/codes/yrr456/15542411.java +++ /dev/null @@ -1,20 +0,0 @@ -/** - * 冒泡排序函数 - * aa bb cc - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - // 你的代码，使无序数组 a 变得有序 - for(int i = 0; i < n; i++) { - for(int ruirui = 0; ruirui < n - i - 1; ruirui++) { - if(a[ruirui] > a[ruirui + 1]) { - int temp = a[ruirui]; - a [ruirui] = a[ruirui + 1]; - a[ruirui + 1] = temp; - } - } - } - - -} //end,ruirui diff --git a/codes/ysyhl9tian/15698870.java b/codes/ysyhl9tian/15698870.java deleted file mode 100644 index c2afaa2414da1853e4500b02c6de9068b64aeafe..0000000000000000000000000000000000000000 --- a/codes/ysyhl9tian/15698870.java +++ /dev/null @@ -1,18 +0,0 @@ -/** - * 冒泡排序函数 - * aa bb cc - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - for(int i = 0; i < n-1 ; i++){ - for (int j = 0;j < n-1-i;j++){ - if(a[j] > a[j+1]){ - int temp = a[j]; - a[j] = a[j+1]; - a[j+1] = temp; - } - } - } - -} //end diff --git a/codes/ytaomg/11211641.java b/codes/ytaomg/11211641.java deleted file mode 100644 index 272a12fc81d3dd0e857bba9ae001c15818fb7123..0000000000000000000000000000000000000000 --- a/codes/ytaomg/11211641.java +++ /dev/null @@ -1,18 +0,0 @@ - /** - * 冒泡排序函数 - * aa bb cc - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ - public static void bubbleSort(int [] arr, int n){ - // 你的代码，使无序数组 a 变得有序 - for (int i = 0; i < n; i++) { - for (int j = (i + 1); j < n; j++) { - if (arr[i] > arr[j]) { - int temp = arr[i]; - arr[i] = arr[j]; - arr[j] = temp; - } - } - } - } //end \ No newline at end of file diff --git a/codes/yuanps/10188803.java b/codes/yuanps/10188803.java deleted file mode 100644 index 80f067af421f53792c12e63cebbef5a2784dede9..0000000000000000000000000000000000000000 --- a/codes/yuanps/10188803.java +++ /dev/null @@ -1,18 +0,0 @@ -/** - * 冒泡排序函数 - * aa bb cc - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - // 你的代码，使无序数组 a 变得有序 - for(int i=0;i a[j+1]){ - int a1 = a[j]; - a[j] = a[j+1]; - a[j+1] = a1; - } - } - } -} //end` diff --git a/codes/yueliang9809/15847888.java b/codes/yueliang9809/15847888.java deleted file mode 100644 index 809e6c454de4e33d540c35a26f34e2679a08693a..0000000000000000000000000000000000000000 --- a/codes/yueliang9809/15847888.java +++ /dev/null @@ -1,18 +0,0 @@ -/** - * 冒泡排序函数 - * 通过相邻元素两两比较和交换，使得每一轮循环后最大（或最小）的元素“冒泡”到数组的末尾。 - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int[] a, int n) { - for (int i = 0; i < n - 1; i++) { // 外层循环控制比较轮数 - for (int j = 0; j < n - 1 - i; j++) { // 内层循环控制每轮比较的次数 - if (a[j] > a[j + 1]) { // 如果当前元素大于下一个元素，则交换它们的位置 - // 交换 a[j] 和 a[j + 1] - int temp = a[j]; - a[j] = a[j + 1]; - a[j + 1] = temp; - } - } - } -} //end diff --git a/codes/yujinghui/15805872.java b/codes/yujinghui/15805872.java deleted file mode 100644 index ce4123f36198ecb034f9ba60dd9025622afaf314..0000000000000000000000000000000000000000 --- a/codes/yujinghui/15805872.java +++ /dev/null @@ -1,18 +0,0 @@ -/** - * 冒泡排序函数 - * 通过相邻元素两两比较和交换，使得每一轮过后最大（或最小）的元素被交换到序列末尾 - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - for (int i = 0; i < n - 1; i++) { // 外层循环控制排序的轮数 - for (int j = 0; j < n - 1 - i; j++) { // 内层循环控制每轮的比较次数 - if (a[j] > a[j + 1]) { // 如果前一个元素大于后一个元素，则交换它们 - // 交换 a[j] 和 a[j+1] - int temp = a[j]; - a[j] = a[j + 1]; - a[j + 1] = temp; - } - } - } -} //end diff --git a/codes/yulinL/.java b/codes/yulinL/.java deleted file mode 100644 index 8b137891791fe96927ad78e64b0aad7bded08bdc..0000000000000000000000000000000000000000 --- a/codes/yulinL/.java +++ /dev/null @@ -1 +0,0 @@ - diff --git a/codes/yulinL/13638622.java b/codes/yulinL/13638622.java deleted file mode 100644 index 785e7d5e62ed2e9d301405dc8d13f64fcd923c0e..0000000000000000000000000000000000000000 --- a/codes/yulinL/13638622.java +++ /dev/null @@ -1,20 +0,0 @@ -/** - * 冒泡排序函数 - * aa bb cc - * - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ - public static void bubbleSort(int[] a, int n) { - // 你的代码，使无序数组 a 变得有序 - int temp; - for (int i = 0; i < n - 1; i++) { - for (int j = 0; j < n - 1 - i; j++) { - if (a[j] > a[j + 1]) { - temp = a[j]; - a[j] = a[j + 1]; - a[j + 1] = temp; - } - } - } - } //end diff --git a/codes/yuliwei/15592333.java b/codes/yuliwei/15592333.java deleted file mode 100644 index ae82e695cbfd360050241c3f1f592658c8c1d4e7..0000000000000000000000000000000000000000 --- a/codes/yuliwei/15592333.java +++ /dev/null @@ -1,35 +0,0 @@ -/** - - * 冒泡排序函数 - - * aa bb cc - - * @param a 待排序的数组 - - * @param n 待排序的数组长度 - - */ - -public static void bubbleSort(int [] a, int n){ - - for(int i = 0; i < n-1 ; i++){ - - for (int j = 0;j < n-1-i;j++){ - - if(a[j] > a[j+1]){ - - int temp = a[j]; - - a[j] = a[j+1]; - - a[j+1] = temp; - - } - - } - - } - - - -} //end diff --git a/codes/yunyunne/15775145.java b/codes/yunyunne/15775145.java deleted file mode 100644 index 987377810b5beca8eb4bf5eafeee5db45e234a87..0000000000000000000000000000000000000000 --- a/codes/yunyunne/15775145.java +++ /dev/null @@ -1,20 +0,0 @@ -/** - * 冒泡排序函数 - * aa bb cc - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - // 你的代码，使无序数组 a 变得有序 - for(int i = 0; i < n; i++) { - for(int liuy = 0; liuy < n - i - 1; liuy++) { - if(a[liuy] > a[liuy + 1]) { - int temp = a[liuy]; - a [liuy] = a[liuy + 1]; - a[liuy + 1] = temp; - } - } - } - - -} //end,liuy diff --git a/codes/yuyuya/15772019.java b/codes/yuyuya/15772019.java deleted file mode 100644 index 987377810b5beca8eb4bf5eafeee5db45e234a87..0000000000000000000000000000000000000000 --- a/codes/yuyuya/15772019.java +++ /dev/null @@ -1,20 +0,0 @@ -/** - * 冒泡排序函数 - * aa bb cc - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - // 你的代码，使无序数组 a 变得有序 - for(int i = 0; i < n; i++) { - for(int liuy = 0; liuy < n - i - 1; liuy++) { - if(a[liuy] > a[liuy + 1]) { - int temp = a[liuy]; - a [liuy] = a[liuy + 1]; - a[liuy + 1] = temp; - } - } - } - - -} //end,liuy diff --git a/codes/yuyuyu11/15522885.java b/codes/yuyuyu11/15522885.java deleted file mode 100644 index f79136634908ee2d6f79c56a39b719c63106063a..0000000000000000000000000000000000000000 --- a/codes/yuyuyu11/15522885.java +++ /dev/null @@ -1,20 +0,0 @@ -/** - * 冒泡排序函数 - * aa bb cc - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - // 你的代码，使无序数组 a 变得有序 - for (int i = 0; i < n - 1; i++) { - for (int j = 0; j < n - i - 1; j++) { - if (a[j] > a[j + 1]) { - // 交换元素 - int temp = a[j]; - a[j] = a[j + 1]; - a[j + 1] = temp; - } - } - } -} //end - diff --git a/codes/yuzhanao/15592466.java b/codes/yuzhanao/15592466.java deleted file mode 100644 index ae82e695cbfd360050241c3f1f592658c8c1d4e7..0000000000000000000000000000000000000000 --- a/codes/yuzhanao/15592466.java +++ /dev/null @@ -1,35 +0,0 @@ -/** - - * 冒泡排序函数 - - * aa bb cc - - * @param a 待排序的数组 - - * @param n 待排序的数组长度 - - */ - -public static void bubbleSort(int [] a, int n){ - - for(int i = 0; i < n-1 ; i++){ - - for (int j = 0;j < n-1-i;j++){ - - if(a[j] > a[j+1]){ - - int temp = a[j]; - - a[j] = a[j+1]; - - a[j+1] = temp; - - } - - } - - } - - - -} //end diff --git a/codes/ywf123456/15834908.java b/codes/ywf123456/15834908.java deleted file mode 100644 index d0e7038df81a1dcd40ba57e5267839caad594f03..0000000000000000000000000000000000000000 --- a/codes/ywf123456/15834908.java +++ /dev/null @@ -1,19 +0,0 @@ -/** - * 冒泡排序函数 - * 冒泡排序是一种简单的排序算法，它重复地遍历要排序的数列，一次比较两个元素，如果他们的顺序错误就把他们交换过来。 - * 遍历数列的工作是重复地进行直到没有再需要交换，也就是说该数列已经排序完成。 - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - for (int i = 0; i < n - 1; i++) { // 外层循环控制比较的次数 - for (int j = 0; j < n - 1 - i; j++) { // 内层循环控制每一轮比较的次数 - // 如果前一个元素比后一个元素大，则交换它们的位置 - if (a[j] > a[j + 1]) { - int temp = a[j]; - a[j] = a[j + 1]; - a[j + 1] = temp; - } - } - } -} //end diff --git a/codes/yxy522/15832952.java b/codes/yxy522/15832952.java deleted file mode 100644 index 77b4e4c54a30ebea05a82d133a50fc260b69b1d9..0000000000000000000000000000000000000000 --- a/codes/yxy522/15832952.java +++ /dev/null @@ -1,17 +0,0 @@ -/** - * 冒泡排序函数 - * 通过相邻元素比较和交换，将最大（或最小）的元素“冒泡”到数组的末尾。 - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int[] a, int n) { - for (int i = 0; i < n - 1; i++) { // 外层循环控制需要排序的趟数 - for (int j = 0; j < n - i - 1; j++) { // 内层循环控制每一趟排序的过程 - if (a[j] > a[j + 1]) { // 相邻元素两两比较，如果前一个比后一个大，则交换它们 - int temp = a[j]; - a[j] = a[j + 1]; - a[j + 1] = temp; - } - } - } -} // end diff --git a/codes/yy19047006973/.keep b/codes/yy19047006973/.keep deleted file mode 100644 index e69de29bb2d1d6434b8b29ae775ad8c2e48c5391..0000000000000000000000000000000000000000 diff --git a/codes/yy19047006973/10972205.java b/codes/yy19047006973/10972205.java deleted file mode 100644 index 9eccfac593dd84bb4c285d230d4de6b8c72a1d65..0000000000000000000000000000000000000000 --- a/codes/yy19047006973/10972205.java +++ /dev/null @@ -1,11 +0,0 @@ -public static void bubbleSort(int [] a, int n) { - for (int i=0 ; ia[j+1]) { - int temp=a[j]; - a[j]=a[j+1]; - a[j+1]=temp; - } - } - } -} diff --git a/codes/yyds0102/11208011.java b/codes/yyds0102/11208011.java deleted file mode 100644 index 272a12fc81d3dd0e857bba9ae001c15818fb7123..0000000000000000000000000000000000000000 --- a/codes/yyds0102/11208011.java +++ /dev/null @@ -1,18 +0,0 @@ - /** - * 冒泡排序函数 - * aa bb cc - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ - public static void bubbleSort(int [] arr, int n){ - // 你的代码，使无序数组 a 变得有序 - for (int i = 0; i < n; i++) { - for (int j = (i + 1); j < n; j++) { - if (arr[i] > arr[j]) { - int temp = arr[i]; - arr[i] = arr[j]; - arr[j] = temp; - } - } - } - } //end \ No newline at end of file diff --git a/codes/yyguaiguaizai/15651703.java b/codes/yyguaiguaizai/15651703.java deleted file mode 100644 index 397e6828cea5dea16731fbbe06a8decb9dee9519..0000000000000000000000000000000000000000 --- a/codes/yyguaiguaizai/15651703.java +++ /dev/null @@ -1,28 +0,0 @@ -/** - * 冒泡排序函数 - * 该函数用于对一个整型数组进行冒泡排序 - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - // 冒泡排序的主体部分 - for (int i = 0; i < n - 1; i++) { - // 设置一个标志位，表示本趟是否发生过交换 - boolean swapped = false; - for (int j = 0; j < n - i - 1; j++) { - // 如果前一个元素大于后一个元素，则交换它们 - if (a[j] > a[j + 1]) { - // 交换 a[j] 和 a[j+1] - int temp = a[j]; - a[j] = a[j + 1]; - a[j + 1] = temp; - // 发生了交换，标志位设为 true - swapped = true; - } - } - // 如果本趟没有发生交换，说明数组已经有序，可以提前结束排序 - if (!swapped) { - break; - } - } -} //end diff --git a/codes/yyh520/15551703.java b/codes/yyh520/15551703.java deleted file mode 100644 index fc14461e48f0de625038375ff6dc8f6d38536135..0000000000000000000000000000000000000000 --- a/codes/yyh520/15551703.java +++ /dev/null @@ -1,17 +0,0 @@ -/** - * 冒泡排序函数 - * aa bb cc - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n) { - // 你的代码，使无序数组 a 变得有序 - for (int i=1; i<=n; i++) - for(int j=0; ja[j+1]) { - int t=a[j]; - a[j]=a[j+1]; - a[j+1]=t; - } - -} //end diff --git a/codes/yyui123/15718758.java b/codes/yyui123/15718758.java deleted file mode 100644 index 987377810b5beca8eb4bf5eafeee5db45e234a87..0000000000000000000000000000000000000000 --- a/codes/yyui123/15718758.java +++ /dev/null @@ -1,20 +0,0 @@ -/** - * 冒泡排序函数 - * aa bb cc - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - // 你的代码，使无序数组 a 变得有序 - for(int i = 0; i < n; i++) { - for(int liuy = 0; liuy < n - i - 1; liuy++) { - if(a[liuy] > a[liuy + 1]) { - int temp = a[liuy]; - a [liuy] = a[liuy + 1]; - a[liuy + 1] = temp; - } - } - } - - -} //end,liuy diff --git a/codes/yyya12/15700309.java b/codes/yyya12/15700309.java deleted file mode 100644 index 987377810b5beca8eb4bf5eafeee5db45e234a87..0000000000000000000000000000000000000000 --- a/codes/yyya12/15700309.java +++ /dev/null @@ -1,20 +0,0 @@ -/** - * 冒泡排序函数 - * aa bb cc - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - // 你的代码，使无序数组 a 变得有序 - for(int i = 0; i < n; i++) { - for(int liuy = 0; liuy < n - i - 1; liuy++) { - if(a[liuy] > a[liuy + 1]) { - int temp = a[liuy]; - a [liuy] = a[liuy + 1]; - a[liuy + 1] = temp; - } - } - } - - -} //end,liuy diff --git a/codes/yzqzhiqi/.keep b/codes/yzqzhiqi/.keep deleted file mode 100644 index e69de29bb2d1d6434b8b29ae775ad8c2e48c5391..0000000000000000000000000000000000000000 diff --git a/codes/yzqzhiqi/15805886.java b/codes/yzqzhiqi/15805886.java deleted file mode 100644 index 6426772fb479b07ed3be21ef1867921d1dbb194c..0000000000000000000000000000000000000000 --- a/codes/yzqzhiqi/15805886.java +++ /dev/null @@ -1,20 +0,0 @@ -/** - * 冒泡排序函数 - * aa bb cc - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - // 你的代码，使无序数组 a 变得有序 - for(int i = 0; i < n; i++) { - for(int j = 0; j < n - i - 1; j++) { - if(a[j] > a[j + 1]) { - int temp = a[j]; - a [j] = a[j + 1]; - a[j + 1] = temp; - } - } - } - - -} //end \ No newline at end of file diff --git a/codes/z1126376522/15835615.java b/codes/z1126376522/15835615.java deleted file mode 100644 index bf2edb92c6bc13dbe32f0d63c66c7d6c392d7a77..0000000000000000000000000000000000000000 --- a/codes/z1126376522/15835615.java +++ /dev/null @@ -1,18 +0,0 @@ -/** - * 冒泡排序函数 - * 通过重复遍历数组并交换相邻的不按顺序的元素，使数组有序 - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int[] a, int n) { - for (int i = 0; i < n - 1; i++) { - for (int j = 0; j < n - i - 1; j++) { - // 如果当前元素大于下一个元素，则交换它们的位置 - if (a[j] > a[j + 1]) { - int temp = a[j]; - a[j] = a[j + 1]; - a[j + 1] = temp; - } - } - } -} // end diff --git a/codes/z13213005762/15514594.java b/codes/z13213005762/15514594.java deleted file mode 100644 index d66c7b0328f84a41b71a062f466c74777cb45a61..0000000000000000000000000000000000000000 --- a/codes/z13213005762/15514594.java +++ /dev/null @@ -1,20 +0,0 @@ -/** - * 冒泡排序函数 - * 冒泡排序是一种简单的排序算法，通过重复地遍历待排序的数列，一次比较两个元素，如果他们的顺序错误就把他们交换过来。 - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - // 外层循环控制所有趟排序 - for (int i = 0; i < n - 1; i++) { - // 内层循环控制每趟排序多少次 - for (int j = 0; j < n - 1 - i; j++) { - // 如果当前元素大于下一个元素，则交换它们的位置 - if (a[j] > a[j + 1]) { - int temp = a[j]; - a[j] = a[j + 1]; - a[j + 1] = temp; - } - } - } -} //end diff --git a/codes/z13213005762/15515049.java b/codes/z13213005762/15515049.java deleted file mode 100644 index d66c7b0328f84a41b71a062f466c74777cb45a61..0000000000000000000000000000000000000000 --- a/codes/z13213005762/15515049.java +++ /dev/null @@ -1,20 +0,0 @@ -/** - * 冒泡排序函数 - * 冒泡排序是一种简单的排序算法，通过重复地遍历待排序的数列，一次比较两个元素，如果他们的顺序错误就把他们交换过来。 - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - // 外层循环控制所有趟排序 - for (int i = 0; i < n - 1; i++) { - // 内层循环控制每趟排序多少次 - for (int j = 0; j < n - 1 - i; j++) { - // 如果当前元素大于下一个元素，则交换它们的位置 - if (a[j] > a[j + 1]) { - int temp = a[j]; - a[j] = a[j + 1]; - a[j + 1] = temp; - } - } - } -} //end diff --git a/codes/z16692104570/15823309.java b/codes/z16692104570/15823309.java deleted file mode 100644 index b459de4f79d5f6ee6e1e40477a23854aa03f5f84..0000000000000000000000000000000000000000 --- a/codes/z16692104570/15823309.java +++ /dev/null @@ -1,21 +0,0 @@ -/** - * 冒泡排序函数 - * 使用冒泡排序算法对数组进行升序排序 - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - // 外层循环控制比较轮数 - for (int i = 0; i < n - 1; i++) { - // 内层循环控制每轮的比较次数 - for (int j = 0; j < n - i - 1; j++) { - // 如果前一个元素大于后一个元素，则交换它们的位置 - if (a[j] > a[j + 1]) { - // 交换元素 - int temp = a[j]; - a[j] = a[j + 1]; - a[j + 1] = temp; - } - } - } -} //end diff --git a/codes/z17735706081/15774718.java b/codes/z17735706081/15774718.java deleted file mode 100644 index af442343ccc6c89d4a2cfc8eb89e60c8d44c753d..0000000000000000000000000000000000000000 --- a/codes/z17735706081/15774718.java +++ /dev/null @@ -1,21 +0,0 @@ -/** - * 冒泡排序函数 - * 通过相邻元素两两比较，将较大的元素逐渐往后移动，从而实现排序 - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int[] a, int n) { - // 遍历整个数组 - for (int i = 0; i < n - 1; i++) { - // 最后一轮比较后，最大的数已经在正确的位置，无需再比较 - for (int j = 0; j < n - 1 - i; j++) { - // 如果当前元素大于下一个元素，则交换它们的位置 - if (a[j] > a[j + 1]) { - // 使用临时变量进行交换 - int temp = a[j]; - a[j] = a[j + 1]; - a[j + 1] = temp; - } - } - } -} // end diff --git a/codes/z2468479040/11197656.java b/codes/z2468479040/11197656.java deleted file mode 100644 index 32b804618c5722f3633fc1dd6a4c3455e0d6da16..0000000000000000000000000000000000000000 --- a/codes/z2468479040/11197656.java +++ /dev/null @@ -1,14 +0,0 @@ - -public static void bubbleSort(int [] a, int n){ - - for(int i = 0 ; i < n - 1 ; i++){ - for(int j = 0 ; j < n - 1 - i ; j++){ - if(a[j] > a[j + 1]){ - int tmp = a[j]; - a[j] = a[j + 1]; - a[j + 1] = tmp; - } - } - } - - } \ No newline at end of file diff --git a/codes/zangzang/9952436.java b/codes/zangzang/9952436.java deleted file mode 100644 index 481ec544586e454023356184f1ce87ca671a7507..0000000000000000000000000000000000000000 --- a/codes/zangzang/9952436.java +++ /dev/null @@ -1,19 +0,0 @@ -/** - * 冒泡排序函数 - * aa bb cc - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - // 你的代码，使无序数组 a 变得有序 - for(int i = 0 ; i < n - 1 ; i++){ - for(int j = 0 ; j < n - 1 - i ; j++){ - if(a[j] > a[j + 1]){ - int tmp = a[j]; - a[j] = a[j + 1]; - a[j + 1] = tmp; - } - } - } - -} //end \ No newline at end of file diff --git a/codes/zcx1534344521/16410752.java b/codes/zcx1534344521/16410752.java deleted file mode 100644 index 6086b39e5190028e3ad5a310316da9d25ca4454a..0000000000000000000000000000000000000000 --- a/codes/zcx1534344521/16410752.java +++ /dev/null @@ -1,21 +0,0 @@ -/* - * 冒泡排序函数 - * aa bb cc - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - for (int i = 0; i < n - 1; i++) { - for (int j = 0; j < n - 1 - i; j++) { - if (a[j] > a[j + 1]) { - // 交换a[j]和a[j+1] - int temp = a[j]; - a[j] = a[j + 1]; - a[j + 1] = temp; - } - } - } - - - -} //end diff --git a/codes/zer0_1s/10517202.java b/codes/zer0_1s/10517202.java deleted file mode 100644 index dd4dc6902d09bbf3665f819a50988369421ea573..0000000000000000000000000000000000000000 --- a/codes/zer0_1s/10517202.java +++ /dev/null @@ -1,27 +0,0 @@ -/** - * 冒泡排序函数 - * aa bb cc - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - // 你的代码，使无序数组 a 变得有序 - - - int temp = 0;//临时变量 - for (int j = 0; j < n - 1; j++) { - - - for (int i = 0; i < n-1 -j ; i++) { - - if (a[i] > a[i+1]){ - - //三角交换 - temp = a[i]; - a[i] = a[i+1]; - a[i+1] = temp; - } - } - } - -} //end diff --git a/codes/zeroday/15115160.java b/codes/zeroday/15115160.java deleted file mode 100644 index 1a4afbe0d388e6ace638b01b4673372ecbf16b22..0000000000000000000000000000000000000000 --- a/codes/zeroday/15115160.java +++ /dev/null @@ -1,18 +0,0 @@ -/** - * 冒泡排序函数 - * - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int[] a, int n) { - for (int i = 0; i < n - 1; i++) { - for (int j = 0; j < n - 1 - i; j++) { - if (a[j] > a[j + 1]) { - // 交换 a[j] 和 a[j+1] - int temp = a[j]; - a[j] = a[j + 1]; - a[j + 1] = temp; - } - } - } -} diff --git a/codes/zerofei_tsai/10742215.java b/codes/zerofei_tsai/10742215.java deleted file mode 100644 index c64acb7a36ef8cb23b87dff4b419786d987a7e59..0000000000000000000000000000000000000000 --- a/codes/zerofei_tsai/10742215.java +++ /dev/null @@ -1,19 +0,0 @@ -/** - * 冒泡排序函数 - * aa bb cc - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - // 你的代码，使无序数组 a 变得有序 - for (int i=0; i a[j+1]) { - int tmp = a[j]; - a[j] = a[j+1]; - a[j+1] = tmp; - } - } - } -} //end - diff --git a/codes/zgm1214/15650118.java b/codes/zgm1214/15650118.java deleted file mode 100644 index e654b3dbaef07a18a602b1fc53672ca093abd7f8..0000000000000000000000000000000000000000 --- a/codes/zgm1214/15650118.java +++ /dev/null @@ -1,22 +0,0 @@ -/** - * 冒泡排序函数 - * 通过多次遍历数组，比较相邻元素，并交换它们（如果它们的顺序错误）来排序数组 - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int[] a, int n) { - // 外层循环控制遍历次数 - for (int i = 0; i < n - 1; i++) { - // 内层循环负责具体的相邻元素比较和交换 - for (int j = 0; j < n - i - 1; j++) { - // 如果当前元素大于下一个元素，则交换它们的位置 - if (a[j] > a[j + 1]) { - // 交换a[j]和a[j+1] - int temp = a[j]; - a[j] = a[j + 1]; - a[j + 1] = temp; - } - } - } - // 当所有的循环都完成后，数组a已经被排序 -} // end diff --git a/codes/zhangll/10007624.java b/codes/zhangll/10007624.java deleted file mode 100644 index b2626aa5bc7ddedb3154037acef08fc04d0b3e74..0000000000000000000000000000000000000000 --- a/codes/zhangll/10007624.java +++ /dev/null @@ -1,21 +0,0 @@ -/** - * 冒泡排序函数 - * aa bb cc - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - // 你的代码，使无序数组 a 变得有序 - for (int i = 0; i < n - 1; i++) - { - for (int j = 0; j < n - 1 - i; j++) - { - if (a[j] > a[j+1]) - { - int temp = a[j+1]; - a[j+1] = a[j]; - a[j] = temp; - } - } - } -} //end diff --git a/codes/zhangmin_1/15815725.java b/codes/zhangmin_1/15815725.java deleted file mode 100644 index ae82e695cbfd360050241c3f1f592658c8c1d4e7..0000000000000000000000000000000000000000 --- a/codes/zhangmin_1/15815725.java +++ /dev/null @@ -1,35 +0,0 @@ -/** - - * 冒泡排序函数 - - * aa bb cc - - * @param a 待排序的数组 - - * @param n 待排序的数组长度 - - */ - -public static void bubbleSort(int [] a, int n){ - - for(int i = 0; i < n-1 ; i++){ - - for (int j = 0;j < n-1-i;j++){ - - if(a[j] > a[j+1]){ - - int temp = a[j]; - - a[j] = a[j+1]; - - a[j+1] = temp; - - } - - } - - } - - - -} //end diff --git a/codes/zhangpc/10298011.java b/codes/zhangpc/10298011.java deleted file mode 100644 index 02f03636e6ca97a81bc2b9b110d99d325015c6d9..0000000000000000000000000000000000000000 --- a/codes/zhangpc/10298011.java +++ /dev/null @@ -1,17 +0,0 @@ -/** - * 冒泡排序函数 - * aa bb cc - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a,int n){ - for(int i=0; i a[j+1]){ - int temp=a[j]; - a[j]=a[j+1]; - a[j+1]=temp; - } - } - } -}// end diff --git a/codes/zhangshaopu/9785926.java b/codes/zhangshaopu/9785926.java deleted file mode 100644 index 10dbc6525b8c4427dda5055b3f3c224c68398d2c..0000000000000000000000000000000000000000 --- a/codes/zhangshaopu/9785926.java +++ /dev/null @@ -1,19 +0,0 @@ -/** - * 冒泡排序函数 - * aa bb cc - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - // 你的代码，使无序数组 a 变得有序 - for(int i = 0 ; i < n - 1 ; i++){ - for(int j = 0 ; j < n - 1 - i ; j++){ - if(a[j] > a[j + 1]){ - int tmp = a[j]; - a[j] = a[j + 1]; - a[j + 1] = tmp; - } - } - } - -} //end diff --git a/codes/zhangwei001/15709943.java b/codes/zhangwei001/15709943.java deleted file mode 100644 index 7ec373aee12c8b4795c0d670e772620e90ee630e..0000000000000000000000000000000000000000 --- a/codes/zhangwei001/15709943.java +++ /dev/null @@ -1,18 +0,0 @@ -/** - * 冒泡排序函数 - * 通过对相邻的元素进行两两比较，顺序相反则进行交换，每一轮比较会将当前未排序部分的最大值“冒泡”到未排序部分的末尾。 - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int[] a, int n) { - for (int i = 0; i < n - 1; i++) { // 外层循环控制所有轮数 - for (int j = 0; j < n - i - 1; j++) { // 内层循环控制每轮比较的次数 - if (a[j] > a[j + 1]) { // 如果前一个元素大于后一个元素，则交换它们 - // 交换 a[j] 和 a[j+1] - int temp = a[j]; - a[j] = a[j + 1]; - a[j + 1] = temp; - } - } - } -} // end diff --git a/codes/zhangxiao123/15858470.java b/codes/zhangxiao123/15858470.java deleted file mode 100644 index ae82e695cbfd360050241c3f1f592658c8c1d4e7..0000000000000000000000000000000000000000 --- a/codes/zhangxiao123/15858470.java +++ /dev/null @@ -1,35 +0,0 @@ -/** - - * 冒泡排序函数 - - * aa bb cc - - * @param a 待排序的数组 - - * @param n 待排序的数组长度 - - */ - -public static void bubbleSort(int [] a, int n){ - - for(int i = 0; i < n-1 ; i++){ - - for (int j = 0;j < n-1-i;j++){ - - if(a[j] > a[j+1]){ - - int temp = a[j]; - - a[j] = a[j+1]; - - a[j+1] = temp; - - } - - } - - } - - - -} //end diff --git a/codes/zhangxiaoQ/15509138.java b/codes/zhangxiaoQ/15509138.java deleted file mode 100644 index 2c24eacc43419cb4d667adb3abf561f7fc0b12b5..0000000000000000000000000000000000000000 --- a/codes/zhangxiaoQ/15509138.java +++ /dev/null @@ -1,18 +0,0 @@ -/** - * 冒泡排序函数 - * aa bb cc - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - // 你的代码，使无序数组 a 变得有序 - for (int i=0 ; ia[j+1]) { - int temp=a[j]; - a[j]=a[j+1]; - a[j+1]=temp; - } - } - } -} //end diff --git a/codes/zhangyuyun/18461684.java b/codes/zhangyuyun/18461684.java deleted file mode 100644 index 49231deef70f84b55f893a3f0ae7261bfdacc9e8..0000000000000000000000000000000000000000 --- a/codes/zhangyuyun/18461684.java +++ /dev/null @@ -1,17 +0,0 @@ -/** - * 冒泡排序函数 - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int[] a, int n) { - for (int i = 0; i < n - 1; i++) { // 外层循环控制排序轮数 - for (int j = 0; j < n - 1 - i; j++) { // 内层循环控制每轮比较次数 - if (a[j] > a[j + 1]) { // 如果前一个元素大于后一个元素，则交换 - int temp = a[j]; - a[j] = a[j + 1]; - a[j + 1] = temp; - } - } - } -} - diff --git a/codes/zhao1218jk/.keep b/codes/zhao1218jk/.keep deleted file mode 100644 index e69de29bb2d1d6434b8b29ae775ad8c2e48c5391..0000000000000000000000000000000000000000 diff --git a/codes/zhao1218jk/10981574.java b/codes/zhao1218jk/10981574.java deleted file mode 100644 index 9eccfac593dd84bb4c285d230d4de6b8c72a1d65..0000000000000000000000000000000000000000 --- a/codes/zhao1218jk/10981574.java +++ /dev/null @@ -1,11 +0,0 @@ -public static void bubbleSort(int [] a, int n) { - for (int i=0 ; ia[j+1]) { - int temp=a[j]; - a[j]=a[j+1]; - a[j+1]=temp; - } - } - } -} diff --git a/codes/zhaokang/15619865.java b/codes/zhaokang/15619865.java deleted file mode 100644 index 854beb62bfcf4ead3549d682ffca7f1b9f32d947..0000000000000000000000000000000000000000 --- a/codes/zhaokang/15619865.java +++ /dev/null @@ -1,19 +0,0 @@ -/** - * 冒泡排序函数 - * aa bb cc - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - for(int i = 0; i < n-1 ; i++){ - for (int j = 0;j < n-1-i;j++){ - if(a[j] > a[j+1]){ - int temp = a[j]; - a[j] = a[j+1]; - a[j+1] = temp; - } - } - } - -} //end - diff --git a/codes/zhengxinyue/15833712.java b/codes/zhengxinyue/15833712.java deleted file mode 100644 index ae82e695cbfd360050241c3f1f592658c8c1d4e7..0000000000000000000000000000000000000000 --- a/codes/zhengxinyue/15833712.java +++ /dev/null @@ -1,35 +0,0 @@ -/** - - * 冒泡排序函数 - - * aa bb cc - - * @param a 待排序的数组 - - * @param n 待排序的数组长度 - - */ - -public static void bubbleSort(int [] a, int n){ - - for(int i = 0; i < n-1 ; i++){ - - for (int j = 0;j < n-1-i;j++){ - - if(a[j] > a[j+1]){ - - int temp = a[j]; - - a[j] = a[j+1]; - - a[j+1] = temp; - - } - - } - - } - - - -} //end diff --git a/codes/zhenhan0502/.keep b/codes/zhenhan0502/.keep deleted file mode 100644 index e69de29bb2d1d6434b8b29ae775ad8c2e48c5391..0000000000000000000000000000000000000000 diff --git a/codes/zhenhan0502/10987497.java b/codes/zhenhan0502/10987497.java deleted file mode 100644 index 9eccfac593dd84bb4c285d230d4de6b8c72a1d65..0000000000000000000000000000000000000000 --- a/codes/zhenhan0502/10987497.java +++ /dev/null @@ -1,11 +0,0 @@ -public static void bubbleSort(int [] a, int n) { - for (int i=0 ; ia[j+1]) { - int temp=a[j]; - a[j]=a[j+1]; - a[j+1]=temp; - } - } - } -} diff --git a/codes/zhenkuai/.keep b/codes/zhenkuai/.keep deleted file mode 100644 index e69de29bb2d1d6434b8b29ae775ad8c2e48c5391..0000000000000000000000000000000000000000 diff --git a/codes/zhenkuai/15817268.java b/codes/zhenkuai/15817268.java deleted file mode 100644 index 6426772fb479b07ed3be21ef1867921d1dbb194c..0000000000000000000000000000000000000000 --- a/codes/zhenkuai/15817268.java +++ /dev/null @@ -1,20 +0,0 @@ -/** - * 冒泡排序函数 - * aa bb cc - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - // 你的代码，使无序数组 a 变得有序 - for(int i = 0; i < n; i++) { - for(int j = 0; j < n - i - 1; j++) { - if(a[j] > a[j + 1]) { - int temp = a[j]; - a [j] = a[j + 1]; - a[j + 1] = temp; - } - } - } - - -} //end \ No newline at end of file diff --git a/codes/zhixinheyi/15775293.java b/codes/zhixinheyi/15775293.java deleted file mode 100644 index 020d5280923b094493116828ed932a0bd30ebabe..0000000000000000000000000000000000000000 --- a/codes/zhixinheyi/15775293.java +++ /dev/null @@ -1,18 +0,0 @@ -/** - * 冒泡排序函数 - * 通过多次遍历数组，比较相邻元素的大小，交换位置，实现排序 - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int[] a, int n) { - for (int i = 0; i < n - 1; i++) { - for (int j = 0; j < n - i - 1; j++) { - // 如果前一个元素大于后一个元素，则交换它们的位置 - if (a[j] > a[j + 1]) { - int temp = a[j]; - a[j] = a[j + 1]; - a[j + 1] = temp; - } - } - } -} //end diff --git a/codes/zhizhihua1/15588689.java b/codes/zhizhihua1/15588689.java deleted file mode 100644 index ae82e695cbfd360050241c3f1f592658c8c1d4e7..0000000000000000000000000000000000000000 --- a/codes/zhizhihua1/15588689.java +++ /dev/null @@ -1,35 +0,0 @@ -/** - - * 冒泡排序函数 - - * aa bb cc - - * @param a 待排序的数组 - - * @param n 待排序的数组长度 - - */ - -public static void bubbleSort(int [] a, int n){ - - for(int i = 0; i < n-1 ; i++){ - - for (int j = 0;j < n-1-i;j++){ - - if(a[j] > a[j+1]){ - - int temp = a[j]; - - a[j] = a[j+1]; - - a[j+1] = temp; - - } - - } - - } - - - -} //end diff --git a/codes/zhizhixia/15563504.java b/codes/zhizhixia/15563504.java deleted file mode 100644 index ae82e695cbfd360050241c3f1f592658c8c1d4e7..0000000000000000000000000000000000000000 --- a/codes/zhizhixia/15563504.java +++ /dev/null @@ -1,35 +0,0 @@ -/** - - * 冒泡排序函数 - - * aa bb cc - - * @param a 待排序的数组 - - * @param n 待排序的数组长度 - - */ - -public static void bubbleSort(int [] a, int n){ - - for(int i = 0; i < n-1 ; i++){ - - for (int j = 0;j < n-1-i;j++){ - - if(a[j] > a[j+1]){ - - int temp = a[j]; - - a[j] = a[j+1]; - - a[j+1] = temp; - - } - - } - - } - - - -} //end diff --git a/codes/zhizi123/15635289.java b/codes/zhizi123/15635289.java deleted file mode 100644 index 20575dc4ccc75a5bf6af9ea4614fcfa2a84fdeaf..0000000000000000000000000000000000000000 --- a/codes/zhizi123/15635289.java +++ /dev/null @@ -1,19 +0,0 @@ -/** - * 冒泡排序函数 - * aa bb cc - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - // 你的代码，使无序数组 a 变得有序 - for (int i = 0; i < n - 1; i++) { - for (int j = 0; j < n - i - 1; j++) { - if (a[j] > a[j + 1]) { - // 交换元素 - int temp = a[j]; - a[j] = a[j + 1]; - a[j + 1] = temp; - } - } - } -} //end diff --git a/codes/zhonggui/11896235.java b/codes/zhonggui/11896235.java deleted file mode 100644 index 5c5e689d83ba966af24dea37845e9ddafbd6460e..0000000000000000000000000000000000000000 --- a/codes/zhonggui/11896235.java +++ /dev/null @@ -1,20 +0,0 @@ - /** - * 冒泡排序函数 - * aa bb cc - * - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ - public static void bubbleSort(int[] a, int n) { - // 你的代码，使无序数组 a 变得有序 - for (int i = 0; i < n - 1; i++) { - for (int j = 0; j < n - i - 1; j++) { - if (a[j] > a[j + 1]) { - int temp = a[j]; - a[j] = a[j + 1]; - a[j + 1] = temp; - } - } - } - - } diff --git a/codes/zhongyaya/15846137.java b/codes/zhongyaya/15846137.java deleted file mode 100644 index 987377810b5beca8eb4bf5eafeee5db45e234a87..0000000000000000000000000000000000000000 --- a/codes/zhongyaya/15846137.java +++ /dev/null @@ -1,20 +0,0 @@ -/** - * 冒泡排序函数 - * aa bb cc - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - // 你的代码，使无序数组 a 变得有序 - for(int i = 0; i < n; i++) { - for(int liuy = 0; liuy < n - i - 1; liuy++) { - if(a[liuy] > a[liuy + 1]) { - int temp = a[liuy]; - a [liuy] = a[liuy + 1]; - a[liuy + 1] = temp; - } - } - } - - -} //end,liuy diff --git a/codes/zhoucheng/11464584.java b/codes/zhoucheng/11464584.java deleted file mode 100644 index cacd12f1e4e4360dd1ffa22f3741e376110bcde4..0000000000000000000000000000000000000000 --- a/codes/zhoucheng/11464584.java +++ /dev/null @@ -1,18 +0,0 @@ -/** - * 冒泡排序函数 - * aa bb cc - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - // 你的代码，使无序数组 a 变得有序 - for(int i=0;ia[j+1]){ - a[j] = a[j]+a[j+1]; - a[j+1] = a[j]-a[j+1]; - a[j] = a[j]-a[j+1]; - } - } - } -} //end \ No newline at end of file diff --git a/codes/zhouxuan01/.keep b/codes/zhouxuan01/.keep deleted file mode 100644 index e69de29bb2d1d6434b8b29ae775ad8c2e48c5391..0000000000000000000000000000000000000000 diff --git a/codes/zhouxuan01/15845799.java b/codes/zhouxuan01/15845799.java deleted file mode 100644 index 6426772fb479b07ed3be21ef1867921d1dbb194c..0000000000000000000000000000000000000000 --- a/codes/zhouxuan01/15845799.java +++ /dev/null @@ -1,20 +0,0 @@ -/** - * 冒泡排序函数 - * aa bb cc - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - // 你的代码，使无序数组 a 变得有序 - for(int i = 0; i < n; i++) { - for(int j = 0; j < n - i - 1; j++) { - if(a[j] > a[j + 1]) { - int temp = a[j]; - a [j] = a[j + 1]; - a[j + 1] = temp; - } - } - } - - -} //end \ No newline at end of file diff --git a/codes/zhouyi/15778243.java b/codes/zhouyi/15778243.java deleted file mode 100644 index ac23b3d579db1c61073474cceecdb56d32e74a09..0000000000000000000000000000000000000000 --- a/codes/zhouyi/15778243.java +++ /dev/null @@ -1,18 +0,0 @@ -/** - * 冒泡排序函数 - * 通过相邻元素之间的比较和交换，将无序数组变为有序数组 - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - for (int i = 0; i < n - 1; i++) { - for (int j = 0; j < n - i - 1; j++) { - if (a[j] > a[j + 1]) { - // 交换相邻元素 - int temp = a[j]; - a[j] = a[j + 1]; - a[j + 1] = temp; - } - } - } -} //end diff --git a/codes/zhuweiZy/.keep b/codes/zhuweiZy/.keep deleted file mode 100644 index e69de29bb2d1d6434b8b29ae775ad8c2e48c5391..0000000000000000000000000000000000000000 diff --git a/codes/zhuweiZy/15846061.java b/codes/zhuweiZy/15846061.java deleted file mode 100644 index 6e9861fa3ec6d5a2553cdccd1bb1e977430c671b..0000000000000000000000000000000000000000 --- a/codes/zhuweiZy/15846061.java +++ /dev/null @@ -1,19 +0,0 @@ -/** - * 冒泡排序函数 - * aa bb cc - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - // 你的代码，使无序数组 a 变得有序 - for (int i = 0; i < n - 1; i++) { - for (int j = 0; j < n - i - 1; j++) { - if (a[j] > a[j + 1]) { - - int temp = a[j]; - a[j] = a[j + 1]; - a[j + 1] = temp; - } - } - } -} //end \ No newline at end of file diff --git a/codes/zhw_tt/16576195.java b/codes/zhw_tt/16576195.java deleted file mode 100644 index 605f3b0683c6ddf2e2e14d5bfcbeea1d085083c0..0000000000000000000000000000000000000000 --- a/codes/zhw_tt/16576195.java +++ /dev/null @@ -1,18 +0,0 @@ -/** - * 冒泡排序函数 - * aa bb cc - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - // 你的代码，使无序数组 a 变得有序 - for (int i = 0; i < n; i++) { - for (int j = i + 1; j < n; j++) { - if (a[i] > a[j]) { - int temp = a[j]; - a[j] = a[i]; - a[i] = temp; - } - } - } -} //end diff --git a/codes/zihao2003/15810758.java b/codes/zihao2003/15810758.java deleted file mode 100644 index 166dea5db31166b381f11f50cf27b5f36311847d..0000000000000000000000000000000000000000 --- a/codes/zihao2003/15810758.java +++ /dev/null @@ -1,19 +0,0 @@ -/** - * 冒泡排序函数 - * 该函数通过冒泡排序算法对数组进行排序 - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int[] a, int n) { - for (int i = 0; i < n - 1; i++) { // 外层循环控制比较轮数 - for (int j = 0; j < n - 1 - i; j++) { // 内层循环控制每轮的比较次数 - // 如果前一个元素大于后一个元素，则交换它们的位置 - if (a[j] > a[j + 1]) { - // 交换元素 - int temp = a[j]; - a[j] = a[j + 1]; - a[j + 1] = temp; - } - } - } -} //end diff --git a/codes/zk_cxz/15621975.java b/codes/zk_cxz/15621975.java deleted file mode 100644 index 185aaaa96201d667b365d65de4688434899d66f2..0000000000000000000000000000000000000000 --- a/codes/zk_cxz/15621975.java +++ /dev/null @@ -1,27 +0,0 @@ -/** - * 冒泡排序函数 - * 遍历数组，比较相邻元素，如果顺序错误则交换它们，直到没有元素需要交换，数组排序完成。 - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - for (int i = 0; i < n - 1; i++) { - // 设置一个标志位，表示这一趟是否有交换 - boolean swapped = false; - for (int j = 0; j < n - i - 1; j++) { - // 如果当前元素大于下一个元素，则交换它们 - if (a[j] > a[j + 1]) { - // 交换 a[j] 和 a[j+1] - int temp = a[j]; - a[j] = a[j + 1]; - a[j + 1] = temp; - // 如果有交换发生，则将标志位设为 true - swapped = true; - } - } - // 如果这一趟没有发生交换，说明数组已经有序，直接退出循环 - if (!swapped) { - break; - } - } -} //end diff --git a/codes/zl940825/.keep b/codes/zl940825/.keep deleted file mode 100644 index e69de29bb2d1d6434b8b29ae775ad8c2e48c5391..0000000000000000000000000000000000000000 diff --git a/codes/zl940825/10979064.java b/codes/zl940825/10979064.java deleted file mode 100644 index 9eccfac593dd84bb4c285d230d4de6b8c72a1d65..0000000000000000000000000000000000000000 --- a/codes/zl940825/10979064.java +++ /dev/null @@ -1,11 +0,0 @@ -public static void bubbleSort(int [] a, int n) { - for (int i=0 ; ia[j+1]) { - int temp=a[j]; - a[j]=a[j+1]; - a[j+1]=temp; - } - } - } -} diff --git a/codes/zl954208/.keep b/codes/zl954208/.keep deleted file mode 100644 index e69de29bb2d1d6434b8b29ae775ad8c2e48c5391..0000000000000000000000000000000000000000 diff --git a/codes/zl954208/10981200.java b/codes/zl954208/10981200.java deleted file mode 100644 index 9eccfac593dd84bb4c285d230d4de6b8c72a1d65..0000000000000000000000000000000000000000 --- a/codes/zl954208/10981200.java +++ /dev/null @@ -1,11 +0,0 @@ -public static void bubbleSort(int [] a, int n) { - for (int i=0 ; ia[j+1]) { - int temp=a[j]; - a[j]=a[j+1]; - a[j+1]=temp; - } - } - } -} diff --git a/codes/zmq11111/15512070.java b/codes/zmq11111/15512070.java deleted file mode 100644 index 1a2516ab894c9b768a9595041b5dc91bed1fbb41..0000000000000000000000000000000000000000 --- a/codes/zmq11111/15512070.java +++ /dev/null @@ -1,22 +0,0 @@ -/** - * 冒泡排序函数 - * 冒泡排序的基本原理是通过相邻元素之间的比较和交换，使得较大的元素逐渐从底部浮出到顶部，从而实现排序。 - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int[] a, int n) { - // 外层循环控制比较轮数 - for (int i = 0; i < n - 1; i++) { - // 内层循环进行相邻元素的比较和交换 - for (int j = 0; j < n - 1 - i; j++) { - // 如果前面的元素大于后面的元素，则交换它们 - if (a[j] > a[j + 1]) { - // 使用临时变量进行交换 - int temp = a[j]; - a[j] = a[j + 1]; - a[j + 1] = temp; - } - } - } -} //end - diff --git a/codes/zn18829358170/15861141.java b/codes/zn18829358170/15861141.java deleted file mode 100644 index 54c5f3869cd16ee9e7c2b77895a39fae63f05dbc..0000000000000000000000000000000000000000 --- a/codes/zn18829358170/15861141.java +++ /dev/null @@ -1,20 +0,0 @@ -/** - * 冒泡排序函数 - * aa bb cc - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - // 你的代码，使无序数组 a 变得有序 - for(int i = 0; i < n; i++) { - for(int liuy = 0; liuy < n - i - 1; liuy++) { - if(a[liuy] > a[liuy + 1]) { - int temp = a[liuy]; - a [liuy] = a[liuy + 1]; - a[liuy + 1] = temp; - } - } - } - - -} //end,liuy \ No newline at end of file diff --git a/codes/znnzmm/11212509.java b/codes/znnzmm/11212509.java deleted file mode 100644 index 272a12fc81d3dd0e857bba9ae001c15818fb7123..0000000000000000000000000000000000000000 --- a/codes/znnzmm/11212509.java +++ /dev/null @@ -1,18 +0,0 @@ - /** - * 冒泡排序函数 - * aa bb cc - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ - public static void bubbleSort(int [] arr, int n){ - // 你的代码，使无序数组 a 变得有序 - for (int i = 0; i < n; i++) { - for (int j = (i + 1); j < n; j++) { - if (arr[i] > arr[j]) { - int temp = arr[i]; - arr[i] = arr[j]; - arr[j] = temp; - } - } - } - } //end \ No newline at end of file diff --git a/codes/zouyu5521/11464070.java b/codes/zouyu5521/11464070.java deleted file mode 100644 index a833d8d31b2581029ab106b60f560dd2c73ff238..0000000000000000000000000000000000000000 --- a/codes/zouyu5521/11464070.java +++ /dev/null @@ -1,24 +0,0 @@ -/** - * 冒泡排序函数 - * aa bb cc - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - // 你的代码，使无序数组 a 变得有序 - for(int j=0;ja[i+1]) - { - temp=a[i]; - a[i]=a[i+1]; - a[i+1]=temp; - } - } - } - //System.out.println(a); - -} //end \ No newline at end of file diff --git a/codes/zrccxx/10850939.java b/codes/zrccxx/10850939.java deleted file mode 100644 index 0006df95feb4980af9f365872e147e284d1a3cfe..0000000000000000000000000000000000000000 --- a/codes/zrccxx/10850939.java +++ /dev/null @@ -1,12 +0,0 @@ -public static void bubbleSort(int [] a, int n) { - for (int i=0 ; ia[j+1]) { - int temp=a[j]; - a[j]=a[j+1]; - a[j+1]=temp; - } - } - } - -} diff --git a/codes/zrzrzr/15805335.java b/codes/zrzrzr/15805335.java deleted file mode 100644 index ce4123f36198ecb034f9ba60dd9025622afaf314..0000000000000000000000000000000000000000 --- a/codes/zrzrzr/15805335.java +++ /dev/null @@ -1,18 +0,0 @@ -/** - * 冒泡排序函数 - * 通过相邻元素两两比较和交换，使得每一轮过后最大（或最小）的元素被交换到序列末尾 - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - for (int i = 0; i < n - 1; i++) { // 外层循环控制排序的轮数 - for (int j = 0; j < n - 1 - i; j++) { // 内层循环控制每轮的比较次数 - if (a[j] > a[j + 1]) { // 如果前一个元素大于后一个元素，则交换它们 - // 交换 a[j] 和 a[j+1] - int temp = a[j]; - a[j] = a[j + 1]; - a[j + 1] = temp; - } - } - } -} //end diff --git a/codes/ztpmasters/.keep b/codes/ztpmasters/.keep deleted file mode 100644 index e69de29bb2d1d6434b8b29ae775ad8c2e48c5391..0000000000000000000000000000000000000000 diff --git a/codes/ztpmasters/15846690.java b/codes/ztpmasters/15846690.java deleted file mode 100644 index 6e9861fa3ec6d5a2553cdccd1bb1e977430c671b..0000000000000000000000000000000000000000 --- a/codes/ztpmasters/15846690.java +++ /dev/null @@ -1,19 +0,0 @@ -/** - * 冒泡排序函数 - * aa bb cc - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - // 你的代码，使无序数组 a 变得有序 - for (int i = 0; i < n - 1; i++) { - for (int j = 0; j < n - i - 1; j++) { - if (a[j] > a[j + 1]) { - - int temp = a[j]; - a[j] = a[j + 1]; - a[j + 1] = temp; - } - } - } -} //end \ No newline at end of file diff --git a/codes/zu15047422887/.keep b/codes/zu15047422887/.keep deleted file mode 100644 index e69de29bb2d1d6434b8b29ae775ad8c2e48c5391..0000000000000000000000000000000000000000 diff --git a/codes/zu15047422887/15607358.java b/codes/zu15047422887/15607358.java deleted file mode 100644 index f85a1f87226364dae1535b4ccc25ce57409e4bed..0000000000000000000000000000000000000000 --- a/codes/zu15047422887/15607358.java +++ /dev/null @@ -1,18 +0,0 @@ -/** - * 冒泡排序函数 - * - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int[] a, int n) { - for (int i = 0; i < n - 1; i++) { - for (int j = 0; j < n - 1 - i; j++) { - if (a[j] > a[j + 1]) { - // 交换相邻两个元素的位置 - int temp = a[j]; - a[j] = a[j + 1]; - a[j + 1] = temp; - } - } - } -} diff --git a/codes/zu15047422887/15607367.java b/codes/zu15047422887/15607367.java deleted file mode 100644 index f85a1f87226364dae1535b4ccc25ce57409e4bed..0000000000000000000000000000000000000000 --- a/codes/zu15047422887/15607367.java +++ /dev/null @@ -1,18 +0,0 @@ -/** - * 冒泡排序函数 - * - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int[] a, int n) { - for (int i = 0; i < n - 1; i++) { - for (int j = 0; j < n - 1 - i; j++) { - if (a[j] > a[j + 1]) { - // 交换相邻两个元素的位置 - int temp = a[j]; - a[j] = a[j + 1]; - a[j + 1] = temp; - } - } - } -} diff --git a/codes/zu15147473922/.keep b/codes/zu15147473922/.keep deleted file mode 100644 index e69de29bb2d1d6434b8b29ae775ad8c2e48c5391..0000000000000000000000000000000000000000 diff --git a/codes/zu15147473922/15837017.java b/codes/zu15147473922/15837017.java deleted file mode 100644 index c9d626178321fd70037b32ea8d4b3a14df492171..0000000000000000000000000000000000000000 --- a/codes/zu15147473922/15837017.java +++ /dev/null @@ -1,18 +0,0 @@ -/** - * 冒泡排序函数 - * - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int[] a, int n) { - for (int i = 0; i < n - 1; i++) { - for (int j = 0; j < n - 1 - i; j++) { - if (a[j] > a[j + 1]) { - // 交换相邻两个元素的位置 - int temp = a[j]; - a[j] = a[j + 1]; - a[j + 1] = temp; - } - } - } -} diff --git a/codes/zu15147473922/15837089.java b/codes/zu15147473922/15837089.java deleted file mode 100644 index f85a1f87226364dae1535b4ccc25ce57409e4bed..0000000000000000000000000000000000000000 --- a/codes/zu15147473922/15837089.java +++ /dev/null @@ -1,18 +0,0 @@ -/** - * 冒泡排序函数 - * - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int[] a, int n) { - for (int i = 0; i < n - 1; i++) { - for (int j = 0; j < n - 1 - i; j++) { - if (a[j] > a[j + 1]) { - // 交换相邻两个元素的位置 - int temp = a[j]; - a[j] = a[j + 1]; - a[j + 1] = temp; - } - } - } -} diff --git a/codes/zu15147473922/15837113.java b/codes/zu15147473922/15837113.java deleted file mode 100644 index f85a1f87226364dae1535b4ccc25ce57409e4bed..0000000000000000000000000000000000000000 --- a/codes/zu15147473922/15837113.java +++ /dev/null @@ -1,18 +0,0 @@ -/** - * 冒泡排序函数 - * - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int[] a, int n) { - for (int i = 0; i < n - 1; i++) { - for (int j = 0; j < n - 1 - i; j++) { - if (a[j] > a[j + 1]) { - // 交换相邻两个元素的位置 - int temp = a[j]; - a[j] = a[j + 1]; - a[j + 1] = temp; - } - } - } -} diff --git a/codes/zuileya/15775295.java b/codes/zuileya/15775295.java deleted file mode 100644 index 987377810b5beca8eb4bf5eafeee5db45e234a87..0000000000000000000000000000000000000000 --- a/codes/zuileya/15775295.java +++ /dev/null @@ -1,20 +0,0 @@ -/** - * 冒泡排序函数 - * aa bb cc - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - // 你的代码，使无序数组 a 变得有序 - for(int i = 0; i < n; i++) { - for(int liuy = 0; liuy < n - i - 1; liuy++) { - if(a[liuy] > a[liuy + 1]) { - int temp = a[liuy]; - a [liuy] = a[liuy + 1]; - a[liuy + 1] = temp; - } - } - } - - -} //end,liuy diff --git a/codes/zuobao/.keep b/codes/zuobao/.keep deleted file mode 100644 index e69de29bb2d1d6434b8b29ae775ad8c2e48c5391..0000000000000000000000000000000000000000 diff --git a/codes/zuobao/15858174.java b/codes/zuobao/15858174.java deleted file mode 100644 index 6426772fb479b07ed3be21ef1867921d1dbb194c..0000000000000000000000000000000000000000 --- a/codes/zuobao/15858174.java +++ /dev/null @@ -1,20 +0,0 @@ -/** - * 冒泡排序函数 - * aa bb cc - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - // 你的代码，使无序数组 a 变得有序 - for(int i = 0; i < n; i++) { - for(int j = 0; j < n - i - 1; j++) { - if(a[j] > a[j + 1]) { - int temp = a[j]; - a [j] = a[j + 1]; - a[j + 1] = temp; - } - } - } - - -} //end \ No newline at end of file diff --git a/codes/zuokem6/11118132.java b/codes/zuokem6/11118132.java deleted file mode 100644 index 9e7534d4b41cf071c848fa4d5c08c6519526b6e3..0000000000000000000000000000000000000000 --- a/codes/zuokem6/11118132.java +++ /dev/null @@ -1,18 +0,0 @@ -/** - * 冒泡 排序 函数 - * aa bb cc - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - // 你的代码，使无序数组 a 变得有序 - for (int i = 0; i < n; i++) { - for (int j = 0; j < i; j++) { - if (a[i] < a[j]) { - int t = a[i]; - a[i] = a[j]; - a[j] = t; - } - } - } -}//end \ No newline at end of file diff --git a/codes/zuotian/15659839.java b/codes/zuotian/15659839.java deleted file mode 100644 index cfd796006fa426da9f8d48cb8ecd36cc7c703c54..0000000000000000000000000000000000000000 --- a/codes/zuotian/15659839.java +++ /dev/null @@ -1,18 +0,0 @@ -/** - * 冒泡排序函数 - * 对数组进行冒泡排序，使数组元素按照从小到大的顺序排列 - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - for (int i = 0; i < n - 1; i++) { - for (int j = 0; j < n - 1 - i; j++) { - // 如果前一个元素大于后一个元素，则交换它们的位置 - if (a[j] > a[j + 1]) { - int temp = a[j]; - a[j] = a[j + 1]; - a[j + 1] = temp; - } - } - } -} //end diff --git a/codes/zwjdashabi1001/15895572.java b/codes/zwjdashabi1001/15895572.java deleted file mode 100644 index 8bd66d28d41e32efec1c5023f92e99edb9b1359e..0000000000000000000000000000000000000000 --- a/codes/zwjdashabi1001/15895572.java +++ /dev/null @@ -1,12 +0,0 @@ -public static void bubbleSort(int [] a, int n){ - for(int i=0;ia[j+1]) - {int temp=a[j]; - a[j+1]=a[j]; - a[j]=temp;} - } - } - -} - diff --git a/codes/zwl111/15779557.java b/codes/zwl111/15779557.java deleted file mode 100644 index 46da388ec87de9d26aecb462b88a19ce4a728da9..0000000000000000000000000000000000000000 --- a/codes/zwl111/15779557.java +++ /dev/null @@ -1,18 +0,0 @@ -/** - * 冒泡排序函数 - * 通过对相邻元素的比较和交换，将较大的元素逐渐“浮”到数组的末尾，从而完成排序 - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int[] a, int n) { - for (int i = 0; i < n - 1; i++) { // 外层循环控制排序趟数 - for (int j = 0; j < n - i - 1; j++) { // 内层循环控制每趟排序多少次 - // 如果前一个元素大于后一个元素，则交换它们的位置 - if (a[j] > a[j + 1]) { - int temp = a[j]; - a[j] = a[j + 1]; - a[j + 1] = temp; - } - } - } -} // end diff --git a/codes/zwl111/15779562.java b/codes/zwl111/15779562.java deleted file mode 100644 index 46da388ec87de9d26aecb462b88a19ce4a728da9..0000000000000000000000000000000000000000 --- a/codes/zwl111/15779562.java +++ /dev/null @@ -1,18 +0,0 @@ -/** - * 冒泡排序函数 - * 通过对相邻元素的比较和交换，将较大的元素逐渐“浮”到数组的末尾，从而完成排序 - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int[] a, int n) { - for (int i = 0; i < n - 1; i++) { // 外层循环控制排序趟数 - for (int j = 0; j < n - i - 1; j++) { // 内层循环控制每趟排序多少次 - // 如果前一个元素大于后一个元素，则交换它们的位置 - if (a[j] > a[j + 1]) { - int temp = a[j]; - a[j] = a[j + 1]; - a[j + 1] = temp; - } - } - } -} // end diff --git a/codes/zxc123/15513151.java b/codes/zxc123/15513151.java deleted file mode 100644 index a4247277a6725af11de1315df71a8456084a2cf5..0000000000000000000000000000000000000000 --- a/codes/zxc123/15513151.java +++ /dev/null @@ -1,22 +0,0 @@ -/** - * 冒泡排序函数 - * 该算法通过重复遍历待排序的数组，比较相邻元素并交换位置，直到数组有序。 - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int[] a, int n) { - // 外层循环控制遍历次数 - for (int i = 0; i < n - 1; i++) { - // 内层循环负责进行相邻元素的比较和交换 - for (int j = 0; j < n - i - 1; j++) { - // 如果当前元素大于后一个元素，则交换它们的位置 - if (a[j] > a[j + 1]) { - // 交换操作 - int temp = a[j]; - a[j] = a[j + 1]; - a[j + 1] = temp; - } - } - } - // 排序完成后，数组 a 将变得有序 -} diff --git a/codes/zxcvbaa225/.keep b/codes/zxcvbaa225/.keep deleted file mode 100644 index e69de29bb2d1d6434b8b29ae775ad8c2e48c5391..0000000000000000000000000000000000000000 diff --git a/codes/zxcvbaa225/15735743.java b/codes/zxcvbaa225/15735743.java deleted file mode 100644 index 6e9861fa3ec6d5a2553cdccd1bb1e977430c671b..0000000000000000000000000000000000000000 --- a/codes/zxcvbaa225/15735743.java +++ /dev/null @@ -1,19 +0,0 @@ -/** - * 冒泡排序函数 - * aa bb cc - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - // 你的代码，使无序数组 a 变得有序 - for (int i = 0; i < n - 1; i++) { - for (int j = 0; j < n - i - 1; j++) { - if (a[j] > a[j + 1]) { - - int temp = a[j]; - a[j] = a[j + 1]; - a[j + 1] = temp; - } - } - } -} //end \ No newline at end of file diff --git a/codes/zxd30022/10164256.java b/codes/zxd30022/10164256.java deleted file mode 100644 index b19d51369a53f34c6b892e36f4d1916ba2a84823..0000000000000000000000000000000000000000 --- a/codes/zxd30022/10164256.java +++ /dev/null @@ -1,19 +0,0 @@ -/** - * 冒泡排序函数 - * aa bb cc - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - // 你的代码，使无序数组 a 变得有序 - for (int i=0;ia[j+1]) { - tmp = a[j+1]; - a[j+1] = a[j]; - a[j] = tmp; - } - } - } -} //end diff --git a/codes/zxf1795065101/15563222.java b/codes/zxf1795065101/15563222.java deleted file mode 100644 index ae82e695cbfd360050241c3f1f592658c8c1d4e7..0000000000000000000000000000000000000000 --- a/codes/zxf1795065101/15563222.java +++ /dev/null @@ -1,35 +0,0 @@ -/** - - * 冒泡排序函数 - - * aa bb cc - - * @param a 待排序的数组 - - * @param n 待排序的数组长度 - - */ - -public static void bubbleSort(int [] a, int n){ - - for(int i = 0; i < n-1 ; i++){ - - for (int j = 0;j < n-1-i;j++){ - - if(a[j] > a[j+1]){ - - int temp = a[j]; - - a[j] = a[j+1]; - - a[j+1] = temp; - - } - - } - - } - - - -} //end diff --git a/codes/zxg_god/11128523.java b/codes/zxg_god/11128523.java deleted file mode 100644 index 1c8889947f924214c71a3c3f202500b4780dc281..0000000000000000000000000000000000000000 --- a/codes/zxg_god/11128523.java +++ /dev/null @@ -1,11 +0,0 @@ -public static void bubbleSort(int [] a,int n){ - for(int i = 0; i < n-1 ; i++){ - for (int j = 0;j < n-1-i;j++){ - if(a[j] > a[j+1]){ - int temp = a[j]; - a[j] = a[j+1]; - a[j+1] = temp; - } - } - } -} \ No newline at end of file diff --git a/codes/zxj158300/15866865.java b/codes/zxj158300/15866865.java deleted file mode 100644 index 24f513b3219ac31ac3dcffe774647aa7bfdac254..0000000000000000000000000000000000000000 --- a/codes/zxj158300/15866865.java +++ /dev/null @@ -1,11 +0,0 @@ -public static void bubbleSort(int [] a, int n){ - for (int i = 0; i < n - 1; i++) { - for (int j = 0; j < n - 1 - i; j++) { - if (a[j] > a[j + 1]) { - int temp = a[j]; - a[j] = a[j + 1]; - a[j + 1] = temp; - } - } - } -} diff --git a/codes/zxmyigeren/15488956.java b/codes/zxmyigeren/15488956.java deleted file mode 100644 index bbd832c4e11df95cc489a13ebf6b07ec8f0c499f..0000000000000000000000000000000000000000 --- a/codes/zxmyigeren/15488956.java +++ /dev/null @@ -1,33 +0,0 @@ -/** - * 冒泡排序函数 - * 通过重复走访要排序的数列，一次比较两个元素， - * 如果他们的顺序错误就把他们交换过来。 - * 走访数列的工作是重复地进行直到没有再需要交换， - * 也就是说该数列已经排序完成。 - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int[] a, int n) { - if (n == 0 || n == 1) { - return; // 如果数组长度为0或1，无需排序直接返回 - } - - boolean swapped; - for (int i = 0; i < n - 1; i++) { - swapped = false; // 每次遍历前假设没有元素需要交换 - for (int j = 0; j < n - i - 1; j++) { - if (a[j] > a[j + 1]) { - // 如果前一个元素比后一个元素大，交换它们 - int temp = a[j]; - a[j] = a[j + 1]; - a[j + 1] = temp; - swapped = true; // 发生了交换 - } - } - // 如果一次遍历中没有交换发生，说明数组已经有序，可以结束排序 - if (!swapped) { - break; - } - } -} // end bubbleSort - diff --git a/codes/zxmyigeren/15539430.java b/codes/zxmyigeren/15539430.java deleted file mode 100644 index bbd832c4e11df95cc489a13ebf6b07ec8f0c499f..0000000000000000000000000000000000000000 --- a/codes/zxmyigeren/15539430.java +++ /dev/null @@ -1,33 +0,0 @@ -/** - * 冒泡排序函数 - * 通过重复走访要排序的数列，一次比较两个元素， - * 如果他们的顺序错误就把他们交换过来。 - * 走访数列的工作是重复地进行直到没有再需要交换， - * 也就是说该数列已经排序完成。 - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int[] a, int n) { - if (n == 0 || n == 1) { - return; // 如果数组长度为0或1，无需排序直接返回 - } - - boolean swapped; - for (int i = 0; i < n - 1; i++) { - swapped = false; // 每次遍历前假设没有元素需要交换 - for (int j = 0; j < n - i - 1; j++) { - if (a[j] > a[j + 1]) { - // 如果前一个元素比后一个元素大，交换它们 - int temp = a[j]; - a[j] = a[j + 1]; - a[j + 1] = temp; - swapped = true; // 发生了交换 - } - } - // 如果一次遍历中没有交换发生，说明数组已经有序，可以结束排序 - if (!swapped) { - break; - } - } -} // end bubbleSort - diff --git a/codes/zxntbj6/.keep b/codes/zxntbj6/.keep deleted file mode 100644 index e69de29bb2d1d6434b8b29ae775ad8c2e48c5391..0000000000000000000000000000000000000000 diff --git a/codes/zxntbj6/15846512.java b/codes/zxntbj6/15846512.java deleted file mode 100644 index 6e9861fa3ec6d5a2553cdccd1bb1e977430c671b..0000000000000000000000000000000000000000 --- a/codes/zxntbj6/15846512.java +++ /dev/null @@ -1,19 +0,0 @@ -/** - * 冒泡排序函数 - * aa bb cc - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - // 你的代码，使无序数组 a 变得有序 - for (int i = 0; i < n - 1; i++) { - for (int j = 0; j < n - i - 1; j++) { - if (a[j] > a[j + 1]) { - - int temp = a[j]; - a[j] = a[j + 1]; - a[j + 1] = temp; - } - } - } -} //end \ No newline at end of file diff --git a/codes/zxq777/15540332.java b/codes/zxq777/15540332.java deleted file mode 100644 index 20bd5f81769363dc0b35fb3104bcced71ab3f178..0000000000000000000000000000000000000000 --- a/codes/zxq777/15540332.java +++ /dev/null @@ -1,22 +0,0 @@ -/** - * 冒泡排序函数 - * 通过重复遍历要排序的数列，一次比较两个元素， - * 如果他们的顺序错误就把他们交换过来。 - * 遍历数列的工作是重复进行的，直到没有再需要交换的元素为止。 - * 该算法的时间复杂度为O(n^2)。 - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - for(int i = 0; i < n - 1; i++){ // 外层循环，控制遍历的次数 - for(int j = 0; j < n - 1 - i; j++){ // 内层循环，控制每次比较的元素数量 - if(a[j] > a[j + 1]){ // 如果前一个元素比后一个元素大 - // 交换两个元素的位置 - int temp = a[j]; - a[j] = a[j + 1]; - a[j + 1] = temp; - } - } - } -} //end - diff --git a/codes/zy2239106/14616675.java b/codes/zy2239106/14616675.java deleted file mode 100644 index 629658aad6981b30fa2a0033bf9c9bf3eb1db769..0000000000000000000000000000000000000000 --- a/codes/zy2239106/14616675.java +++ /dev/null @@ -1,18 +0,0 @@ -/** - * 冒泡排序函数 - * aa bb cc - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - // 你的代码，使无序数组 a 变得有序 - for (int i = 0; i < n - 1; i++) { - for (int j = 0; j < n - 1 - i; j++) { - if (a[j] > a[j + 1]) { - int temp = a[j]; - a[j] = a[j + 1]; - a[j + 1] = temp; - } - } - } -} //end diff --git a/codes/zycq13350636821/15859606.java b/codes/zycq13350636821/15859606.java deleted file mode 100644 index 271d2f1dfec9c226694fa24afe300e49f150ca51..0000000000000000000000000000000000000000 --- a/codes/zycq13350636821/15859606.java +++ /dev/null @@ -1,18 +0,0 @@ -/** - * 冒泡排序函数 - * 将数组a按照从小到大的顺序排序 - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int[] a, int n) { - for (int i = 0; i < n - 1; i++) { // 外层循环，决定冒泡的趟数 - for (int j = 0; j < n - 1 - i; j++) { // 内层循环，决定每趟比较的次数 - if (a[j] > a[j + 1]) { // 如果当前元素大于下一个元素，则交换它们的位置 - // 交换a[j]和a[j + 1] - int temp = a[j]; - a[j] = a[j + 1]; - a[j + 1] = temp; - } - } - } -} // end diff --git a/codes/zyx1373529784/.11255507.java.swp b/codes/zyx1373529784/.11255507.java.swp deleted file mode 100644 index 9b726027fddbfd97c3f47c01748240b20491682c..0000000000000000000000000000000000000000 Binary files a/codes/zyx1373529784/.11255507.java.swp and /dev/null differ diff --git a/codes/zyx1373529784/11255507.java b/codes/zyx1373529784/11255507.java deleted file mode 100644 index 64421e08ab5325ba6519b736693c153be1bfe018..0000000000000000000000000000000000000000 --- a/codes/zyx1373529784/11255507.java +++ /dev/null @@ -1,19 +0,0 @@ -/** - * 冒泡排序函数 - * aa bb cc - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - // 你的代码，使无序数组 a 变得有序 - int temp; - for (int j = 0; j < n - 1; n--) { - for (int i = 0; i < n - 1; i++) { - if (a[i] > a[i + 1]) { - temp = a[i + 1]; - a[i + 1] = a[i]; - a[i] = temp; - } - } - } -} //end diff --git a/codes/zyy022/15592411.java b/codes/zyy022/15592411.java deleted file mode 100644 index c2afaa2414da1853e4500b02c6de9068b64aeafe..0000000000000000000000000000000000000000 --- a/codes/zyy022/15592411.java +++ /dev/null @@ -1,18 +0,0 @@ -/** - * 冒泡排序函数 - * aa bb cc - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - for(int i = 0; i < n-1 ; i++){ - for (int j = 0;j < n-1-i;j++){ - if(a[j] > a[j+1]){ - int temp = a[j]; - a[j] = a[j+1]; - a[j+1] = temp; - } - } - } - -} //end diff --git a/codes/zzc666233/15861698.java b/codes/zzc666233/15861698.java deleted file mode 100644 index 54c5f3869cd16ee9e7c2b77895a39fae63f05dbc..0000000000000000000000000000000000000000 --- a/codes/zzc666233/15861698.java +++ /dev/null @@ -1,20 +0,0 @@ -/** - * 冒泡排序函数 - * aa bb cc - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - // 你的代码，使无序数组 a 变得有序 - for(int i = 0; i < n; i++) { - for(int liuy = 0; liuy < n - i - 1; liuy++) { - if(a[liuy] > a[liuy + 1]) { - int temp = a[liuy]; - a [liuy] = a[liuy + 1]; - a[liuy + 1] = temp; - } - } - } - - -} //end,liuy \ No newline at end of file diff --git a/codes/zzcaicai/15725032.java b/codes/zzcaicai/15725032.java deleted file mode 100644 index 7ce620c3e5da73497f3bd1c48010bf1366a3fe53..0000000000000000000000000000000000000000 --- a/codes/zzcaicai/15725032.java +++ /dev/null @@ -1,28 +0,0 @@ -/** - * 冒泡排序函数 - * 将无序数组通过冒泡排序算法变为有序数组 - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - for (int i = 0; i < n - 1; i++) { - // 设置一个标志位，用于优化算法，减少不必要的比较 - boolean swapped = false; - for (int j = 0; j < n - i - 1; j++) { - // 如果前一个元素比后一个元素大，则交换它们的位置 - if (a[j] > a[j + 1]) { - int temp = a[j]; - a[j] = a[j + 1]; - a[j + 1] = temp; - // 如果有元素交换，则标志位设为true - swapped = true; - } - } - // 如果没有元素交换，说明数组已经有序，可以提前结束排序 - if (!swapped) { - break; - } - } -} //end - - diff --git a/codes/zzdpop/11212991.java b/codes/zzdpop/11212991.java deleted file mode 100644 index 1c8889947f924214c71a3c3f202500b4780dc281..0000000000000000000000000000000000000000 --- a/codes/zzdpop/11212991.java +++ /dev/null @@ -1,11 +0,0 @@ -public static void bubbleSort(int [] a,int n){ - for(int i = 0; i < n-1 ; i++){ - for (int j = 0;j < n-1-i;j++){ - if(a[j] > a[j+1]){ - int temp = a[j]; - a[j] = a[j+1]; - a[j+1] = temp; - } - } - } -} \ No newline at end of file diff --git a/codes/zzmini/11076797.java b/codes/zzmini/11076797.java deleted file mode 100644 index b9bf7818d9ffdce1bf2bd0863a51890bffa3f951..0000000000000000000000000000000000000000 --- a/codes/zzmini/11076797.java +++ /dev/null @@ -1,11 +0,0 @@ -public static void bubbleSort(int [] a, int n) { - for (int i=0 ; ia[j+1]) { - int temp=a[j]; - a[j]=a[j+1]; - a[j+1]=temp; - } - } - } -} \ No newline at end of file diff --git a/codes/zzy2744726697/15860385.java b/codes/zzy2744726697/15860385.java deleted file mode 100644 index ae82e695cbfd360050241c3f1f592658c8c1d4e7..0000000000000000000000000000000000000000 --- a/codes/zzy2744726697/15860385.java +++ /dev/null @@ -1,35 +0,0 @@ -/** - - * 冒泡排序函数 - - * aa bb cc - - * @param a 待排序的数组 - - * @param n 待排序的数组长度 - - */ - -public static void bubbleSort(int [] a, int n){ - - for(int i = 0; i < n-1 ; i++){ - - for (int j = 0;j < n-1-i;j++){ - - if(a[j] > a[j+1]){ - - int temp = a[j]; - - a[j] = a[j+1]; - - a[j+1] = temp; - - } - - } - - } - - - -} //end diff --git a/l1017026323/15630469.java b/l1017026323/15630469.java deleted file mode 100644 index 987377810b5beca8eb4bf5eafeee5db45e234a87..0000000000000000000000000000000000000000 --- a/l1017026323/15630469.java +++ /dev/null @@ -1,20 +0,0 @@ -/** - * 冒泡排序函数 - * aa bb cc - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - // 你的代码，使无序数组 a 变得有序 - for(int i = 0; i < n; i++) { - for(int liuy = 0; liuy < n - i - 1; liuy++) { - if(a[liuy] > a[liuy + 1]) { - int temp = a[liuy]; - a [liuy] = a[liuy + 1]; - a[liuy + 1] = temp; - } - } - } - - -} //end,liuy diff --git a/qwer121234/15859995.java b/qwer121234/15859995.java deleted file mode 100644 index 54c5f3869cd16ee9e7c2b77895a39fae63f05dbc..0000000000000000000000000000000000000000 --- a/qwer121234/15859995.java +++ /dev/null @@ -1,20 +0,0 @@ -/** - * 冒泡排序函数 - * aa bb cc - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - // 你的代码，使无序数组 a 变得有序 - for(int i = 0; i < n; i++) { - for(int liuy = 0; liuy < n - i - 1; liuy++) { - if(a[liuy] > a[liuy + 1]) { - int temp = a[liuy]; - a [liuy] = a[liuy + 1]; - a[liuy + 1] = temp; - } - } - } - - -} //end,liuy \ No newline at end of file diff --git a/smcO0O/10708545.java b/smcO0O/10708545.java deleted file mode 100644 index c04f3701e502fec2a278b85d54d687a7e15dd7f9..0000000000000000000000000000000000000000 --- a/smcO0O/10708545.java +++ /dev/null @@ -1,12 +0,0 @@ -/** - * 冒泡排序函数 - * aa bb cc - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - // 你的代码，使无序数组 a 变得有序 - ... - ... - -} //end diff --git a/yimengzhiyan/16563760.java b/yimengzhiyan/16563760.java deleted file mode 100644 index 8527e1c6e49720f73cb92fa5ed1ee9ee1a2c56e1..0000000000000000000000000000000000000000 --- a/yimengzhiyan/16563760.java +++ /dev/null @@ -1,18 +0,0 @@ -/** - * 冒泡排序函数 - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n) { - for (int i = 0; i < n - 1; i++) { - for (int j = 0; j < n - 1 - i; j++) { - if (a[j] > a[j + 1]) { - // 交换 a[j] 和 a[j + 1] - int temp = a[j]; - a[j] = a[j + 1]; - a[j + 1] = temp; - } - } - } -} - diff --git a/zhouyi/15778243.java b/zhouyi/15778243.java deleted file mode 100644 index ac23b3d579db1c61073474cceecdb56d32e74a09..0000000000000000000000000000000000000000 --- a/zhouyi/15778243.java +++ /dev/null @@ -1,18 +0,0 @@ -/** - * 冒泡排序函数 - * 通过相邻元素之间的比较和交换，将无序数组变为有序数组 - * @param a 待排序的数组 - * @param n 待排序的数组长度 - */ -public static void bubbleSort(int [] a, int n){ - for (int i = 0; i < n - 1; i++) { - for (int j = 0; j < n - i - 1; j++) { - if (a[j] > a[j + 1]) { - // 交换相邻元素 - int temp = a[j]; - a[j] = a[j + 1]; - a[j + 1] = temp; - } - } - } -} //end