请问谁能告诉我一个程序，我不太会 用分治法求数组中的最近点对用C语言写

#include<iostream>
#include<algorithm>
#include<cmath>
using namespace std;
typedef struct{
float x; //点的x,y坐标
float y;
}POINT;
//辅助点的结构
typedef struct{
int index; //点在x数组中的下标
float x; //点的x,y坐标
float y;
}A_POINT;
bool compareX(POINT a,POINT b)
{
return b.x>a.x;
}
bool compareY(A_POINT a,A_POINT b)//对辅助点进行递增排序的比较
{
return b.y>a.y;
}
float dist(POINT a,POINT b)//计算两点距离的平方
{
float dx,dy;
dx=a.x-b.x;
dy=a.y-b.y;
return (dx*dx+dy*dy);
}
void closest(POINT X[],A_POINT Y[],int low,int high,POINT &a,POINT &b,float &d)
{
int i,j,k,m;
POINT al,bl,ar,br;
float dl,dr,dx;
if((high-low)==1)
{
a=X[low];
b=X[high];
d=dist(X[low],X[high]);
}
else
{
if((high-low)==2)
{
dl=dist(X[low],X[low+1]);
dr=dist(X[low],X[low+