From 422b1a59bd157e0095b2b26086024857bf6aca7b Mon Sep 17 00:00:00 2001
From: Wenru Dong <dongwenru.aaron.shenyang@gmail.com>
Date: Tue, 16 Oct 2018 22:25:52 +0100
Subject: [PATCH] mergeSort in swift

---
 swift/12_sorts/.DS_Store        | Bin 0 -> 6148 bytes
 swift/12_sorts/SortsTests.swift |  44 ++++++++++++++++++++++++++
 swift/12_sorts/mergeSort.swift  |  54 ++++++++++++++++++++++++++++++++
 3 files changed, 98 insertions(+)
 create mode 100644 swift/12_sorts/.DS_Store
 create mode 100644 swift/12_sorts/SortsTests.swift
 create mode 100644 swift/12_sorts/mergeSort.swift

diff --git a/swift/12_sorts/.DS_Store b/swift/12_sorts/.DS_Store
new file mode 100644
index 0000000000000000000000000000000000000000..5008ddfcf53c02e82d7eee2e57c38e5672ef89f6
GIT binary patch
literal 6148
zcmeH~Jr2S!425mzP>H1@V-^m;4Wg<&0T*E43hX&L&p$$qDprKhvt+--jT7}7np#A3
zem<@ulZcFPQ@L2!n>{z**<q8>++&mCkOWA81W14cNZ<zv;LbK1Poaz?KmsK2CSc!(
z0ynLxE!0092;Krf2c+FF_Fe*7ECH>lEfg7;MkzE(HCqgga^y>{tEnwC%0;vJ&^%eQ
zLs35+`xjp>T0<F0fCPF1$Cyrb|F7^5{eNG?83~ZUUlGt@xh*qZDeu<Z%US-OSsOPv
j)R!Z4KLME7ReXlK;d!wEw5GODWMKRea10D2@KpjYNUI8I

literal 0
HcmV?d00001

diff --git a/swift/12_sorts/SortsTests.swift b/swift/12_sorts/SortsTests.swift
new file mode 100644
index 0000000..6a52e22
--- /dev/null
+++ b/swift/12_sorts/SortsTests.swift
@@ -0,0 +1,44 @@
+//
+//  SortsTests.swift
+//  SortsTests
+//
+//  Created by Wenru Dong on 2018/10/14.
+//  Copyright © 2018年 Wenru Dong. All rights reserved.
+//
+
+import XCTest
+
+class SortsTests: XCTestCase {
+    
+    override func setUp() {
+        super.setUp()
+        // Put setup code here. This method is called before the invocation of each test method in the class.
+    }
+    
+    override func tearDown() {
+        // Put teardown code here. This method is called after the invocation of each test method in the class.
+        super.tearDown()
+    }
+    
+    func testMergeSort() {
+        var a1 = [1, 1, 1, 1]
+        mergeSort(&a1)
+        XCTAssertEqual(a1, [1, 1, 1, 1])
+        
+        var a2 = [4, 3, 2, 1]
+        mergeSort(&a2)
+        XCTAssertEqual(a2, [1, 2, 3, 4])
+        
+        var a3 = [3, 6, 9, 7, 8, -1, 9, 3, -2, 0]
+        mergeSort(&a3)
+        XCTAssertEqual(a3, [-2, -1, 0, 3, 3, 6, 7, 8, 9, 9])
+    }
+    
+    func testPerformanceExample() {
+        // This is an example of a performance test case.
+        self.measure {
+            // Put the code you want to measure the time of here.
+        }
+    }
+    
+}
diff --git a/swift/12_sorts/mergeSort.swift b/swift/12_sorts/mergeSort.swift
new file mode 100644
index 0000000..45a2ef9
--- /dev/null
+++ b/swift/12_sorts/mergeSort.swift
@@ -0,0 +1,54 @@
+//
+//  sorts.swift
+//  algo
+//
+//  Created by Wenru Dong on 2018/10/14.
+//  Copyright © 2018年 Wenru Dong. All rights reserved.
+//
+
+import Foundation
+
+public func mergeSort<T>(_ a: inout T) where T: RandomAccessCollection, T: MutableCollection, T.Element: Comparable {
+    mergeSort(&a, from: a.startIndex, to: a.index(before: a.endIndex))
+}
+
+fileprivate func mergeSort<T>(_ a: inout T, from low: T.Index, to high: T.Index) where T: RandomAccessCollection, T: MutableCollection, T.Element: Comparable {
+    if low >= high { return }
+    let dist = a.distance(from: low, to: high)
+    let mid = a.index(low, offsetBy: dist/2)
+    mergeSort(&a, from: low, to: mid)
+    mergeSort(&a, from: a.index(mid, offsetBy: 1), to: high)
+    print(a)
+    merge(&a, from: low, through: mid, to: high)
+}
+
+fileprivate func merge<T>(_ a: inout T, from low: T.Index, through mid: T.Index, to high: T.Index) where T: RandomAccessCollection, T: MutableCollection, T.Element: Comparable {
+    var i = low
+    var j = a.index(mid, offsetBy: 1)
+    var tmp = Array<T.Element>()
+    tmp.reserveCapacity(a.distance(from: low, to: high) + 1)
+    while i <= mid && j <= high {
+        if a[i] <= a[j] {
+            tmp.append(a[i])
+            a.formIndex(after: &i)
+        } else {
+            tmp.append(a[j])
+            a.formIndex(after: &j)
+        }
+    }
+    
+    var start = i
+    var end = mid
+    if j <= high {
+        start = j
+        end = high
+    }
+    tmp.append(contentsOf: a[start...end])
+    
+    var current = low
+    for element in tmp {
+        a[current] = element
+        print(element)
+        a.formIndex(after: &current)
+    }
+}