An Exploratory Study of Critical Factors Affecting the Efficiency of Sorting Techniques (Shell, Heap and Treap)
Olusegun Folorunso, Olufunke R. Vincent, Oluwatimilehin Salako

TL;DR
This paper investigates the factors influencing the efficiency of Shell, Heap, and Treap sorting algorithms, focusing on their runtime and memory usage through experimental analysis and factor analysis.
Contribution
It provides an empirical comparison of three sorting techniques, identifying key factors affecting their efficiency, especially highlighting sorting time as the main factor.
Findings
Sorting time is the primary factor affecting efficiency.
Heap sort generally outperforms Shell and Treap in speed.
Memory usage varies among the techniques but is less influential.
Abstract
The efficiency of sorting techniques has a significant impact on the overall efficiency of a program. The efficiency of Shell, Heap and Treap sorting techniques in terms of both running time and memory usage was studied, experiments conducted and results subjected to factor analysis by SPSS. The study revealed the main factor affecting these sorting techniques was time taken to sort.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsEvolutionary Algorithms and Applications · Machine Learning and Data Classification · Software Testing and Debugging Techniques
