.travis.yml

@@ -26,7 +26,7 @@ script:
 - xcodebuild test -project ./Insertion\ Sort/Tests/Tests.xcodeproj -scheme Tests
 # - xcodebuild test -project ./K-Means/Tests/Tests.xcodeproj -scheme Tests
 # - xcodebuild test -project ./Linked\ List/Tests/Tests.xcodeproj -scheme Tests
-# - xcodebuild test -project ./Longest\ Common\ Subsequence/Tests/Tests.xcodeproj -scheme Tests
+- xcodebuild test -project ./Longest\ Common\ Subsequence/Tests/Tests.xcodeproj -scheme Tests
 # - xcodebuild test -project ./Minimum\ Spanning\ Tree\ \(Unweighted\)/Tests/Tests.xcodeproj -scheme Tests
 # - xcodebuild test -project ./Priority\ Queue/Tests/Tests.xcodeproj -scheme Tests
 - xcodebuild test -project ./Queue/Tests/Tests.xcodeproj -scheme Tests

Breadth-First Search/BreadthFirstSearch.playground/Pages/Simple example.xcplaygroundpage/Contents.swift

@@ -1,4 +1,4 @@
-func breadthFirstSearch(graph: Graph, source: Node) -> [String] {
+func breadthFirstSearch(_ graph: Graph, source: Node) -> [String] {
   var queue = Queue<Node>()
   queue.enqueue(source)
 

Breadth-First Search/BreadthFirstSearch.playground/Sources/Edge.swift

@@ -1,11 +1,11 @@
 public class Edge: Equatable {
   public var neighbor: Node
 
-  public init(neighbor: Node) {
+  public init(_ neighbor: Node) {
     self.neighbor = neighbor
   }
 }
 
-public func == (lhs: Edge, rhs: Edge) -> Bool {
+public func == (_ lhs: Edge, rhs: Edge) -> Bool {
   return lhs.neighbor == rhs.neighbor
 }

Breadth-First Search/BreadthFirstSearch.playground/Sources/Graph.swift

@@ -5,14 +5,14 @@ public class Graph: CustomStringConvertible, Equatable {
     self.nodes = []
   }
 
-  public func addNode(label: String) -> Node {
-    let node = Node(label: label)
+  public func addNode(_ label: String) -> Node {
+    let node = Node(label)
     nodes.append(node)
     return node
   }
 
-  public func addEdge(source: Node, neighbor: Node) {
-    let edge = Edge(neighbor: neighbor)
+  public func addEdge(_ source: Node, neighbor: Node) {
+    let edge = Edge(neighbor)
     source.neighbors.append(edge)
   }
 
@@ -27,7 +27,7 @@ public class Graph: CustomStringConvertible, Equatable {
     return description
   }
 
-  public func findNodeWithLabel(label: String) -> Node {
+  public func findNodeWithLabel(_ label: String) -> Node {
     return nodes.filter { $0.label == label }.first!
   }
 
@@ -50,6 +50,6 @@ public class Graph: CustomStringConvertible, Equatable {
   }
 }
 
-public func == (lhs: Graph, rhs: Graph) -> Bool {
+public func == (_ lhs: Graph, rhs: Graph) -> Bool {
   return lhs.nodes == rhs.nodes
 }

Breadth-First Search/BreadthFirstSearch.playground/Sources/Node.swift

@@ -5,7 +5,7 @@ public class Node: CustomStringConvertible, Equatable {
   public var distance: Int?
   public var visited: Bool
 
-  public init(label: String) {
+  public init(_ label: String) {
     self.label = label
     neighbors = []
     visited = false
@@ -22,11 +22,11 @@ public class Node: CustomStringConvertible, Equatable {
     return distance != nil
   }
 
-  public func remove(edge: Edge) {
-    neighbors.removeAtIndex(neighbors.indexOf { $0 === edge }!)
+  public func remove(_ edge: Edge) {
+    neighbors.remove(at: neighbors.index { $0 === edge }!)
   }
 }
 
-public func == (lhs: Node, rhs: Node) -> Bool {
+public func == (_ lhs: Node, rhs: Node) -> Bool {
   return lhs.label == rhs.label && lhs.neighbors == rhs.neighbors
 }

Breadth-First Search/BreadthFirstSearch.playground/Sources/Queue.swift

@@ -13,7 +13,7 @@ public struct Queue<T> {
     return array.count
   }
 
-  public mutating func enqueue(element: T) {
+  public mutating func enqueue(_ element: T) {
     array.append(element)
   }
 

Breadth-First Search/BreadthFirstSearch.swift

@@ -1,4 +1,4 @@
-func breadthFirstSearch(graph: Graph, source: Node) -> [String] {
+func breadthFirstSearch(_ graph: Graph, source: Node) -> [String] {
   var queue = Queue<Node>()
   queue.enqueue(source)
 

Breadth-First Search/README.markdown

@@ -90,7 +90,7 @@ For an unweighted graph, this tree defines a shortest path from the starting nod
 Simple implementation of breadth-first search using a queue:
 
 ```swift
-func breadthFirstSearch(graph: Graph, source: Node) -> [String] {
+func breadthFirstSearch(_ graph: Graph, source: Node) -> [String] {
   var queue = Queue<Node>()
   queue.enqueue(source)
 

Brute-Force String Search/BruteForceStringSearch.playground/Contents.swift

@@ -1,16 +1,17 @@
 //: Playground - noun: a place where people can play
 
 extension String {
-  func indexOf(pattern: String) -> String.Index? {
-    for i in self.startIndex ..< self.endIndex {
+  func indexOf(_ pattern: String) -> String.Index? {
+
+    for i in self.characters.indices {
       var j = i
       var found = true
-      for p in pattern.startIndex ..< pattern.endIndex {
-        if j == self.endIndex || self[j] != pattern[p] {
+      for p in pattern.characters.indices{
+        if j == self.characters.endIndex || self[j] != pattern[p] {
           found = false
           break
         } else {
-          j = j.successor()
+            j = self.characters.index(after: j)
         }
       }
       if found {

Brute-Force String Search/BruteForceStringSearch.swift

@@ -2,21 +2,21 @@
   Brute-force string search
 */
 extension String {
-  func indexOf(pattern: String) -> String.Index? {
-    for i in self.startIndex ..< self.endIndex {
-      var j = i
-      var found = true
-      for p in pattern.startIndex ..< pattern.endIndex {
-        if j == self.endIndex || self[j] != pattern[p] {
-          found = false
-          break
-        } else {
-          j = j.successor()
+  func indexOf(_ pattern: String) -> String.Index? {
+    for i in self.characters.indices {
+        var j = i
+        var found = true
+        for p in pattern.characters.indices{
+            if j == self.characters.endIndex || self[j] != pattern[p] {
+                found = false
+                break
+            } else {
+                j = self.characters.index(after: j)
+            }
+        }
+        if found {
+            return i
         }
-      }
-      if found {
-        return i
-      }
     }
     return nil
   }

Brute-Force String Search/README.markdown

@@ -28,21 +28,21 @@ Here is a brute-force solution:
 
 ```swift
 extension String {
-  func indexOf(pattern: String) -> String.Index? {
-    for i in self.startIndex ..< self.endIndex {
-      var j = i
-      var found = true
-      for p in pattern.startIndex ..< pattern.endIndex {
-        if j == self.endIndex || self[j] != pattern[p] {
-          found = false
-          break
-        } else {
-          j = j.successor()
+  func indexOf(_ pattern: String) -> String.Index? {
+    for i in self.characters.indices {
+        var j = i
+        var found = true
+        for p in pattern.characters.indices{
+            if j == self.characters.endIndex || self[j] != pattern[p] {
+                found = false
+                break
+            } else {
+                j = self.characters.index(after: j)
+            }
+        }
+        if found {
+            return i
         }
-      }
-      if found {
-        return i
-      }
     }
     return nil
   }

Counting Sort/CountingSort.playground/Contents.swift

@@ -1,6 +1,6 @@
 //: Playground - noun: a place where people can play
 
-enum CountingSortError: ErrorType {
+enum CountingSortError: Error {
   case ArrayEmpty
 }
 
@@ -11,9 +11,9 @@ func countingSort(array: [Int]) throws -> [Int] {
 
   // Step 1
   // Create an array to store the count of each element
-  let maxElement = array.maxElement() ?? 0
+  let maxElement = array.max() ?? 0
 
-  var countArray = [Int](count: Int(maxElement + 1), repeatedValue: 0)
+  var countArray = [Int](repeating: 0, count: Int(maxElement + 1))
   for element in array {
     countArray[element] += 1
   }
@@ -29,7 +29,7 @@ func countingSort(array: [Int]) throws -> [Int] {
 
   // Step 3
   // Place the element in the final array as per the number of elements before it
-  var sortedArray = [Int](count: array.count, repeatedValue: 0)
+  var sortedArray = [Int](repeating: 0, count: array.count)
   for element in array {
     countArray[element] -= 1
     sortedArray[countArray[element]] = element
@@ -38,4 +38,4 @@ func countingSort(array: [Int]) throws -> [Int] {
 }
 
 
-try countingSort([10, 9, 8, 7, 1, 2, 7, 3])
+try countingSort(array: [10, 9, 8, 7, 1, 2, 7, 3])

Counting Sort/README.markdown

@@ -20,9 +20,9 @@ Count 0 1 1 1 0 0 0 2 1 1 1
 Here is the code to accomplish this:
 
 ```swift
-  let maxElement = array.maxElement() ?? 0
-  
-  var countArray = [Int](count: Int(maxElement + 1), repeatedValue: 0)
+  let maxElement = array.max() ?? 0
+
+  var countArray = [Int](repeating: 0, count: Int(maxElement + 1))
   for element in array {
     countArray[element] += 1
   }
@@ -62,7 +62,7 @@ Output 1 2 3 7 7 8 9 10
 Here is the code for this final step:
 
 ```swift
-  var sortedArray = [Int](count: array.count, repeatedValue: 0)
+  var sortedArray = [Int](repeating: 0, count: array.count)
   for element in array {
     countArray[element] -= 1
     sortedArray[countArray[element]] = element

Depth-First Search/DepthFirstSearch.playground/Pages/Simple Example.xcplaygroundpage/Contents.swift

@@ -1,4 +1,4 @@
-func depthFirstSearch(graph: Graph, source: Node) -> [String] {
+func depthFirstSearch(_ graph: Graph, source: Node) -> [String] {
   var nodesExplored = [source.label]
   source.visited = true
 

Depth-First Search/DepthFirstSearch.playground/Sources/Edge.swift

@@ -1,11 +1,11 @@
 public class Edge: Equatable {
   public var neighbor: Node
 
-  public init(neighbor: Node) {
+  public init(_ neighbor: Node) {
     self.neighbor = neighbor
   }
 }
 
-public func == (lhs: Edge, rhs: Edge) -> Bool {
+public func == (_ lhs: Edge, rhs: Edge) -> Bool {
   return lhs.neighbor == rhs.neighbor
 }

Depth-First Search/DepthFirstSearch.playground/Sources/Graph.swift

@@ -5,14 +5,14 @@ public class Graph: CustomStringConvertible, Equatable {
     self.nodes = []
   }
 
-  public func addNode(label: String) -> Node {
-    let node = Node(label: label)
+  public func addNode(_ label: String) -> Node {
+    let node = Node(label)
     nodes.append(node)
     return node
   }
 
-  public func addEdge(source: Node, neighbor: Node) {
-    let edge = Edge(neighbor: neighbor)
+  public func addEdge(_ source: Node, neighbor: Node) {
+    let edge = Edge(neighbor)
     source.neighbors.append(edge)
   }
 
@@ -27,7 +27,7 @@ public class Graph: CustomStringConvertible, Equatable {
     return description
   }
 
-  public func findNodeWithLabel(label: String) -> Node {
+  public func findNodeWithLabel(_ label: String) -> Node {
     return nodes.filter { $0.label == label }.first!
   }
 
@@ -50,6 +50,6 @@ public class Graph: CustomStringConvertible, Equatable {
   }
 }
 
-public func == (lhs: Graph, rhs: Graph) -> Bool {
+public func == (_ lhs: Graph, rhs: Graph) -> Bool {
   return lhs.nodes == rhs.nodes
 }

Depth-First Search/DepthFirstSearch.playground/Sources/Node.swift

@@ -5,7 +5,7 @@ public class Node: CustomStringConvertible, Equatable {
   public var distance: Int?
   public var visited: Bool
 
-  public init(label: String) {
+  public init(_ label: String) {
     self.label = label
     neighbors = []
     visited = false
@@ -22,11 +22,11 @@ public class Node: CustomStringConvertible, Equatable {
     return distance != nil
   }
 
-  public func remove(edge: Edge) {
-    neighbors.removeAtIndex(neighbors.indexOf { $0 === edge }!)
+  public func remove(_ edge: Edge) {
+    neighbors.remove(at: neighbors.index { $0 === edge }!)
   }
 }
 
-public func == (lhs: Node, rhs: Node) -> Bool {
+public func == (_ lhs: Node, rhs: Node) -> Bool {
   return lhs.label == rhs.label && lhs.neighbors == rhs.neighbors
 }

Depth-First Search/DepthFirstSearch.swift

@@ -1,4 +1,4 @@
-func depthFirstSearch(graph: Graph, source: Node) -> [String] {
+func depthFirstSearch(_ graph: Graph, source: Node) -> [String] {
   var nodesExplored = [source.label]
   source.visited = true
 

Depth-First Search/README.markdown

@@ -27,7 +27,7 @@ The parent of a node is the one that "discovered" that node. The root of the tre
 Simple recursive implementation of depth-first search:
 
 ```swift
-func depthFirstSearch(graph: Graph, source: Node) -> [String] {
+func depthFirstSearch(_ graph: Graph, source: Node) -> [String] {
   var nodesExplored = [source.label]
   source.visited = true
 

Deque/Deque-Optimized.swift

@@ -8,7 +8,7 @@ public struct Deque<T> {
   private var head: Int
   private var capacity: Int
 
-  public init(capacity: Int = 10) {
+  public init(_ capacity: Int = 10) {
     self.capacity = max(capacity, 1)
     array = .init(count: capacity, repeatedValue: nil)
     head = capacity
@@ -22,11 +22,11 @@ public struct Deque<T> {
     return array.count - head
   }
 
-  public mutating func enqueue(element: T) {
+  public mutating func enqueue(_ element: T) {
     array.append(element)
   }
 
-  public mutating func enqueueFront(element: T) {
+  public mutating func enqueueFront(_ element: T) {
     if head == 0 {
       capacity *= 2
       let emptySpace = [T?](count: capacity, repeatedValue: nil)