Abstract

Abstract: The efficiency and performance of sorting algorithms play a crucial role in various applications and industries. In this research paper, we present a comprehensive comparative analysis of popular sorting algorithms on datasets of different sizes and characteristics. The aim is to evaluate the algorithms' performance and identify their strengths and weaknesses under varying scenarios. We consider six commonly used sorting algorithms: QuickSort, TimSort, MergeSort, HeapSort, RadixSort, and ShellSort. These algorithms represent a range of approaches and techniques, including divide-and-conquer, hybrid sorting, and simple comparison-based methods. To assess their performance, we employ a diverse set of datasets, including the Iris dataset (1K), student dataset (5.8K), Wine dataset (6.5K), Uniform (10K), Normal (10K), Exponential (10K), Bimodal (10K), Yelp dataset (10K), MNIST dataset (42K), Uniform (100K), Normal (100K), Exponential (100K), Bimodal (100K), Uniform (500K), Normal (500K), Exponential (500K), Bimodal (500K), Uniform (1M), Normal (1M), Exponential (1M), and Bimodal (1M). These datasets cover a wide range of sizes and characteristics, allowing us to analyze the algorithms' performance across different dimensions. We measure and compare several key metrics, including execution time, memory usage, algorithmic complexity and stability. By analyzing these metrics, we gain insights into the efficiency and suitability of each algorithm for different dataset sizes and characteristics. We also discuss the implications of the findings in practical applications. Our results reveal important trade-offs among the sorting algorithms. While some algorithms excel in certain scenarios, others demonstrate better scalability or memory efficiency. We identify the best-performing algorithms for specific dataset characteristics and highlight their strengths and limitations. This research can assist developers and practitioners in selecting appropriate sorting algorithms based on their specific requirements and dataset characteristics. In conclusion, this comparative analysis provides a valuable contribution to the understanding of sorting algorithm performance. The findings contribute insights into the efficiency and suitability of popular sorting algorithms across datasets of different sizes and characteristics. By evaluating key metrics and discussing the implications, we offer guidance for selecting the most appropriate sorting algorithm in various practical scenarios.