C语言实现杨辉三角、冒泡排序

不啰嗦代码如下：

杨辉三角

#include<stdio.h>
#include<stdlib.h>
int main()
{
    int arr[10][10] = {};
    for (int i = 0; i < 10; i++)
    {
        arr[i][0] = 1;
    }
    for (int row = 0; row < 10; row++)
    {
        for (int j = 0; j < row; j++)
        {
            printf("%d\t", arr[row][j]);
            if (row + 1<10)
            {
                arr[row + 1][j + 1] = arr[row][j] + arr[row][j + 1];
            }
        }
        printf("\n");
    }
    //system("pause");
    return 0;
}

冒泡排序

#include<stdio.h>
#include<stdlib.h>
int main()
{
    int nArr[8] = { 2,5,1,3,8,6,7,4 };
    int nNum = 0;
    for (int i = 0; i < 8; i++)
    {
        int j = i;
        for (; j < 8; j++)
        {
            if (nArr[i] > nArr[j])
            {
                nNum = nArr[i];
                nArr[i] = nArr[j];
                nArr[j] = nNum;
            }
        }
    }
    for (int i = 0; i < 8; i++)
    {
        printf("%d ", nArr[i]);
    }
    system("pause");
    return 0;
}