Computer Science & Electrical
Volume: 101 , Issue: 1 , May Published Date: 01 June 2022
Publisher Name: IJRP
Views: 622 , Download: 788 , Pages: 583 - 591
DOI: 10.47119/IJRP1001011520223223
Publisher Name: IJRP
Views: 622 , Download: 788 , Pages: 583 - 591
DOI: 10.47119/IJRP1001011520223223
Authors
| # | Author Name |
|---|---|
| 1 | Jeanus Marco Caraig |
| 2 | Nicole Anne Marie Cruz |
| 3 | Vivien Agustin |
| 4 | Khatalyn Mata |
| 5 | Dan Michael Cortez |
Abstract
The Super Sort Sorting algorithm is a sorting algorithm that uses forward selection, backward selection, merging, and partition to sort a given list or data set. This study will focus on the enhancement of the Super Sort Sorting Algorithm on the forward selection part. This paper introduces an enhanced version of the algorithm where the concept of Identical Value Search was implemented on the first forward pass. This method eliminated the small sublists left behind by the original algorithm's forward pass and reduced the overall runtime of the algorithm.