Title: Comparative Study of Traditional and AI-Enhanced Sorting Algorithms: QuickSort, MergeSort, HeapSort, and TimSort
Authors: Beesan Mohammed Al-Aydi , Samy S. Abu-Naser
Volume: 9
Issue: 8
Pages: 70-79
Publication Date: 2025/08/28
Abstract:
Sorting is a core operation in data processing and algorithm design, critical for efficient search, data analysis, and organization. This paper presents a comparative study of four prominent sorting algorithms: QuickSort, MergeSort, HeapSort, and TimSort. Both traditional and AI-enhanced implementations are explored. The objective is to analyze their computational complexities, practical performance, scalability, and adaptability to various data types. Python implementations are provided, and the potential for artificial intelligence to optimize algorithm behavior is investigated. The results demonstrate that AI-enhanced strategies can significantly improve performance for large and complex datasets.