Added Testing Table to Linear Search Project (#360)

* Added testing table to linear search

* Update index.md

Author: jrg94

projects/linear-search/index.md

@@ -2,24 +2,29 @@
 title: Linear Search in Every Language
 layout: default
 date: 2019-10-17
-last-modified: 2020-05-02
+last-modified: 2020-10-15
 featured-image:
 tags: [linear-search]
 authors:
   - frankhart2017
+  - the_renegade_coder
 ---
 
 This article introduces Linear Search which is the simplest search algorithm.
 
 ## Description
 
-Linear search is quite intuitive, it is basically searching an element in an array by traversing the array from the beginning to the end and comparing each item in the array with the key. If a particular array entry matches with the key the position is recorded and the loop is stopped. The algorithm for this is:
+Linear search is quite intuitive, it is basically searching an element in an array by traversing 
+the array from the beginning to the end and comparing each item in the array with the key. If a 
+particular array entry matches with the key the position is recorded and the loop is stopped. 
+The algorithm for this is:
 
 1. Define a flag (set it's value to 0) for checking if key is present in array or notation.
 2. Iterate through every element in array.
 3. In each iteration compare the key and the current element.
 4. If they match set the flag to 1, position to the current iteration and break from the loop.
-5. If entire loop is traversed and the element is not found the value of flag will be 0 and user can notified that key is not in array.
+5. If entire loop is traversed and the element is not found the value of flag will be 0 and user 
+can notified that key is not in array.
 
 ### Performance
 
@@ -43,7 +48,7 @@ Linear search is not efficient for large arrays, but for relatively smaller arra
 <br>key != array[i]
 
 <b>Iteration 2</b>
-<br>array[i] = array[i] = 2
+<br>array[i] = array[1] = 2
 <br>key = 3
 <br>key != array[i]
 
@@ -57,38 +62,41 @@ Linear search is not efficient for large arrays, but for relatively smaller arra
 
 ## Requirements
 
-Write a sample program that takes a key in the format 3 and a list of numbers in the format "1, 2, 3, 4, 5".
+Write a sample program that takes a list of numbers (e.g. "1, 2, 3, 4, 5") and a key (e.g. "3").
 
-### C++ Program
-
-```console
-$ cd archives/c/c-plus-plus/
-$ g++ -o linear-search linear-search.cpp
-$ ./linear-search 3 "1, 2, 3, 4, 5"
-3 found at position 2.
 ```
-
-### Python Program
-
-```console
-$ cd archives/p/python/
-$ python linear-search.py 6 "1, 2, 3, 4, 5"
-6 not found in the array .
+linear-search.lang "1, 4, 2, 9" "3"
 ```
 
 In addition, there should be some error handling for situations where the user
 doesn't supply correct input.
 
+## Testing
+
+| Description               | List Input   | Target Integer Input | Output  |
+|---------------------------|--------------|----------------------|---------|
+| No Input                  |              |                      | error\* |
+| Missing Input: List       | `1, 2, 3, 4` |                      | error\* |
+| Missing Input: Target     | `""`         | `5`                  | error\* |
+| Sample Input: First True  | `1, 3, 5, 7` | `1`                  | `true`  |
+| Sample Input: Last True   | `1, 3, 5, 7` | `7`                  | `true`  |
+| Sample Input: Middle True | `1, 3, 5, 7` | `5`                  | `true`  |
+| Sample Input: One True    | `5`          | `5`                  | `true`  |
+| Sample Input: One False   | `5`          | `7`                  | `false` |
+| Sample Input: Many False  | `1, 3, 5, 6` | `7`                  | `false` |
+
+\*The error string to print: `Usage: please provide a list of integers ("1, 4, 5, 11, 12") and the integer to find ("11")`
+
 ## Articles
 
 {% include article_list.md collection=site.categories.linear-search %}
 
 ## Further Readings
 
-- [Linear search on Wikipedia][1]
-- [A beginner's guide to Big O notation- Rob Bell][2]
-- [Big O notation on Wikipedia][3]
+- [Linear search on Wikipedia][linear-search-wiki]
+- [A beginner's guide to Big O notation- Rob Bell][big-o-notation-guide]
+- [Big O notation on Wikipedia][big-o-notation-wiki]
 
-[1]: https://en.wikipedia.org/wiki/Linear_search
-[2]: https://rob-bell.net/2009/06/a-beginners-guide-to-big-o-notation/
-[3]: https://en.wikipedia.org/wiki/Big_O_notation
+[linear-search-wiki]: https://en.wikipedia.org/wiki/Linear_search
+[big-o-notation-guide]: https://rob-bell.net/2009/06/a-beginners-guide-to-big-o-notation/
+[big-o-notation-wiki]: https://en.wikipedia.org/wiki/Big_O_notation