An Optimizing Heap Sort for Repeated Values: A Modified Approach to Improve Efficiency in Duplicate-Heavy Data Sets
Main Article Content
Abstract
Sorting algorithms are critical to various computer science applications, including database management, big data analytics, and real-time systems. While Heap Sort is a widely used comparison-based sorting algorithm, its efficiency significantly diminishes when dealing with data sets containing a high volume of duplicate values. To address this limitation, this paper introduces a modified Heap Sort algorithm optimized for duplicate-heavy data. The proposed modification detects and handles duplicate values more efficiently by reducing unnecessary comparisons and swaps at the root of the heap and restructuring the heap more strategically. Experimental results demonstrate that the modified Heap Sort achieves up to a 15% reduction in sorting time, a 30% decrease in the number of swaps, and a 10% reduction in comparisons when tested on data sets with varying levels of duplication. These improvements highlight the enhanced computational efficiency and scalability of the modified algorithm in duplicate-heavy data scenarios. This advancement offers significant potential for improving sorting performance in practical domains such as big data analytics, database operations, and real-time data processing.
Downloads
Article Details
COPYRIGHT
Submission of a manuscript implies: that the work described has not been published before, that it is not under consideration for publication elsewhere; that if and when the manuscript is accepted for publication, the authors agree to automatic transfer of the copyright to the publisher.
Authors who publish with this journal agree to the following terms:
- Authors retain copyright and grant the journal right of first publication with the work simultaneously licensed under a Creative Commons Attribution License that allows others to share the work with an acknowledgment of the work's authorship and initial publication in this journal.
- Authors are able to enter into separate, additional contractual arrangements for the non-exclusive distribution of the journal's published version of the work (e.g., post it to an institutional repository or publish it in a book), with an acknowledgment of its initial publication in this journal.
- Authors are permitted and encouraged to post their work online (e.g., in institutional repositories or on their website) prior to and during the submission process, as it can lead to productive exchanges, as well as earlier and greater citation of published work
- The journal allows the author(s) to retain publishing rights without restrictions.
- The journal allows the author(s) to hold the copyright without restrictions.