diff --git a/01_Intellij_Java_universal_20240419/untitled/src/javaAssignment_20240520/function_02.java b/01_Intellij_Java_universal_20240419/untitled/src/javaAssignment_20240520/function_02.java
index 5c2a8dc..077ca90 100644
--- a/01_Intellij_Java_universal_20240419/untitled/src/javaAssignment_20240520/function_02.java
+++ b/01_Intellij_Java_universal_20240419/untitled/src/javaAssignment_20240520/function_02.java
@@ -139,7 +139,6 @@ public class function_02 {
      *   Return: int[]     需要排序的数组
      * */
     public void bubbleSort(int[] array){
-        // TODO 优化冒泡排序算法
         int n = array.length;
 
         // 冒泡排序
diff --git a/01_Intellij_Java_universal_20240419/untitled/src/javaAssignment_20240520/test.java b/01_Intellij_Java_universal_20240419/untitled/src/javaAssignment_20240520/test.java
index b8f1084..1680f79 100644
--- a/01_Intellij_Java_universal_20240419/untitled/src/javaAssignment_20240520/test.java
+++ b/01_Intellij_Java_universal_20240419/untitled/src/javaAssignment_20240520/test.java
@@ -40,7 +40,7 @@ public class test {
         *   3. 读取该文件中的数据并升序排序
         *
         *   class: function_02.java
-        */
+        *
 
         // 实例化第二个实验内容的对象
         function_02 f_2 = new function_02("file2.txt");
@@ -72,6 +72,6 @@ public class test {
         // 调用冒泡排序算法进行排序
         f_2.bubbleSort(array_copy);
 
-        /**/
+        */
     }
 }