Title: 삽입 정렬 구현, Time: 8ms, Memory: 0MB, Status: Passed - Codetree

OstenHun · OstenHun · commit 3e1ea0055253 · 2026-02-14T11:58:13.000+09:00
diff --git a/260214/삽입 정렬 구현/implement-insertion-sort.cpp b/260214/삽입 정렬 구현/implement-insertion-sort.cpp
@@ -0,0 +1,33 @@
+#include <iostream>
+
+#define MAX_N 100
+
+using namespace std;
+
+int n;
+int arr[MAX_N];
+
+int main() {
+    cin >> n;
+
+    for (int i = 0; i < n; i++) {
+        cin >> arr[i];
+    }
+
+    // Please write your code here.
+    for (int i = 1; i < n; i++) {
+        int key = arr[i];
+        int j = i-1;
+        while(j >= 0 && arr[j] > key) {
+            arr[j+1] = arr[j];
+            j--;
+        }   
+        arr[j+1] = key;
+    }
+
+    for (int i = 0; i < n; i++) {
+        cout << arr[i] << ' ';
+    }
+
+    return 0;
+}
