Comparative Analysis of the Ternary Comma Code (TCC) Algorithm and the Fibonacci Algorithm in Text File Compression

he rapid growth of digital technology has led to an exponential increase in data volume, creating challenges in data storage and transmission efficiency. Data compression plays a critical role in addressing these issues, particularly for text files, which are among the most commonly used data formats. This study aims to perform a comparative analysis between the Ternary Comma Code (TCC) algorithm and the Fibonacci algorithm in text file compression. Experiments were conducted using various text files of different sizes, with key evaluation metrics including compression ratio, compression time, and decompression efficiency. The results indicate that each algorithm performs better under different conditions: TCC provides a higher compression ratio, while Fibonacci achieves faster processing times for small to medium-sized files. This research contributes to selecting the most suitable compression algorithm based on the specific needs and characteristics of the text data being compressed.