added primitive documentation

Author: JulioBBL

Insertion Sort/InsertionSort.swift

@@ -1,3 +1,9 @@
+/// Performs the Insertion sort algorithm to a given array
+///
+/// - Parameters:
+///   - array: the array of elements to be sorted
+///   - isOrderedBefore: returns true if the elements provided are in the corect order
+/// - Returns: a sorted array containing the same elements
 func insertionSort<T>(_ array: [T], _ isOrderedBefore: (T, T) -> Bool) -> [T] {
   guard array.count > 1 else { return array }
 
@@ -14,6 +20,10 @@ func insertionSort<T>(_ array: [T], _ isOrderedBefore: (T, T) -> Bool) -> [T] {
   return a
 }
 
+/// Performs the Insertion sort algorithm to a given array
+///
+/// - Parameter array: the array to be sorted, conatining elements that conform to the Comparable protocol
+/// - Returns: a sorted array containing the same elements
 func insertionSort<T: Comparable>(_ array: [T]) -> [T] {
     var a = array
     for x in 1..<a.count {

Insertion Sort/Tests/Tests.xcodeproj/project.xcworkspace/xcshareddata/IDEWorkspaceChecks.plist

@@ -0,0 +1,8 @@
+<?xml version="1.0" encoding="UTF-8"?>
+<!DOCTYPE plist PUBLIC "-//Apple//DTD PLIST 1.0//EN" "http://www.apple.com/DTDs/PropertyList-1.0.dtd">
+<plist version="1.0">
+<dict>
+	<key>IDEDidComputeMac32BitWarning</key>
+	<true/>
+</dict>
+</plist>