Show HN: MinMAX Sort – A Stable Bidirectional Selection Sort Family Algorithm

Category: other

Tags: sorting, algorithm, java, education

Score: 4.0/10 (Innovation: 3, Technical: 4, Documentation: 6, Utility: 3)

MinMAX Sort is a hobbyist variant of selection sort that finds both the minimum and maximum elements per pass, halving the number of comparisons compared to standard selection sort. While interesting as a learning exercise, the algorithm offers limited practical value since its O(n²) complexity is inferior to well-known O(n log n) sorts, and the improvement over existing double-selection sort variants is marginal.

Target audience: computer science students and algorithm enthusiasts

Repository: https://github.com/tsuJack-Devs/minMAX-Sorting-Algorithm · Java · GPL-3.0

View on Hacker News