301efdde8766001b157af7095cd7f21d

在eclipse下开发的求平面上两点之间的最短距离。通过随机在平面上生成无数个点

package distance;

public class ShortestDistance {
	/*all of the array start from 0*/
	public void findShortestDistance(Point[] PointSet,int start,int end){
		
		if(start < end){
			int BreakPoint = (start + end)/2;
			findShortestDistance(PointSet, start,BreakPoint);
			findShortestDistance(PointSet,BreakPoint + 1,end);			
			Shortest(PointSet,0,BreakPoint, PointSet.length);
		}					
	}
	public void Shortest(Point[] PointSet,int start,int breakPoint ,int end){
		int lengthLeft = breakPoint - start + 1;
		int lengthRight = end - breakPoint;
		Point[] arrayLeft = new Point[lengthLeft];
		Point[] arrayRight = new Point[lengthRight];
		for(int i = 0; i < lengthLeft; i++){
			arrayLeft[i] = PointSet[start + i];
		}
		for(int i = 0; i < lengthRight; i++){
			arrayRight[i] = PointSet[breakPoint + i];
		}
			
	}
}