排序算法整理(4)冒泡排序

//bubble sort
void bubble_sort(int* arr,int len)
{
   int t = 0,temp = 0;
   for (int i = 0;i<len-1;i++)
    {
       for(int j = 0;j<len - 1-i;j++)
       {   t = j+1;
           if(arr[j]<arr[t])
           {
                temp = arr[j];
                arr[j] = arr[t];
                arr[t] = temp;
           }
       }
    }
   return;
}