Program Finding Shortest Point In Dev C++

Program Finding Shortest Point In Dev C++ US USA
Program Finding Shortest Point In Dev C++,Finding two points in the set have a short distance. By entering input with coordinates x and y, with a lot of points and how do I find the result. Let's look at programs.
To the program you can copy the following :
#include<iostream>//description of the calling cout and cin
#include<math.h>
#define SIZE 100

using namespace std;

struct Point{
float x,y;
};

void Cari2TitikTerdekat(Point p[], int n, Point &p1, Point &p2){
float d, dmin;
int i, j;

dmin=9999;
for(i=1;i<n;i++){
for(j=i+1; j<=n; j++){
d=sqrt(pow((p[i].x-p[j].x),2)+pow((p[i].y -p[j].y),2));
if(d<dmin){
dmin=d;
p1=p[i];
p2=p[j];
}
}
}
}


int main(int argc, char *argv[]){
int n,a,b;
Point p[SIZE];
Point p1,p2;
cout<<"Masukkan banyak titik : "; cin>>n;
for(int i=1;i<=n;i++){
cout<<"titik ["<<i<<"] x = "; cin>>p[i].x;
cout<<"titik ["<<i<<"] y = "; cin>>p[i].y;
}
Cari2TitikTerdekat(p,n, p1, p2);
cout<<"koordinat "<<p1.x<<","<<p1.y<<" dan "<<p2.x<<","<<p2.y;
cout<<endl;
for(int i=1;i<=n;i++){
if(p1.x==p[i].x && p1.y==p[i].y){
a=i;
}
if(p2.x==p[i].x && p2.y==p[i].y){
b=i;
}
}
cout<<"titiknya = "<<a<<" dan "<<b;
cout<<endl;

system("PAUSE");
return EXIT_SUCCESS;
}
Screenshot of the results you can see below:

Program Finding Shortest Point In Dev C++
To download the script, click on this link Download ScriptProgram Finding Shortest Point In Dev C++