冒泡排序

pseudo-code:

BUBBLE_SORT(A)

1    for i = 1 to A.length - 1

2        for j = A.length downto i + 1

3            if A[j] < A[j - 1]

4            exchange A[j - 1] with A[j]

---

C语言实现：

void Bubble_Sort ( int A [], int length )
{
       int i , j ;

       for ( i = 0; i < length - 1; i++)
             for ( j = length - 1;  j > i; j--)
                   if ( A [j] < A[j - 1])
                         swap (&A [j - 1], & A [j]);
}

---

算法时间复杂度：O( N^2)