krrrr0/Adaptive-Partition-Sort

Adaptive Partition Sort (APS) is a hybrid sorting method that merges Quick Sort and Merge Sort strengths. APS adapts to input data and a user-defined threshold, aiming for enhanced average-case performance while preserving stability and time complexity.

Adaptive-Partition-Sort

💡 Currently Prepraing for the KIISE KSC 2023 and IEEE TC.

Adaptive Partition Sort (APS) is a hybrid sorting method that merges the strengths of Quick Sort and Merge Sort. APS adapts to input data and a user-defined threshold, aiming for enhanced average-case performance while preserving stability and time complexity.

Time Complexity (APS/Timsort/introsort/quicksort)	Memory Complexity (APS/Timsort/introsort/quicksort)

Developed by:

• Ryan Donghan Kwon, Hana Academy Seoul (kznm.develop@gmail.com)
• DoHyun Lim, Korea Science Academy of KAIST (shiueo.csh@gmail.com)

Special thanks to:

• Jaeon Park (https://orcid.org/0009-0008-3144-4903) for Validate APS algorithms and optimize algorithms of comparison