JAVA basics: JAVA Implementation of the Bubble Sorting Algorithm

Package Utils. Sort;

/**

* @ Author Linyco

* Sort the Array Using the Bubble sorting method. The elements in the array must implement the Comparable interface.

*/Public class BubbleSort implements SortStrategy

{

/**

* Sort the elements in the array obj by the Bubble Sorting Algorithm.

*/

Public void sort (Comparable [] obj)

{If (obj = null)

{Throw new NullPointerException ("The argument can not be null! ");

} Comparable tmp;

For (int I = 0; I <obj. length; I ++)

{// Remember, each time the ratio starts from the first one. The final comparison is unnecessary.

For (int j = 0; j <obj. length-I-1; j ++)

{// Compare the adjacent elements. If the backend is small, it is switched.

If (obj [j]. compareTo (obj [j + 1])> 0)

{Tmp = obj [j];

Obj [j] = obj [j + 1];

Obj [j + 1] = tmp;

}}

}}}