《c语言程序设计》习题.使用结构数组进行平面点排序

#include <stdio.h>
typedef struct
{
    int x;
    int y;
    int dist;
} point;
int main()
{
    point p[100], t;
    int i, j, n;
    scanf("%d", &n);
    for (i = 0; i < n; i++)
    {
        scanf("%d", &p[i].x);
        scanf("%d", &p[i].y);
        p[i].dist = p[i].x * p[i].x + p[i].y * p[i].y;
        /* code */
    }
    for (i = 0; i < n - 1; i++)
    {
        for (j = i + 1; j < n; j++)
        {
            if (p[i].dist > p[j].dist)
            {
                t = p[i];
                p[i] = p[j];
                p[j] = t;
                /* code */
            }
            /* code */
        }
        /* code */
    }
    for (i = 0; i < n; i++)
    {
        printf("(%d %d) ", p[i].x, p[i].y);
        /* code */
    }
    return 0;
}