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.