diff --git a/codes/FlyDinosaur/I9AM96.java b/codes/FlyDinosaur/I9AM96.java
new file mode 100644
index 0000000000000000000000000000000000000000..15b0d94aea453a037e0682b68424fe93cf302912
--- /dev/null
+++ b/codes/FlyDinosaur/I9AM96.java
@@ -0,0 +1,49 @@
+package top.flydinosaur.openAnolis.demo;
+
+import java.util.Scanner;
+
+public class DemoTest {
+
+    public static int[] generateArray(){
+        Scanner input = new Scanner(System.in);
+        System.out.print("请输入数组的元素个数：");
+        int length = input.nextInt(); //数组的元素个数
+        int arr[] = new int[length];
+        for (int i = 0; i < length; i++) {
+            System.out.print("请输入数组第" + (i+1) + "个元素:");
+            arr[i] = input.nextInt();
+        }
+        System.out.println("数组生成完成");
+        input.close();
+        return arr;
+    }
+
+    public static void printArray(int[] arr){
+        for (int i = 0; i < arr.length; i++) {
+            System.out.print(arr[i] + " ");
+        }
+        System.out.println();
+    }
+
+    public static int[] sort(int[] arr){
+        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]){
+                    int temp = arr[j];
+                    arr[j] = arr[j+1];
+                    arr[j+1] = temp;
+                }
+            }
+        }
+        return arr;
+    }
+    public static void main(String[] args) {
+        int[] array = generateArray();
+        System.out.println("原始数组为：");
+        printArray(array);
+        int[] sortedArray = sort(array);
+        System.out.println("排序后的数组为：");
+        printArray(sortedArray);
+
+    }
+}