💡 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 Performance Compared (APS/Timsort/introsort/quicksort) |
---|
![]() |
Memory Performance Compared (APS/Timsort/introsort/quicksort) |
![]() |
- Ryan Donghan Kwon
, Hana Academy Seoul ([email protected])
- DoHyun Lim, Korea Science Academy of KAIST ([email protected])
- Jeongyeon Park, Hana Academy Seoul ([email protected]) for Build a strategy for advanced validation of algorithms with data diversification, etc
- Taewoo Yu
, Korea Science Academy of KAIST ([email protected]) for Reproduce algorithms in C++ to get more objective data on algorithmic competitiveness, etc
- Jeongsik Jeongsik
, Kyunghee University ([email protected]) for Advance research and find the right
$T$ value
- Jaeon Park
([email protected]) for Validate APS algorithms and optimize algorithms of comparison