Sort Algorithm (3) bubble sort

Bubble Sorting

Traverse arrays in sequence

Traverse the array from the beginning each time and move the maximum value to the rightmost end

 

Code Implementation

[Html]
Package com. robert. paixu;
 
/**
* Bubble Sorting
* From small to large
* @ Author Administrator
*/
Public class BubbleSortAlgorithm {

Public static void main (String [] args)
{
Int [] arrays = };
BubbleSort (arrays );
Display (arrays );
}

/**
* Bubble Sorting
* @ Param arrays
*/
Private static void bubbleSort (int [] arrays)
{
Int temp = 0;
For (int I = 0; I <arrays. length-1; I ++)
{
For (int j = 0; j <arrays. length-i-1; j ++)
{
If (arrays [j]> arrays [j + 1])
{
Temp = arrays [j];
Arrays [j] = arrays [j + 1];
Arrays [j + 1] = temp;
}
}
}
}

/**
* Display the array value
* @ Param arrays
*/
Private static void display (int [] arrays)
{
For (int I = 0; I <arrays. length; I ++)
{
System. out. print (arrays [I] + "");
}
}
}

The time complexity of this algorithm is:

Under any circumstances, all are O (n ^ 2)