From 674268ca1a49b409e3c5f6040b626a2b40811cf7 Mon Sep 17 00:00:00 2001 From: sseoy <98001270+01seoyoung@users.noreply.github.com> Date: Wed, 1 Nov 2023 18:58:10 +0900 Subject: [PATCH 1/6] =?UTF-8?q?Create=202750=EB=B2=88?= MIME-Version: 1.0 Content-Type: text/plain; charset=UTF-8 Content-Transfer-Encoding: 8bit --- "1\354\243\274\354\260\250/2750\353\262\210" | 1 + 1 file changed, 1 insertion(+) create mode 100644 "1\354\243\274\354\260\250/2750\353\262\210" diff --git "a/1\354\243\274\354\260\250/2750\353\262\210" "b/1\354\243\274\354\260\250/2750\353\262\210" new file mode 100644 index 0000000..8b13789 --- /dev/null +++ "b/1\354\243\274\354\260\250/2750\353\262\210" @@ -0,0 +1 @@ + From 1e0a0f1046a241d732c54e067504014ac0cc7d16 Mon Sep 17 00:00:00 2001 From: sseoy <98001270+01seoyoung@users.noreply.github.com> Date: Wed, 1 Nov 2023 18:58:23 +0900 Subject: [PATCH 2/6] Add files via upload --- "1\354\243\274\354\260\250/2750.py" | 16 ++++++++++++++++ 1 file changed, 16 insertions(+) create mode 100644 "1\354\243\274\354\260\250/2750.py" diff --git "a/1\354\243\274\354\260\250/2750.py" "b/1\354\243\274\354\260\250/2750.py" new file mode 100644 index 0000000..da7094a --- /dev/null +++ "b/1\354\243\274\354\260\250/2750.py" @@ -0,0 +1,16 @@ +A = int(input()) +A_list = [] + +for i in range(A): + num = int(input()) + A_list.append(num) + +for i in range(A): + min_index = i + for j in range(i+1, A): + if A_list[j] < A_list[min_index]: + min_index = j + A_list[i], A_list[min_index] = A_list[min_index], A_list[i] + +for i in A_list: + print(i) From f27a2abecb867022c5813073ead61fea91a27549 Mon Sep 17 00:00:00 2001 From: sseoy <98001270+01seoyoung@users.noreply.github.com> Date: Wed, 1 Nov 2023 18:58:39 +0900 Subject: [PATCH 3/6] =?UTF-8?q?Delete=201=EC=A3=BC=EC=B0=A8/2750=EB=B2=88?= MIME-Version: 1.0 Content-Type: text/plain; charset=UTF-8 Content-Transfer-Encoding: 8bit --- "1\354\243\274\354\260\250/2750\353\262\210" | 1 - 1 file changed, 1 deletion(-) delete mode 100644 "1\354\243\274\354\260\250/2750\353\262\210" diff --git "a/1\354\243\274\354\260\250/2750\353\262\210" "b/1\354\243\274\354\260\250/2750\353\262\210" deleted file mode 100644 index 8b13789..0000000 --- "a/1\354\243\274\354\260\250/2750\353\262\210" +++ /dev/null @@ -1 +0,0 @@ - From 8f39a48ea77aaa06074530f11a5619bd1fd57b1a Mon Sep 17 00:00:00 2001 From: sseoy <98001270+01seoyoung@users.noreply.github.com> Date: Sat, 4 Nov 2023 11:27:28 +0900 Subject: [PATCH 4/6] Add files via upload --- "1\354\243\274\354\260\250/2751.py" | 39 +++++++++++++++++++++++++++++ 1 file changed, 39 insertions(+) create mode 100644 "1\354\243\274\354\260\250/2751.py" diff --git "a/1\354\243\274\354\260\250/2751.py" "b/1\354\243\274\354\260\250/2751.py" new file mode 100644 index 0000000..243790d --- /dev/null +++ "b/1\354\243\274\354\260\250/2751.py" @@ -0,0 +1,39 @@ +# O(n log n)의 시간 복잡도를 위해 quick_sort 함수 사용 +def quick_sort(arr): + if len(arr) <= 1: + return arr + + # 피벗 원소를 선택 + pivot = arr[len(arr) // 2] + + # 피벗보다 작은 원소들 (왼쪽) + left = [x for x in arr if x < pivot] + + # 피벗과 같은 원소들 (가운데) + middle = [x for x in arr if x == pivot] + + # 피벗보다 큰 원소들 (오른쪽) + right = [x for x in arr if x > pivot] + + return quick_sort(left) + middle + quick_sort(right) + +# 사용자로부터 요소의 개수인 A를 입력받기 +A = int(input()) + +# 사용자 입력을 저장할 빈 리스트를 초기화 +A_list = [] + + +# A개의 정수를 사용자로부터 입력받고 A_list에 저장 +for i in range(A): + num = int(input()) + A_list.append(num) + +# quick_sort 함수를 사용하여 리스트를 정렬 +A_list = quick_sort(A_list) + +# 정렬된 리스트 출력 +for i in A_list: + print(i) + + From 4c21b1a498b1ee10916d163136d30710c1242764 Mon Sep 17 00:00:00 2001 From: sseoy <98001270+01seoyoung@users.noreply.github.com> Date: Sat, 4 Nov 2023 11:30:35 +0900 Subject: [PATCH 5/6] =?UTF-8?q?Delete=201=EC=A3=BC=EC=B0=A8/2750.py?= MIME-Version: 1.0 Content-Type: text/plain; charset=UTF-8 Content-Transfer-Encoding: 8bit --- "1\354\243\274\354\260\250/2750.py" | 16 ---------------- 1 file changed, 16 deletions(-) delete mode 100644 "1\354\243\274\354\260\250/2750.py" diff --git "a/1\354\243\274\354\260\250/2750.py" "b/1\354\243\274\354\260\250/2750.py" deleted file mode 100644 index da7094a..0000000 --- "a/1\354\243\274\354\260\250/2750.py" +++ /dev/null @@ -1,16 +0,0 @@ -A = int(input()) -A_list = [] - -for i in range(A): - num = int(input()) - A_list.append(num) - -for i in range(A): - min_index = i - for j in range(i+1, A): - if A_list[j] < A_list[min_index]: - min_index = j - A_list[i], A_list[min_index] = A_list[min_index], A_list[i] - -for i in A_list: - print(i) From 26e4471231a91aa7400e8c610939a9b0f9b6bd38 Mon Sep 17 00:00:00 2001 From: sseoy <98001270+01seoyoung@users.noreply.github.com> Date: Sat, 4 Nov 2023 11:30:48 +0900 Subject: [PATCH 6/6] Add files via upload --- "1\354\243\274\354\260\250/2750.py" | 27 +++++++++++++++++++++++++++ 1 file changed, 27 insertions(+) create mode 100644 "1\354\243\274\354\260\250/2750.py" diff --git "a/1\354\243\274\354\260\250/2750.py" "b/1\354\243\274\354\260\250/2750.py" new file mode 100644 index 0000000..0f0bcc7 --- /dev/null +++ "b/1\354\243\274\354\260\250/2750.py" @@ -0,0 +1,27 @@ +# O(N^2)의 시간복잡도를 하기 위해 선택정렬 코드 + +# A개의 정수를 입력 +A = int(input()) + +# 입력된 정수를 저장할 빈 리스트 A_list를 초기화시키기 +A_list = [] + +# A번 반복하여 정수를 사용자로부터 입력받고 A_list 리스트에 저장 +for i in range(A): + num = int(input()) + A_list.append(num) + +# 선택 정렬을 이용하여 리스트를 정렬 +for i in range(A): + # 현재 위치부터 나머지 원소 중에서 최솟값의 인덱스 찾기 + min_index = i + for j in range(i + 1, A): + if A_list[j] < A_list[min_index]: + min_index = j + + # 현재 위치의 원소와 최솟값의 원소를 교환 + A_list[i], A_list[min_index] = A_list[min_index], A_list[i] + +# 정렬된 리스트를 출력 +for i in A_list: + print(i)