PDMerge is short for Pattern-Defeating Mergesort. It is a O(n) best case time, O(n log n) worst-case, and O(n) space complexity. It is a runs-adaptive algorithm and it comes in three variants.
-
Updated
May 2, 2021 - Java
PDMerge is short for Pattern-Defeating Mergesort. It is a O(n) best case time, O(n log n) worst-case, and O(n) space complexity. It is a runs-adaptive algorithm and it comes in three variants.
Add a description, image, and links to the runs-adaptive topic page so that developers can more easily learn about it.
To associate your repository with the runs-adaptive topic, visit your repo's landing page and select "manage topics."