C 之冒泡排序

C 之冒泡排序

int i j;
int temp;
int nums[N] = {16,12,45,9,90,23}
for(i = 0;i < N-1; i++)
{
    for(j = 0; j < N-1; j++)
    {
        if(nums[j] < nums[j+1])
        {
            temp = nums[j];
            nums[j] = nums[j+1];
            nums[j+1] = temp;
        }
    }
}