<![CDATA[This study examines the application of the Merge Sort algorithm in the process of sorting student academic data within an academic information system (SIAKAD). The issue addressed is the suboptimal processing of academic data, which has the potential to cause delays and errors in the presentation of information. The objective of this study is to implement and evaluate the performance of the Merge Sort algorithm by comparing it with Bubble Sort and Insertion Sort. The method used is an experimental approach through testing on various dataset sizes, ranging from small to large scales, as well as under different data conditions, namely random, sorted, and reversed. Implementation was carried out using a Command Line Interface (CLI)-based application and a web interface to simulate real-world usage. The results of the study indicate that Merge Sort performs more efficiently and consistently than other algorithms, particularly on large datasets. Additionally, this algorithm possesses stable sort properties that maintain the relative order of data with the same values, making it more reliable for academic data processing.]]>
Copyrights © 2026
