update

Author: yester31

lecture1/lecture1/ex032.cpp

@@ -0,0 +1,33 @@
+#include <iostream>
+#include <vector>
+#include <chrono>
+#include <string>
+#include <algorithm>
+using namespace std;
+using namespace chrono;
+
+// ¼±Åà Á¤·Ä
+
+void ex032() {
+    vector<int> a{ 13, 5, 11, 7, 23, 15 };
+
+    for (int i = 0; i < a.size(); i++) {
+        int max = a[i];
+        for (int j = i; j < a.size(); j++) {
+            if (a[j] < max) {
+                a[i] = a[j];
+                a[j] = max;
+                max = a[i];
+            }
+        }
+    }
+    for (int i = 0; i < a.size(); i++) {
+        cout << a[i] << ' ';
+    }
+}
+
+//int main() {
+//    ex032();
+//    std::cout << "done!" << std::endl;
+//}
+//5 7 11 13 15 23

lecture1/lecture1/ex033.cpp

@@ -0,0 +1,38 @@
+#include <iostream>
+#include <vector>
+#include <chrono>
+#include <string>
+#include <algorithm>
+using namespace std;
+using namespace chrono;
+
+// 3µîÀÇ ¼ºÀûÀº? (Á¤·Ä ÀÀ¿ë)
+
+void ex033() {
+    vector<int> a{ 80, 96, 75, 82, 96, 92, 100 };
+
+    for (int i = 0; i < a.size(); i++) {
+        int min = a[i];
+        for (int j = 0; j < a.size(); j++) {
+            if (a[j] < min) {
+                a[i] = a[j];
+                a[j] = min;
+                min = a[i];
+            }
+        }
+    }
+    int rank = 1;
+    for (int i = 0; i < a.size() - 1; i++) {
+        if (rank == 3) {
+            std::cout << a[i] << std::endl;
+            break;
+        }
+        if (a[i] != a[i + 1]) rank++;
+    }
+}
+
+//int main() {
+//    ex033();
+//    std::cout << "done!" << std::endl;
+//}
+//92

lecture1/lecture1/ex034.cpp

@@ -0,0 +1,32 @@
+#include <iostream>
+#include <vector>
+#include <chrono>
+#include <string>
+#include <algorithm>
+using namespace std;
+using namespace chrono;
+
+// ¹öºí Á¤·Ä
+
+void ex034() {
+    vector<int> a{ 13, 23, 11, 7, 5, 15 };
+
+    for (int i = 0; i < a.size() - 1; i++) {
+        for (int j = 0; j < a.size() - i - 1; j++) {
+            if (a[j + 1] > a[j]) {
+                int tmp = a[j];
+                a[j] = a[j + 1];
+                a[j + 1] = tmp;
+            }
+        }
+    }
+    for (int i = 0; i < a.size(); i++) {
+        cout << a[i] << ' ';
+    }
+}
+
+//int main() {
+//    ex034();
+//    std::cout << "done!" << std::endl;
+//}
+//23 13 15 11 7 5

lecture1/lecture1/ex035.cpp

@@ -0,0 +1,32 @@
+#include <iostream>
+#include <vector>
+#include <chrono>
+#include <string>
+#include <algorithm>
+using namespace std;
+using namespace chrono;
+
+// Special Sort (버블정렬 응용: 구글 인터뷰)
+
+void ex035() {
+    vector<int> a{ 1, 2, 3, -3, -2, 5, 6, -6 };
+
+    for (int i = 0; i < a.size() - 1; i++) {
+        for (int j = 0; j < a.size() - i - 1; j++) {
+            if (0 < a[j] && a[j + 1] < 0) {
+                int tmp = a[j];
+                a[j] = a[j + 1];
+                a[j + 1] = tmp;
+            }
+        }
+    }
+    for (int i = 0; i < a.size(); i++) {
+        cout << a[i] << ' ';
+    }
+}
+
+//int main() {
+//    ex035();
+//    std::cout << "done!" << std::endl;
+//}
+//

lecture1/lecture1/ex036.cpp

@@ -0,0 +1,35 @@
+#include <iostream>
+#include <vector>
+#include <chrono>
+#include <string>
+#include <algorithm>
+using namespace std;
+using namespace chrono;
+
+// 삽입정렬
+
+void ex036() {
+    vector<int> a{ 7, 11, 5, 6, 10, 9 };
+    int j;
+    for (int i = 1; i < a.size(); i++) {
+        int tmp = a[i];
+        for (j = i - 1; j >= 0; j--) {
+            if (a[j] > tmp) {
+                a[j + 1] = a[j]; // 뒤로 이동
+            }
+            else {
+                break;
+            }
+        }
+        a[j + 1] = tmp; // 현재까지 정렬된 숫자들 바로 뒤에 삽입
+    }
+    for (int i = 0; i < a.size(); i++) {
+        cout << a[i] << ' ';
+    }
+}
+
+//int main() {
+//    ex036();
+//    std::cout << "done!" << std::endl;
+//}
+// 5 6 7 9 10 11

lecture1/lecture1/ex037.cpp

@@ -0,0 +1,20 @@
+#include <iostream>
+#include <vector>
+#include <chrono>
+#include <string>
+#include <algorithm>
+using namespace std;
+using namespace chrono;
+
+// Least Recently Used (삽입정렬 코드 스타일 : 카카오)
+
+void ex037() {
+    vector<int> a{ 7, 11, 5, 6, 10, 9 };
+
+}
+
+int main() {
+    ex037();
+    std::cout << "done!" << std::endl;
+}
+// 5 6 7 9 10 11

lecture1/lecture1/lecture1.vcxproj

@@ -154,6 +154,12 @@
     <ClCompile Include="ex029.cpp" />
     <ClCompile Include="ex030.cpp" />
     <ClCompile Include="ex031.cpp" />
+    <ClCompile Include="ex032.cpp" />
+    <ClCompile Include="ex033.cpp" />
+    <ClCompile Include="ex034.cpp" />
+    <ClCompile Include="ex035.cpp" />
+    <ClCompile Include="ex036.cpp" />
+    <ClCompile Include="ex037.cpp" />
   </ItemGroup>
   <Import Project="$(VCTargetsPath)\Microsoft.Cpp.targets" />
   <ImportGroup Label="ExtensionTargets">

lecture1/lecture1/lecture1.vcxproj.filters

@@ -108,5 +108,23 @@
     <ClCompile Include="ex031.cpp">
       <Filter>소스 파일</Filter>
     </ClCompile>
+    <ClCompile Include="ex032.cpp">
+      <Filter>소스 파일</Filter>
+    </ClCompile>
+    <ClCompile Include="ex033.cpp">
+      <Filter>소스 파일</Filter>
+    </ClCompile>
+    <ClCompile Include="ex034.cpp">
+      <Filter>소스 파일</Filter>
+    </ClCompile>
+    <ClCompile Include="ex035.cpp">
+      <Filter>소스 파일</Filter>
+    </ClCompile>
+    <ClCompile Include="ex036.cpp">
+      <Filter>소스 파일</Filter>
+    </ClCompile>
+    <ClCompile Include="ex037.cpp">
+      <Filter>소스 파일</Filter>
+    </ClCompile>
   </ItemGroup>
 </Project>