Analisis Algoritma Bubble Sort Ascending/Descending Pada Bahasa Pemrograman Java

Abstract

Bubble Sort Algorithm is one of the fundamental sorting methods commonly used to introduce the concept of sorting in computer science. This study analyzes the implementation of the Bubble Sort algorithm for ascending and descending sorting in the Java programming language, focusing on complexity, operational steps, and execution performance. The research methodology includes literature review, Java code development for both sorting modes, and testing using various data scenarios (random, sorted, and reverse sorted). The analysis results indicate that the ascending and descending implementations differ only in the element comparison condition, yet both have a time complexity of O(n²) in average and worst cases. Testing with small to medium-sized data reveals that the number of comparison and swapping steps depends on the initial data condition. In the best case (already sorted data), the time complexity reaches O(n), while in the worst case (reverse sorted data), the maximum number of operations is required. Although inefficient for large datasets, Bubble Sort remains relevant in educational contexts and simple applications due to its logical simplicity and ease of implementation. This study concludes that a deep understanding of this algorithm can serve as a foundation for learning more complex sorting techniques.