From ece8b76a204847d664acb45bc5dc2e296fccc763 Mon Sep 17 00:00:00 2001
From: =?UTF-8?q?J=C3=A9r=C3=A9my=20Zurcher?= <jeremy@asynk.ch>
Date: Wed, 27 Mar 2013 16:59:27 +0100
Subject: Algorithms-I : 5-KdTrees: add Speed.java

---
 Algorithms/Part-I/5-KdTrees/Speed.java | 43 ++++++++++++++++++++++++++++++++++
 Algorithms/Part-I/5-KdTrees/run.sh     |  3 ++-
 2 files changed, 45 insertions(+), 1 deletion(-)
 create mode 100644 Algorithms/Part-I/5-KdTrees/Speed.java

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);
+
+    }
+}
diff --git a/Algorithms/Part-I/5-KdTrees/run.sh b/Algorithms/Part-I/5-KdTrees/run.sh
index 1ddfb96..5311ac6 100755
--- a/Algorithms/Part-I/5-KdTrees/run.sh
+++ b/Algorithms/Part-I/5-KdTrees/run.sh
@@ -13,11 +13,12 @@ for kls in $CLASSES; do
 done
 ~/algs4/bin/findbugs *.class
 
-for kls in KdTreeVisualizer NearestNeighborVisualizer RangeSearchVisualizer; do
+for kls in Speed KdTreeVisualizer NearestNeighborVisualizer RangeSearchVisualizer; do
     echo "javac ${kls}.java" && javac ${kls}.java
 done
 
 echo "RUN..."
+java Speed input1M.txt
 java KdTreeVisualizer circle10.txt
 java RangeSearchVisualizer input10K.txt
 java NearestNeighborVisualizer input10K.txt
-- 
cgit v1.1-2-g2b99