Algorithms-I : 5-KdTrees: add Speed.javaalgs-I

1 files changed, 43 insertions, 0 deletions

diff --git a/Algorithms/Part-I/5-KdTrees/Speed.java b/Algorithms/Part-I/5-KdTrees/Speed.java
new file mode 100644
index 0000000..ff8c535
--- /dev/null
+++ b/Algorithms/Part-I/5-KdTrees/Speed.java
@@ -0,0 +1,43 @@
+
+public class Speed
+{
+
+    public static void measure(Point2D p, KdTree k0)
+    {
+        Point2D np;
+        long t0;
+        long d0;
+
+        t0 = System.nanoTime();
+        np = k0.nearest(p);
+        d0 = System.nanoTime() - t0;
+
+        StdOut.printf("Nearest Point: %s => %s  %.3f [ms]\n", p, np, d0/1000.0);
+    }
+
+    public static void main(String[] args)
+    {
+        String filename = args[0];
+        In in = new In(filename);
+
+        KdTree kdtree = new KdTree();
+        while (!in.isEmpty()) {
+            double x = in.readDouble();
+            double y = in.readDouble();
+            Point2D p = new Point2D(x, y);
+            kdtree.insert(p);
+        }
+
+        measure(new Point2D(0.5, 0.5), kdtree);
+        measure(new Point2D(0.5, 0.5), kdtree);
+        measure(new Point2D(0.3, 0.5), kdtree);
+        measure(new Point2D(0.3, 0.5), kdtree);
+        measure(new Point2D(0.5, 0.3), kdtree);
+        measure(new Point2D(0.5, 0.3), kdtree);
+        measure(new Point2D(0.2, 0.7), kdtree);
+        measure(new Point2D(0.2, 0.7), kdtree);
+        measure(new Point2D(0.1, 0.8), kdtree);
+        measure(new Point2D(0.1, 0.8), kdtree);
+
+    }
+}