Tweak linear search

- Move author name from the index page to the actual document
- You don't need to specify the `object` parameter label when calling the function

Author: hollance

Linear Search/LinearSearch.swift

@@ -1,6 +1,6 @@
-func linearSearch<T: Comparable>(array: [T], object:T) -> Int? {
-    for (index, obj) in array.enumerate() where obj == object {
-        return index
-    }
-    return nil
-}
+func linearSearch<T: Comparable>(array: [T], _ object: T) -> Int? {
+  for (index, obj) in array.enumerate() where obj == object {
+    return index
+  }
+  return nil
+}

Linear Search/README.markdown

@@ -15,11 +15,11 @@ We start by comparing the first number in the array, `5` with the number we're l
 Here is a simple implementation of insertion sort in Swift:
 
 ```swift
-func linearSearch<T: Comparable>(array: [T], object:T) -> Int? {
-    for (index, obj) in array.enumerate() where obj == object {
-        return index
-    }
-    return nil
+func linearSearch<T: Comparable>(array: [T], _ object: T) -> Int? {
+  for (index, obj) in array.enumerate() where obj == object {
+    return index
+  }
+  return nil
 }
 ```
 
@@ -39,3 +39,5 @@ The best-case performance is **O(1)** but this case is rare because the object w
 ### See also
 
 See also [Wikipedia](https://en.wikipedia.org/wiki/Linear_search).
+
+*Written by [Patrick Balestra](http://www.github.com/BalestraPatrick)*

README.markdown

@@ -28,7 +28,7 @@ If you're new to algorithms and data structures, here are a few good ones to sta
 
 ### Searching
 
-- [Linear Search](Linear Search/) (by [Patrick Balestra](http://www.github.com/BalestraPatrick))
+- [Linear Search](Linear Search/)
 - [Binary Search](Binary Search/). Quickly find elements in a sorted array.
 - Count Occurrences
 - Select Minimum / Maximum