목차
[.settings]
[bin]
[src]
.classpath
.project
파일 14, 폴더 3
23.0KB
[bin]
[src]
.classpath
.project
파일 14, 폴더 3
23.0KB
본문내용
//package com.nts.algorithm_hw4_1;
import java.util.ArrayList;
import java.util.Arrays;
import java.util.List;
public class ClosestPair {
private static double INFINITY = Double.MAX_VALUE;
// compute closest pair - brute force method
static double closestPairBruteForce0(Point[] points) {
double minDistance = INFINITY;
double distance;
int numberOfPoints = points.length;
for (int i = 0; i < numberOfPoints - 1; i++) { // outer loop
for (int j = i + 1; j < numberOfPoints; j++) { // inner loop
distance = points[i].distance(points[j]);
if (distance < minDistance) { // remember the shortest distance
minDistance = distance;
}
}
}
return minDistance;
}
≪ … 중 략 … ≫
public static void main(String[] args) {
for (int i = 3; i < 6; i++) {
int numberOfPoints = (int) Math.pow(10, i);
System.out.print(\\"For \\" + numberOfPoints + \\" points, \\");
Point[] points = PointGenerator.generate(numberOfPoints);
double minDistance1 = closestPairBruteForce(points);
System.out.printf(
\\"distance from closestPairBruteForce = %.2f \n\n\\",
minDistance1);
import java.util.ArrayList;
import java.util.Arrays;
import java.util.List;
public class ClosestPair {
private static double INFINITY = Double.MAX_VALUE;
// compute closest pair - brute force method
static double closestPairBruteForce0(Point[] points) {
double minDistance = INFINITY;
double distance;
int numberOfPoints = points.length;
for (int i = 0; i < numberOfPoints - 1; i++) { // outer loop
for (int j = i + 1; j < numberOfPoints; j++) { // inner loop
distance = points[i].distance(points[j]);
if (distance < minDistance) { // remember the shortest distance
minDistance = distance;
}
}
}
return minDistance;
}
≪ … 중 략 … ≫
public static void main(String[] args) {
for (int i = 3; i < 6; i++) {
int numberOfPoints = (int) Math.pow(10, i);
System.out.print(\\"For \\" + numberOfPoints + \\" points, \\");
Point[] points = PointGenerator.generate(numberOfPoints);
double minDistance1 = closestPairBruteForce(points);
System.out.printf(
\\"distance from closestPairBruteForce = %.2f \n\n\\",
minDistance1);
소개글