How to implement bubble sort algorithm using java

How to use Java to implement the bubble sort algorithm

Bubble Sort (Bubble Sort) is a simple sorting algorithm. Its basic idea is to sort adjacent elements Comparison and exchange, gradually "bubble" the larger elements in the sequence to be sorted to the last position. In actual development, although bubble sorting is less efficient, it is simple to understand and easier to implement. Below we will introduce in detail how to implement the bubble sort algorithm using Java language, and attach specific code examples.

The specific implementation ideas of bubble sorting are as follows:

1. First, compare two adjacent elements. If the former is greater than the latter, their positions are swapped.
2. Compare and exchange each pair of adjacent elements, and traverse the entire sequence to be sorted from beginning to end until the end of the sequence.
3. After this round of comparison, the largest element in the sequence is ranked at the end.
4. Repeat the above steps for the remaining unsorted elements until the entire sequence is sorted.

The following is a code example using Java language to implement the bubble sort algorithm:

public class BubbleSort {
    public static void bubbleSort(int[] arr) {
        int n = arr.length;
        // 外层循环控制比较轮数
        for (int i = 0; i < n - 1; i++) {
            // 内层循环控制每一轮的比较次数
            for (int j = 0; j < n - i - 1; j++) {
                // 如果当前元素大于后一个元素，则交换它们的位置
                if (arr[j] > arr[j + 1]) {
                    int temp = arr[j];
                    arr[j] = arr[j + 1];
                    arr[j + 1] = temp;
                }
            }
        }
    }

    public static void main(String[] args) {
        int[] arr = {64, 34, 25, 12, 22, 11, 90};
        System.out.println("排序前的数组:");
        for (int i : arr) {
            System.out.print(i + " ");
        }
        System.out.println();

        bubbleSort(arr);

        System.out.println("排序后的数组:");
        for (int i : arr) {
            System.out.print(i + " ");
        }
    }
}

In the above code, we first define a bubbleSort method, which receives An integer array is used as a parameter, and the logic of bubble sort is implemented in this method. In the main method, we create an integer array arr and initialize it. Then, we call the bubbleSort method to sort the array, and output the results before and after sorting on the console.

Run the above code, the output result is as follows:

排序前的数组:
64 34 25 12 22 11 90 
排序后的数组:
11 12 22 25 34 64 90

We can see that after bubble sorting, the array is arranged in order from small to large.

The above is the method and code example of using Java language to implement the bubble sort algorithm. The principle of bubble sort is relatively simple, but it is less efficient when processing large-scale data. Therefore, other efficient sorting algorithms are more commonly used in actual development. However, by learning and understanding the idea and implementation process of bubble sort, it can help us better understand and apply other sorting algorithms.

The above is the detailed content of How to implement bubble sort algorithm using java. For more information, please follow other related articles on the PHP Chinese website!