An Enhancement of the SMS (Scan, Move and Sort) algorithm applied to inventory system

ABSTRACT: Sorting is one of the most important operations that a computer can perform in a data. It is one of the most used algorithms in computing together with searching. Sorting plays a significant role in order to optimize the use of other algorithms that require sorted lists to work correctly. For this reason, many researchers try to find ways in order to produce sorting algorithms that are fast, efficient and inexpensive. For instance, an inventory system requires a sorting algorithm that works fast and efficiently when the total number of elements to be sorted is enormous. The SMS algorithm is considered as an enhancement on the Quicksort algorithm in the best, average, and worst cases when dealing with an input array of a large size and when the maximum and minimum values were small, especially when sorting a list of distinct elements. The first problem with regards to SMS algorithm is when sorting an array with frequent elements, the result is slow, so, the long sorting process will delay inventory system users in getting an inventory result. Another problem is sorting an array with frequent elements consumes large memory so, the system requires a bigger memory capacity. The proponents modified an enhanced the existing algorithm. The new algorithm is called the LiGa Algorithm or the Limbo Garcia Algorithm. It was implemented in an inventory system and the results were tested against the existing algorithm. The results were promising when it comes to sorting with speed, memory usage and value range capacity.

Filipiniana