diff --git a/18889160.java b/18889160.java
new file mode 100644
index 0000000000000000000000000000000000000000..eb0ffb31dd26eeb91f7c298b8cc8aa259eb4886b
--- /dev/null
+++ b/18889160.java
@@ -0,0 +1,18 @@
+/**
+ * 冒泡排序函数
+ * aa bb cc
+ * @param a 待排序的数组
+ * @param 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/userwanyong/18889160.java b/codes/userwanyong/18889160.java
new file mode 100644
index 0000000000000000000000000000000000000000..eb0ffb31dd26eeb91f7c298b8cc8aa259eb4886b
--- /dev/null
+++ b/codes/userwanyong/18889160.java
@@ -0,0 +1,18 @@
+/**
+ * 冒泡排序函数
+ * aa bb cc
+ * @param a 待排序的数组
+ * @param 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