\uc548\ub155\ud558\uc138\uc694! \uc774\ubc88 \ud3ec\uc2a4\ud305\uc5d0\uc11c\ub294 C#\uc744 \uc0ac\uc6a9\ud558\uc5ec \ucf54\ub529 \ud14c\uc2a4\ud2b8\uc5d0\uc11c \uc790\uc8fc \uc811\ud560 \uc218 \uc788\ub294 \ubb38\uc81c \uc911 \ud558\ub098\uc778 “\uc218 \uc815\ub82c\ud558\uae30”\ub97c \ub2e4\ub8e8\uc5b4 \ubcf4\uaca0\uc2b5\ub2c8\ub2e4. \ubcf8 \uac15\uc88c\ub294 \uc54c\uace0\ub9ac\uc998 \ubb38\uc81c\uc758 \uc774\ud574\ubd80\ud130 \ud574\uacb0 \uacfc\uc815\uae4c\uc9c0 \uc790\uc138\ud788 \uc124\uba85\ud558\uace0, \ucd5c\uc885\uc801\uc73c\ub85c C# \ucf54\ub4dc\ub97c \uad6c\ud604\ud558\ub294 \ubc29\ubc95\uae4c\uc9c0 \uc54c\uc544\ubcfc \uac83\uc785\ub2c8\ub2e4.<\/p>\n
\n \uc8fc\uc5b4\uc9c4 \uc218\uc758 \uac1c\uc218\ub9cc\ud07c \uc218\ub97c \uc785\ub825\ubc1b\uc544, \uadf8 \uc218\ub4e4\uc744 \uc624\ub984\ucc28\uc21c\uc73c\ub85c \uc815\ub82c\ud558\uc5ec \ucd9c\ub825\ud558\ub294 \ubb38\uc81c\uc785\ub2c8\ub2e4. \uc815\ub82c \uc54c\uace0\ub9ac\uc998\uc758 \uae30\ucd08\uc640 \ud568\uaed8 \ub2e4\uc591\ud55c \ubc29\ubc95\uc73c\ub85c \ubb38\uc81c\ub97c \ud574\uacb0\ud574\ubcf4\uaca0\uc2b5\ub2c8\ub2e4.\n<\/p>\n
\n \uccab\uc9f8 \uc904\ubd80\ud130 N\uac1c\uc758 \uc904\uc5d0 \uc624\ub984\ucc28\uc21c\uc73c\ub85c \uc815\ub82c\ub41c \uacb0\uacfc\ub97c \ucd9c\ub825\ud569\ub2c8\ub2e4.\n<\/p>\n
\n\uc785\ub825\n5\n5\n2\n3\n1\n4\n\n\ucd9c\ub825\n1\n2\n3\n4\n5\n<\/pre>\n\ubb38\uc81c \ud574\uacb0 \uacfc\uc815<\/h2>\n
\n \uc774 \ubb38\uc81c\ub294 \ub2e8\uc21c\ud788 \uc8fc\uc5b4\uc9c4 \uc218\ub4e4\uc744 \uc815\ub82c\ud558\ub294 \ubb38\uc81c\ub85c, \uc5ec\ub7ec \uac00\uc9c0 \uc815\ub82c \uc54c\uace0\ub9ac\uc998\uc744 \uc0ac\uc6a9\ud560 \uc218 \uc788\uc2b5\ub2c8\ub2e4. \uc774 \uae00\uc5d0\uc11c\ub294 \uae30\ubcf8\uc801\uc778 \uc815\ub82c \uc54c\uace0\ub9ac\uc998 \uc911 \ud558\ub098\uc778 “\ubcd1\ud569 \uc815\ub82c(Merge Sort)”\uacfc “C#\uc758 \ub0b4\uc7a5 \uc815\ub82c \uba54\uc11c\ub4dc”\ub97c \uc0ac\uc6a9\ud558\uc5ec \ubb38\uc81c\ub97c \ud574\uacb0\ud558\ub294 \ubc29\ubc95\uc744 \uc124\uba85\ud558\uaca0\uc2b5\ub2c8\ub2e4.\n<\/p>\n
1. \ubcd1\ud569 \uc815\ub82c(Merge Sort)<\/h3>\n
\n \ubcd1\ud569 \uc815\ub82c\uc740 \ubd84\ud560 \uc815\ubcf5(divide and conquer) \uc54c\uace0\ub9ac\uc998\uc758 \uc77c\uc885\uc73c\ub85c, \uc8fc\uc5b4\uc9c4 \ubc30\uc5f4\uc744 \ubc18\uc73c\ub85c \ub098\ub204\uc5b4 \uac01\uac01\uc744 \uc815\ub82c\ud55c \ud6c4, \ub2e4\uc2dc \ud569\uccd0\uc11c \uc815\ub82c\ud558\ub294 \ubc29\uc2dd\uc785\ub2c8\ub2e4. \ud3c9\uade0 \uacbd\uc6b0\uc640 \ucd5c\uc545\uc758 \uacbd\uc6b0 \ubaa8\ub450 O(N log N)\uc758 \uc2dc\uac04 \ubcf5\uc7a1\ub3c4\ub97c \uac00\uc9c0\uba70, \uc548\uc815\uc801\uc778 \uc815\ub82c \ubc29\ubc95\uc785\ub2c8\ub2e4.\n<\/p>\n
\ubcd1\ud569 \uc815\ub82c \uc808\ucc28<\/h4>\n
\n
- \ubc30\uc5f4\uc774 \ud558\ub098\uc758 \uc6d0\uc18c\ub85c \ub098\ub20c \ub54c\uae4c\uc9c0 \uc7ac\uadc0\uc801\uc73c\ub85c \ubc30\uc5f4\uc744 \ub098\ub208\ub2e4.<\/li>\n
- \ub098\ub208 \ubc30\uc5f4\uc744 \uc815\ub82c\ud558\uba70 \ud569\uce5c\ub2e4.<\/li>\n<\/ol>\n
\ubcd1\ud569 \uc815\ub82c \uad6c\ud604<\/h4>\n
\uc774\uc81c C#\uc73c\ub85c \ubcd1\ud569 \uc815\ub82c\uc744 \uad6c\ud604\ud574 \ubcf4\uaca0\uc2b5\ub2c8\ub2e4.<\/p>\n
\n\npublic class MergeSort\n{\n public static void Sort(int[] array, int left, int right)\n {\n if (left < right)\n {\n int mid = (left + right) \/ 2;\n\n \/\/ Divide the array elements\n Sort(array, left, mid);\n Sort(array, mid + 1, right);\n\n \/\/ Merge the sorted halves\n Merge(array, left, mid, right);\n }\n }\n\n public static void Merge(int[] array, int left, int mid, int right)\n {\n int n1 = mid - left + 1;\n int n2 = right - mid;\n\n int[] leftArray = new int[n1];\n int[] rightArray = new int[n2];\n\n for (int i = 0; i < n1; i++)\n leftArray[i] = array[left + i];\n\n for (int j = 0; j < n2; j++)\n rightArray[j] = array[mid + 1 + j];\n\n int k = left, l = 0, m = 0;\n\n while (l < n1 && m < n2)\n {\n if (leftArray[l] <= rightArray[m])\n {\n array[k] = leftArray[l];\n l++;\n }\n else\n {\n array[k] = rightArray[m];\n m++;\n }\n k++;\n }\n\n while (l < n1)\n {\n array[k] = leftArray[l];\n l++;\n k++;\n }\n\n while (m < n2)\n {\n array[k] = rightArray[m];\n m++;\n k++;\n }\n }\n}\n<\/code>\n<\/pre>\n2. C# \ub0b4\uc7a5 \uc815\ub82c \uba54\uc11c\ub4dc \uc0ac\uc6a9\ud558\uae30<\/h3>\n
\n C#\uc5d0\uc11c\ub294 \ub0b4\uc7a5\ub41c \uc815\ub82c \uba54\uc11c\ub4dc\ub97c \uc0ac\uc6a9\ud558\uba74 \ub354 \uac04\ub2e8\ud558\uac8c \ubb38\uc81c\ub97c \ud574\uacb0\ud560 \uc218 \uc788\uc2b5\ub2c8\ub2e4. <\/p>\n
\n\nusing System;\n\nclass Program\n{\n static void Main(string[] args)\n {\n int n = int.Parse(Console.ReadLine());\n int[] numbers = new int[n];\n\n for (int i = 0; i < n; i++)\n {\n numbers[i] = int.Parse(Console.ReadLine());\n }\n\n Array.Sort(numbers);\n\n foreach (var num in numbers)\n {\n Console.WriteLine(num);\n }\n }\n}\n<\/code>\n<\/pre>\n\ubd84\uc11d \ubc0f \ub9c8\ubb34\ub9ac<\/h2>\n
\n \uc774 \ubb38\uc81c\ub294 \uc815\ub82c\uc758 \uae30\ucd08\ub97c \ubc30\uc6b8 \uc218 \uc788\ub294 \uc88b\uc740 \uae30\ud68c\uc785\ub2c8\ub2e4. \ubcd1\ud569 \uc815\ub82c\uacfc C#\uc758 \ub0b4\uc7a5 \uba54\uc11c\ub4dc\ub97c \ud1b5\ud574 \uc5b4\ub5bb\uac8c \uc815\ub82c\uc774 \uc774\ub8e8\uc5b4\uc9c0\ub294\uc9c0, \uadf8\ub9ac\uace0 \uc5b4\ub5a4 \ubc29\ubc95\uc774 \ub354 \ud6a8\uc728\uc801\uc778\uc9c0\ub97c \uc54c \uc218 \uc788\uc5c8\uc2b5\ub2c8\ub2e4. \ucf54\ub529 \ud14c\uc2a4\ud2b8\uc5d0\uc11c \uc790\uc8fc \uc811\ud560 \uc218 \uc788\ub294 \ubb38\uc81c \ud615\ud0dc\uc774\ubbc0\ub85c \uc790\uc8fc \uc5f0\uc2b5\ud558\ub294 \uac83\uc774 \uc88b\uc2b5\ub2c8\ub2e4.\n<\/p>\n
\n \ub2e4\uc74c \ud3ec\uc2a4\ud305\uc5d0\uc11c\ub294 \ub354 \ubcf5\uc7a1\ud55c \uc815\ub82c \ubb38\uc81c\ub098 \uc54c\uace0\ub9ac\uc998\uc744 \ub2e4\ub8f0 \uc608\uc815\uc785\ub2c8\ub2e4. \ud568\uaed8 \uacf5\ubd80\ud558\uba74\uc11c \ucf54\ub529 \ud14c\uc2a4\ud130\ub85c\uc11c\uc758 \ub2a5\ub825\uc744 \ud0a4\uc6cc\ub098\uac00\uae38 \ubc14\ub78d\ub2c8\ub2e4!<\/p>\n
<\/body><\/p>\n","protected":false},"excerpt":{"rendered":"