https://github.com/gaming32/pdmerge
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.
https://github.com/gaming32/pdmerge
adaptive runs-adaptive sorting sorting-algorithms sorting-algorithms-implemented
Last synced: 8 months ago
JSON representation
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.
- Host: GitHub
- URL: https://github.com/gaming32/pdmerge
- Owner: Gaming32
- License: mit
- Created: 2021-05-02T00:59:13.000Z (over 4 years ago)
- Default Branch: main
- Last Pushed: 2021-05-02T21:33:20.000Z (over 4 years ago)
- Last Synced: 2025-02-03T10:18:19.846Z (10 months ago)
- Topics: adaptive, runs-adaptive, sorting, sorting-algorithms, sorting-algorithms-implemented
- Language: Java
- Homepage:
- Size: 20.5 KB
- Stars: 0
- Watchers: 3
- Forks: 0
- Open Issues: 0