Add PagedMergeSort, a merge sort using O(√n) space

Project.toml

@@ -1,6 +1,6 @@
 name = "SortingAlgorithms"
 uuid = "a2af1166-a08f-5f64-846c-94a0d3cef48c"
-version = "1.1.0"
+version = "1.1.1"
 
 [deps]
 DataStructures = "864edb3b-99cc-5e75-8d2d-829cb0a9cfe8"

README.md

@@ -9,10 +9,15 @@ 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.
+- [PagedMergeSort] – a stable, general purpose, O(n log n) time and O(sqrt n) space comparison sort.
+- [ThreadedPagedMergeSort] – a stable, general purpose, O(n log n) time and O(sqrt n) space comparison sort using multithreaded [parallel recursion].
 
 [HeapSort]: https://en.wikipedia.org/wiki/Heapsort
 [TimSort]:  https://en.wikipedia.org/wiki/Timsort
 [CombSort]: https://en.wikipedia.org/wiki/Comb_sort
+[PagedMergeSort]: https://link.springer.com/chapter/10.1007/BFb0016253
+[ThreadedPagedMergeSort]: https://link.springer.com/chapter/10.1007/BFb0016253
+[parallel recursion]: https://en.wikipedia.org/wiki/Merge_sort#Merge_sort_with_parallel_recursion
 
 ## Usage