What is the simplest way to write bubble sort in java

The simplest way to write Java bubble sort: 1. Use two nested for loops to compare adjacent elements and exchange them. The outer loop controls the number of rounds of comparison and exchange, and the inner loop uses By traversing the array and performing comparison and exchange operations, after each round of the inner loop, the largest element will be swapped to the end of the array; 2. Use the main method to create an array containing some integers, and call the bubbleSort method to sort the array Sort; 3. Print the sorted array, etc.

# Operating system for this tutorial: Windows 10 system, Dell G3 computer.

The simplest way to write Java bubble sort is as follows:

public class BubbleSort { public static void bubbleSort(int[] arr) { int n = arr.length; boolean swapped; for (int i = 0; i < n - 1; i++) { swapped = false; 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; swapped = true; } } // 如果没有发生交换，则数组已经有序，可以提前结束循环 if (!swapped) { break; } } } public static void main(String[] args) { int[] arr = {64, 34, 25, 12, 22, 11, 90}; bubbleSort(arr); System.out.println("排序后的数组："); for (int i = 0; i < arr.length; i++) { System.out.print(arr[i] + " "); } } }

In this simple bubble sort implementation, we use two nested for loops to compare adjacent elements and Make an exchange. The outer loop controls the number of rounds of comparison and exchange, and the inner loop is used to traverse the array and perform comparison and exchange operations. After each round of the inner loop, the largest element is swapped to the end of the array. The end condition of the inner loop is n - i - 1, where n is the length of the array and i is the index of the outer loop. The inner loop also uses a swapped flag to determine whether a swap has occurred. If no swap has occurred, it means that the array is in order and the loop can be ended early.

In the main method, we create an array containing some integers and call the bubbleSort method to sort the array. Finally, we print the sorted array.

The time complexity of this simple bubble sort implementation is O(n^2), where n is the length of the array. Although this implementation is simple and easy to understand, it is less efficient for large data sets. Therefore, in practical applications, other more efficient sorting algorithms may need to be considered.

The above is the detailed content of What is the simplest way to write bubble sort in java. For more information, please follow other related articles on the PHP Chinese website!