Update README.md

Add countingSort and linearSearch.

Author: evbacher

README.md

@@ -14,3 +14,19 @@ See https://en.wikipedia.org/wiki/Bubble_sort for a general overview. My first c
 * [quicksort.go](https://github.com/evbacher/algorithms/blob/main/sorting/quicksort.go)
 
 See https://en.wikipedia.org/wiki/Quicksort and Programming Pearls by Jon Bentley for information about this algorithm.
+
+### Counting sort
+
+* [countingSort.go](https://github.com/evbacher/algorithms/blob/main/sorting/countingSort.go)
+
+A distribution sort that can be faster than quicksort for large collections of integers with a relatively small range of values (say 1000).
+
+# Search algorithms
+
+### Linear search
+
+* [linearSearch.go](https://github.com/evbacher/algorithms/blob/main/search/linearSearch.go)
+
+When you have an unsorted array, linear search (a brute force check of every element) may be the only option.
+
+