update README.md

devOTTO · devOTTO · commit 8dce1add6c20 · 2019-04-26T23:42:25.000+09:00
diff --git a/README.md b/README.md
@@ -14,6 +14,12 @@ Personal Solution of Algorithm Probs
 #### [6.1차원 배열 사용하기](https://www.acmicpc.net/step/6)
 #### [7.문자열 사용하기](https://www.acmicpc.net/step/7)
 #### [8.규칙 찾기](https://www.acmicpc.net/step/8)
+#### [9.정렬해보기](https://www.acmicpc.net/step/9)
+- [2750](https://www.acmicpc.net/problem/2750) : 수 정렬하기 = [풀이](https://github.com/devOTTO/Algorithm-Study/blob/master/baekjoon/2750.cpp)
+- [2751](https://www.acmicpc.net/problem/2751) : 수 정렬하기 2 = [풀이](https://github.com/devOTTO/Algorithm-Study/blob/master/baekjoon/2751.cpp)
+- [10989](https://www.acmicpc.net/problem/10989) : 수 정렬하기 3 = [풀이](https://github.com/devOTTO/Algorithm-Study/blob/master/baekjoon/10989.cpp)
+- [2108](https://www.acmicpc.net/problem/2108) : 통계학 = [풀이](https://github.com/devOTTO/Algorithm-Study/blob/master/baekjoon/2108.cpp)
+- [1427](https://www.acmicpc.net/problem/1427) : 소트인사이드 = [풀이](https://github.com/devOTTO/Algorithm-Study/blob/master/baekjoon/1427.cpp)
 
 ### 테마별로 풀어보기
 
diff --git a/baekjoon/10989.cpp b/baekjoon/10989.cpp
@@ -0,0 +1,27 @@
+//
+// Created by 융미 on 2019-04-26.
+//10989 수 정렬하기 3
+#include <cstdio>
+
+int main() {
+    int arr[10001]={0,};
+
+    int N;
+    int num;
+
+    scanf("%d", &N);
+    while(N--)
+    {
+        scanf("%d", &num);
+        arr[num]++;
+    }
+
+    for(int i = 1; i<=10000; i++)
+    {
+        for(int j= 0; j<arr[i]; j++)
+            printf("%d\n", i);
+    }
+    return 0;
+}
+
+
diff --git a/baekjoon/1427.cpp b/baekjoon/1427.cpp
@@ -0,0 +1,28 @@
+//
+// Created by 융미 on 2019-04-26.
+//1427 소트인사이드
+
+#include <cstdio>
+#include <algorithm>
+
+int main(){
+    int arr[10] = {0, };
+    int input = 0;
+
+    scanf("%d", &input);
+
+    int i = 0;
+    while(input){
+        arr[i++] = input%10;
+        input /=10;
+    }
+
+
+    std::sort(arr,arr+i);
+
+    for(int j = i - 1; j>-1; j--)
+        printf("%d", arr[j]);
+
+    return 0;
+}
+
diff --git a/baekjoon/2108.cpp b/baekjoon/2108.cpp
@@ -0,0 +1,78 @@
+//
+// Created by 융미 on 2019-04-26.
+//2108 통계학
+#include <iostream>
+#include <vector>
+#include <algorithm>
+#include <cmath>
+
+int main(){
+
+    int num = 0;
+    int arr[8001] = {0,};
+    int temp = 0;
+    int sansul = 0;
+    int mid = 0;
+    int most = -1;
+    std::vector<int> bin;
+    int first = 8001;
+    int last = -1;
+    int count = 0;
+
+    std::cin >> num;
+    for(int i = 0; i<num; i++)
+    {
+        std::cin >> temp;
+        ++arr[temp+4000];
+    }
+
+    //산술
+    for(int i = 0; i<8001; i++)
+    {
+        if(arr[i] != 0)
+        {
+            if(i<first)
+                first = i;
+            if(i>last)
+                last = i;
+
+            if(most < arr[i])
+            {
+                bin.clear();
+                most = arr[i];
+            }
+            if(most == arr[i])
+                bin.push_back(i);
+
+            for(int j = 0; j<arr[i]; j++)
+            {
+
+                if(++count == (num/2 + 1))
+                {
+                    mid = i-4000;
+                }
+                sansul+=(i-4000);
+            }
+        }
+    }
+
+    std::cout << floor((double)sansul/num+0.5) << '\n';
+
+    //중앙
+    std::cout << mid << '\n';
+
+    //최빈
+    most = bin[0];
+    // 최빈값이 여러개인 경우 두번째로 작은 값 선택
+    if (bin.size() > 1) {
+        sort(bin.begin(), bin.end());
+        most = bin[1];
+    }
+    std::cout << most - 4000 << '\n';
+
+    //범위
+    std::cout << last - first;
+
+    return 0;
+}
+
diff --git a/baekjoon/2750.cpp b/baekjoon/2750.cpp
@@ -0,0 +1,26 @@
+//
+// Created by 융미 on 2019-04-26.
+//2750 수 정렬하기
+#include <cstdio>
+#include <algorithm>
+
+int main(){
+    int arr[1000];
+    int num;
+
+    scanf("%d", &num);
+    int i = 0;
+    int j = num;
+    while(j--){
+        scanf("%d", &arr[i++]);
+    }
+
+    std::sort(arr, arr+num);
+    i = 0;
+    while(num--)
+    {
+        printf("%d\n", arr[i++]);
+    }
+    return 0;
+}
+
diff --git a/baekjoon/2751.cpp b/baekjoon/2751.cpp
@@ -0,0 +1,25 @@
+//
+// Created by 융미 on 2019-04-26.
+//2751 수 정렬하기 2
+#include <cstdio>
+#include <algorithm>
+
+int main(){
+    int arr[1000000];
+    int num;
+
+    scanf("%d", &num);
+    int i = 0;
+    int j = num;
+    while(j--){
+        scanf("%d", &arr[i++]);
+    }
+
+    std::sort(arr, arr+num);
+    i = 0;
+    while(num--)
+    {
+        printf("%d\n", arr[i++]);
+    }
+    return 0;
+}
