A Java implementation and benchmarking study of a hybrid sorting algorithm combining modified Quicksort with Counting Sort, based on the paper "Improving Counting Sort Algorithm Via Data Locality" (ACMSE 2022). Evaluates cache performance and runtime across three experiments comparing standard and hybrid approaches
java benchmarking sorting performance research algorithms quicksort junit insertion-sort counting-sort cache-optimization
-
Updated
Apr 20, 2026 - Java