基本的冒泡(O(n^2)):
public static void bubbleSort(int[] arrays, int begin, int end)
{
assert arrays != null;
for (int i = begin; i < end; i++)
{
for (int j = begin; j < end; j++)
{
if (arrays[i] > arrays[j])
{
swap(arrays, i, j);
}
}
}
}
private static void swap(int[] arrays, int a, int b)
{
int t = arrays[a];
arrays[a] = arrays[b];
arrays[b] = t;
}