Merge pull request kodecocodes#862 from bbvch13531/master

Fix wrong description and typo.

Author: richard-ash

Insertion Sort/InsertionSort.swift

@@ -22,7 +22,7 @@ func insertionSort<T>(_ array: [T], _ isOrderedBefore: (T, T) -> Bool) -> [T] {
 
 /// Performs the Insertion sort algorithm to a given array
 ///
-/// - Parameter array: the array to be sorted, conatining elements that conform to the Comparable protocol
+/// - Parameter array: the array to be sorted, containing elements that conform to the Comparable protocol
 /// - Returns: a sorted array containing the same elements
 func insertionSort<T: Comparable>(_ array: [T]) -> [T] {
     guard array.count > 1 else { return array }

Linked List/LinkedList.swift

@@ -67,7 +67,7 @@ public final class LinkedList<T> {
     /// - Returns: LinkedListNode
     public func node(at index: Int) -> Node {
         assert(head != nil, "List is empty")
-        assert(index >= 0, "index must be greater than 0")
+        assert(index >= 0, "index must be greater or equal to 0")
 
         if index == 0 {
             return head!