java冒泡法排序源码

将做工程过程中经常用的内容收藏起来，下面的代码段是关于java冒泡法排序的代码。

public static void bubbleSort(int[] data)
{
for (int k = 0; k < data.length - 1; k++)
{
boolean isSorted = true;

  for (int i = 1; i < data.length - k; i++)  
  {  
     if (data[i] < data[i - 1])  
     {  
        int tempVariable = data[i];  
        data[i] = data[i - 1];  
        data[i - 1] = tempVariable;  

        isSorted = false;  

     }  
  }  

  if (isSorted)  
     break;  

}
}

代码2

static int[] BubbleSort(int[] nums)
{
boolean unsorted = true;
while (unsorted)
{
unsorted = false;
for (int i = nums.length - 1; i > 0; i–)
{
if (nums[i] < nums[i-1])
{
int temp = nums[i];
nums[i] = nums[i-1];
nums[i-1] = temp;
unsorted = true;
}
}
}
return nums;
}