Merge pull request kelvins#314 from izumigoto/main

added mergesort for kotlin

Author: kelvins

README.md

@@ -3194,9 +3194,9 @@ In order to achieve greater coverage and encourage more people to contribute to
                     <img align="center" height="25" src="./logos/github.svg" />
                 </a>
             </td>
-            <td> <!-- Kotlin -->
-                <a href="./CONTRIBUTING.md">
-                    <img align="center" height="25" src="./logos/github.svg" />
+            <td> <!-- kotlin -->
+                <a href="./src/kotlin/MergeSort.kt">
+                    <img align="center" height="25" src="./logos/kotlin.svg" />
                 </a>
             </td>
         </tr>

src/kotlin/MergeSort.kt

@@ -0,0 +1,49 @@
+fun mergeSort(arr: IntArray): IntArray {
+    if (arr.size <= 1) {
+        return arr
+    }
+
+    val middle = arr.size / 2
+    val left = arr.copyOfRange(0, middle)
+    val right = arr.copyOfRange(middle, arr.size)
+
+    return merge(mergeSort(left), mergeSort(right))
+}
+
+fun merge(left: IntArray, right: IntArray): IntArray {
+    var result = IntArray(left.size + right.size)
+    var leftIndex = 0
+    var rightIndex = 0
+    var resultIndex = 0
+
+    while (leftIndex < left.size && rightIndex < right.size) {
+        if (left[leftIndex] < right[rightIndex]) {
+            result[resultIndex] = left[leftIndex]
+            leftIndex++
+        } else {
+            result[resultIndex] = right[rightIndex]
+            rightIndex++
+        }
+        resultIndex++
+    }
+
+    while (leftIndex < left.size) {
+        result[resultIndex] = left[leftIndex]
+        leftIndex++
+        resultIndex++
+    }
+
+    while (rightIndex < right.size) {
+        result[resultIndex] = right[rightIndex]
+        rightIndex++
+        resultIndex++
+    }
+
+    return result
+}
+
+fun main() {
+    val arr = intArrayOf(12, 11, 13, 5, 6, 7)
+    val sortedArray = mergeSort(arr)
+    println("Sorted array: ${sortedArray.joinToString(", ")}")
+}