diff --git a/codes/zzh13104928451/9622480.java b/codes/zzh13104928451/9622480.java
new file mode 100644
index 0000000000000000000000000000000000000000..0ddec1fb4b5a1634c518f82613bd0df4df030946
--- /dev/null
+++ b/codes/zzh13104928451/9622480.java
@@ -0,0 +1,20 @@
+/**
+ * 冒泡排序函数
+ * aa 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/zzh13104928451/ 9622480.java b/zzh13104928451/ 9622480.java
new file mode 100644
index 0000000000000000000000000000000000000000..48ff8db88330242b160f6d31d5238ea4e6e52383
--- /dev/null
+++ b/zzh13104928451/ 9622480.java	
@@ -0,0 +1,22 @@
+/**
+ * 冒泡排序函数
+ * aa 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
+