冒泡排序

#include <stdio.h>
void BubbleSort( int A[], int N );
int main(void)
{
    int A[6] = { 8, 34, 64, 51, 32, 21 };
    BubbleSort( A, 6 );
    for( int i = 0; i < 6; i++ )
    printf( "%d ", A[i]);
    return 0;
 } 
void BubbleSort( int A[], int N )
{
    int temp = 0;
    for( int j = N - 1; j > 0; j-- )
    {
    for( int i = 0; i < j; i++ )
    {
        if(A[i] > A[i + 1])
        {
        temp = A[i];
        A[i] = A[i + 1];
        A[i + 1] = temp;
        }
    }
    }
    return ;
}