编程空间坐标点的排序C语言,【一道C++编程题!距离排序[问题描述]给出三维空间中的n个点（不超过10个）,求出n个点两两之间的距离,并按距离由大到小依次输出两个点的坐标及它们之间的距离.输入：输入包...

/// test.cpp:

/// CopyRight (c) 2014 Vobile Inc.

/// Author:XiaoH

/// Created:2014-06-23

#include

#include

#include

typedef struct point {

int x,y,z;

}POINT;

typedef struct disdence {

POINT a,b;

double dst;

}PD;

double Squ(double num) {

return num * num;

}

double Distance(POINT a,POINT b) {

return sqrt(Squ(a.x - b.x) + Squ(a.y - b.y) + Squ(a.z - b.z));

}

int main() {

POINT pt[10];

PD tmp,dst[45];

int i,j,k,n,N;

printf("数据点数 :");

scanf("%d",&n);

if(n > 10) n = 10;

N = n*(n - 1)/2;

for(i = 0;i < n;i++) {

printf("点%d :",i + 1);

scanf("%d %d %d",&pt[i].x,&pt[i].y,&pt[i].z);

}

k = 0;

for(i = 0;i < n - 1;i++) {

for(j = i + 1;j < n;j++) {

dst[k].a = pt[i];

dst[k].b = pt[j];

dst[k].dst = Distance(pt[i],pt[j]);

k++;

}

}

for(i = 0;i < N - 1;i++) {

k = i;

for(j = i + 1;j < N;j++) {

if(dst[k].dst < dst[j].dst)

k = j;

}

if(k != i) {

tmp = dst[k];

dst[k] = dst[i];

dst[i] = tmp;

}

}

for(i = 0; i < N; i++) {

printf("(%3d,%3d,%3d) -- ",dst[i].a.x,dst[i].a.y,dst[i].a.z);

printf("(%3d,%3d,%3d) :",dst[i].b.x,dst[i].b.y,dst[i].b.z);

printf("%.2lf\n",dst[i].dst);

}

return 0;

}

作业帮用户

2017-11-11

举报