冒泡算法

C#

static void Bubble()
{
    int temp = 0;
   List<int> list = new List<int>() { 72, 54, 59, 30, 31, 78, 2, 77, 82, 72 };
    for (int i = list.Count; i > 1; i--)
    {
        for (int j = 0; j < i - 1; j++)
        {
            if (list[j] > list[j + 1])
            {
                temp = list[j];
                list[j] = list[j + 1];
                list[j + 1] = temp;
            }
        }
    }
}
 
javascript
 

function MaoPaoSort()    

{        

  var temp;        

  var arr = [5, 4, 3, 2, 1];        

  var flag = true;        

  for (var i = arr.length; i > 1; i--)        

   {            

    if (flag)

    {                

       flag = false;                

       for (var j = 0; j < i - 1; j++)

      {                    

         if (arr[j] > arr[j + 1])

        {                        

          temp = arr[j];                        

          arr[j] = arr[j + 1];                        

          arr[j + 1] = temp;

                          flag = true;                    

        }                

      }            

    }        

   }

        alert(arr.join(' , '))    

}

原文地址:https://www.cnblogs.com/itjeff/p/3539736.html