Correct some typos (#75)

Author: goggle

README.md

@@ -8,7 +8,7 @@ The `SortingAlgorithms` package provides three sorting algorithms that can be us
 
 - [HeapSort] – an unstable, general purpose, in-place, O(n log n) comparison sort that works by heapifying an array and repeatedly taking the maximal element from the heap.
 - [TimSort] – a stable, general purpose, hybrid, O(n log n) comparison sort that adapts to different common patterns of partially ordered input data.
-- [CombSort] – an unstable, general purpose, in-place, O(n log n) comparison sort with O(n^2) pathological cases that can attain good efficiency through SIMD instructions and instruction level paralellism on modern hardware.
+- [CombSort] – an unstable, general purpose, in-place, O(n log n) comparison sort with O(n^2) pathological cases that can attain good efficiency through SIMD instructions and instruction level parallelism on modern hardware.
 
 [HeapSort]: https://en.wikipedia.org/wiki/Heapsort
 [TimSort]:  https://en.wikipedia.org/wiki/Timsort

src/SortingAlgorithms.jl

@@ -22,7 +22,7 @@ end
 const HeapSort  = maybe_optimize(HeapSortAlg())
 const TimSort   = maybe_optimize(TimSortAlg())
 # Whenever InitialOptimizations is defined, RadixSort falls 
-# back to Base.DEFAULT_STABLE which already incldues them.
+# back to Base.DEFAULT_STABLE which already includes them.
 const RadixSort = RadixSortAlg()
 
 """