Implementasi Algoritma Insertion Sort dan Interpolation Search dalam Penentuan Member Berprestasi Di Asrama Bahasa

Abstract

Managing student grade data at the Language Dormitory requires a system capable of performing ranking and data retrieval quickly and accurately. The current manual process has the potential to cause delays and errors in compiling rankings. This study aims to implement the Insertion Sort and Interpolation Search algorithms in the student grade management system. Specifically conducted at the Central Language Dormitory of Pondok Pesantren Salafiyah Syafi’iyah Sukorejo, this study integrates data such as student IDs, names, and average scores into an array data structure. Insertion Sort is utilized to sort the average exam scores from highest to lowest, while Interpolation Search is leveraged to accelerate the data retrieval process based on the searched score. Testing was conducted using 70 student grade records to evaluate the performance of both algorithms. The results indicate that Insertion Sort is capable of consistently producing sorted grades without requiring significant additional storage space, thanks to its stable and in-place processing characteristics. Meanwhile, Interpolation Search can locate data rapidly when applied to datasets with a relatively even distribution of values. Through its position calculation formula, this search algorithm proved to be highly efficient with an average time complexity of , where in the tracking experiment for the highest score of 88.70, the data was successfully found instantly in just 1 iteration. The implementation of both algorithms helps improve the efficiency of academic data management, speeds up the ranking and retrieval processes, and reduces the likelihood of errors in processing student grade data.