Sort method -- bubble sort (use an array to sort a string of numbers from large to small or from small to large)

The basic idea of bubble sorting ： By treating the sort sequence from front to back , Compare the sorting codes of adjacent elements in turn
 * If reverse order is found, exchange , Make the elements with larger sorting code gradually move from the front to the back .（ Most comments are in the code ）

package com.atcording.java;
/*
 *  Implementation of bubble sorting of array 
 *  The basic idea of bubble sorting ： By treating the sort sequence from front to back , Compare the sorting codes of adjacent elements in turn 
 *  If reverse order is found, exchange , Make the elements with larger sorting code gradually move from the front to the back .
 */
public class BubbleSort {
	public static void main(String[] args){
	int[] arr=new int[]{2,450,63,12,78,92,438,-32,21,79};// Define an unordered array to be sorted ;
/*
 *  Set up a two-layer loop , The inner loop finds out the maximum number participating in the loop once every cycle, and arranges it in the last position ,
 *  In the second cycle, find the second largest number and arrange it in the penultimate position , By analogy , The purpose of outer circulation is to ensure 
 *  The number of times the inner loop is carried out ( For example, ten numbers are sorted from small to large , Each time the inner loop is executed, find a maximum number and rank last ,
 *  In the second cycle, find the second largest number and arrange it in the penultimate position , By analogy , In order to arrange the size of ten numbers, we need to carry out this inner loop 
 *  therefore i<arr.length It refers to the inner circulation to be carried out arr.length-1 Time ,arr.length Is to get an array arr The length of is 10)
 */
	 
		for(int i=0;i<arr.length;i++){//i<arr.length It refers to the inner circulation to be carried out arr.length-1 Time 
			
			for( int j=0;j<arr.length-1;j++){
				if(arr[j]>arr[j+1]){
					// Compare two adjacent numbers , If the number in front is greater than the number in the back, exchange positions 
					int temp=arr[j];
					arr[j]=arr[j+1];
					arr[j+1]=temp;
				}
			}
			// Each time the inner loop is run, the result is output , Convenient for observation , To comment out 
			System.out.print(" The inner layer circulates for the first "+(i+1)+" The results of the round are as follows ");
			System.out.println();// Line break 
			for(int b=0;b<arr.length;b++){
				
				System.out.print(arr[b]+" ");
				}
			System.out.println();// Line break 
		}
		// Output final results 
		System.out.print(" The final results are as follows ：");
		System.out.println();// Line break 
		for(int i=0;i<arr.length;i++){
		System.out.print(arr[i]+" ");
		}
		}
	
}

The results are shown in the following figure , The output result of each round through the inner circulation is convenient to observe its principle