Bubble Sorting Algorithm

Public void bubblesort (INT [] r)
{
Int I, j, temp; // exchange flag

Bool exchange;

For (I = 0; I <R. length; I ++) // sort a maximum of R. Length-1 bits.
{
Exchange = false; // The exchange flag should be false before this sort starts.

For (j = R. Length-2; j> = I; j --)
{
If (R [J + 1] <R [J]) // exchange condition
{
Temp = R [J + 1];
R [J + 1] = R [J];
R [J] = temp;

Exchange = true; // The exchange flag is set to true due to exchange.
}
}

If (! Exchange) // This sort order has not been exchanged and is terminated in advanceAlgorithm
{
Break;
}
}
}