Improving Merge Sort and Quick Sort Performance by Utilizing Alphadev’s Sorting Networks as Base Cases
Anas Gamal Aly, Anders E. Jensen, and Hala Elaarag
In Proceedings of the 2025 ACM Southeast Conference, Southeast Missouri State University, Cape Girardeau, MO, USA, May 2025
Given to the best paper with a length of 6 pages or fewer.
Recent work by Google DeepMind introduced assembly-optimized sorting networks that achieve faster performance for small fixed-size arrays (3-8). In this research, we investigate the integration of these networks as base cases in classical divide-and-conquer sorting algorithms, specifically Merge Sort and Quick Sort, to leverage these efficient sorting networks for small subarrays generated during the recursive process. We conducted benchmarks with 11 different optimization configurations and compared them to classical Merge Sort and Quick Sort. We tested the configurations with random, sorted and nearly sorted arrays.Our optimized Merge Sort, using a configuration of three sorting networks (sizes 6, 7, and 8), achieves at least 1.5x speedup for random and nearly sorted arrays, and at least 2x speedup for sorted arrays, in comparison to classical Merge Sort. This optimized Merge Sort surpasses both classical Quick Sort and similarly optimized Quick Sort variants when sorting random arrays of size 10,000 and larger.When comparing our optimized Quick Sort to classical Quick Sort, we observe a 1.5x speedup using the 3-to-5 configuration on sorted arrays of size 10,000. The 6-to-8 configuration maintains a consistent 1.5x improvement across sorted arrays from 25,000 to 1 million elements. Our findings demonstrate the potential of integrating AI-optimized sorting networks to enhance the performance of classical sorting algorithms.
No Pedestrian Left Behind (NPLB): Real-Time Detection and Tracking of Vulnerable Road Users for Adaptive Traffic Signal ControlIn Proceedings of the 2026 ACM Southeast Conference, Troy University, Troy, Alabama, USA, Apr 2026Under Review
Improving Merge Sort and Quick Sort Performance by Utilizing Alphadev’s Sorting Networks as Base CasesIn Proceedings of the 2025 ACM Southeast Conference, Southeast Missouri State University, Cape Girardeau, MO, USA, May 2025
Hands-on PDC in Undergraduate Computing EducationIn Journal of Computing Sciences in Colleges, Mercer University, Macon, GA, USA, Nov 2025Forthcoming
