Skip to content

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.

License

Notifications You must be signed in to change notification settings

ryankwondev/Adaptive-Partition-Sort

Folders and files

NameName
Last commit message
Last commit date

Latest commit

 

History

93 Commits
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 

Repository files navigation

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 Performance Compared
(APS/Timsort/introsort/quicksort)
Memory Performance Compared
(APS/Timsort/introsort/quicksort)

Developed by:

Research Contributers:

  • Jeongyeon Park, Hana Academy Seoul (has_21073@hana.hs.kr) for Build a strategy for advanced validation of algorithms with data diversification, etc
  • Taewoo Yu, Korea Science Academy of KAIST (clif1593@gmail.com) for Reproduce algorithms in C++ to get more objective data on algorithmic competitiveness, etc
  • Jeongsik Jeongsik, Kyunghee University (ori@khu.ac.kr) for Advance research and find the right $T$ value

Special thanks to:

  • Jaeon Park (me@finalchild.dev) for Validate APS algorithms and optimize algorithms of comparison

About

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.

Resources

License

Stars

Watchers

Forks

Releases

No releases published

Packages

No packages published