From 01761df7844213924607465eb729dbf184c7af55 Mon Sep 17 00:00:00 2001
From: sukangpunch <popora99@naver.com>
Date: Mon, 5 Jan 2026 12:58:48 +0900
Subject: [PATCH] =?UTF-8?q?[Week01]=20BOJ=5F2759:=20=EC=88=98=20=EC=A0=95?=
 =?UTF-8?q?=EB=A0=AC=ED=95=98=EA=B8=B0?=
MIME-Version: 1.0
Content-Type: text/plain; charset=UTF-8
Content-Transfer-Encoding: 8bit

---
 .../sukangpunch.java"                         | 61 +++++++++++++++++++
 1 file changed, 61 insertions(+)
 create mode 100644 "weekly/week01/BOJ_2750_\354\210\230 \354\240\225\353\240\254\355\225\230\352\270\260/sukangpunch.java"

diff --git "a/weekly/week01/BOJ_2750_\354\210\230 \354\240\225\353\240\254\355\225\230\352\270\260/sukangpunch.java" "b/weekly/week01/BOJ_2750_\354\210\230 \354\240\225\353\240\254\355\225\230\352\270\260/sukangpunch.java"
new file mode 100644
index 0000000..57a37ab
--- /dev/null
+++ "b/weekly/week01/BOJ_2750_\354\210\230 \354\240\225\353\240\254\355\225\230\352\270\260/sukangpunch.java"	
@@ -0,0 +1,61 @@
+package stduy.week01;
+
+import java.io.BufferedReader;
+import java.io.IOException;
+import java.io.InputStreamReader;
+
+// 수 정렬하기
+public class BOJ_2570 {
+
+    public static void main(String[] args) throws IOException {
+        BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
+        StringBuilder sb = new StringBuilder();
+
+        int N = Integer.parseInt(br.readLine());
+        int [] arr = new int[N];
+        for (int i = 0; i < N; i++) {
+            int num = Integer.parseInt(br.readLine());
+            arr[i] = num;
+        }
+
+//        selectionSort(arr, N);
+//        for(int i = 0; i < N; i++) {
+//            sb.append(arr[i]).append("\n");
+//        }
+
+        insertSort(arr, N);
+        for(int i = 0; i < N; i++) {
+            sb.append(arr[i]).append("\n");
+        }
+
+        System.out.println(sb);
+    }
+
+    private static void insertSort(int[] arr, int n) {
+        int j;
+        for (int i = 1; i < n; i++) {
+            int now = arr[i];
+            for(j = i-1; j >= 0 && arr[j] > now; j--) {
+                arr[j+1] = arr[j];
+            }
+            arr[j+1] = now;
+        }
+    }
+
+    private static void selectionSort(int[] arr, int n) {
+        int min;
+        for (int i = 0; i < n - 1; i++) {
+            min = i;
+            for (int j = i + 1; j < n; j++) {
+                if (arr[j] < arr[min]) min = j;
+            }
+            swap(arr, i, min);
+        }
+    }
+
+    private static void swap(int[] arr, int i, int min) {
+        int tmp = arr[i];
+        arr[i] = arr[min];
+        arr[min] = tmp;
+    }
+}