diff options
author | Haidong Ji | 2018-12-16 20:21:12 -0600 |
---|---|---|
committer | Haidong Ji | 2018-12-16 20:21:12 -0600 |
commit | 1d6a57ac37f0c56a7639c1124be5501f699f3027 (patch) | |
tree | 922a96bbb6cf6d39aff7d494500f8f0d1956a38f /AlgoDesignAndTechniqueEdxPython/tests/closest_distanceTest.py | |
parent | 88a15736625e2847d5c479ceabf202ea6be1e75b (diff) |
Closest pair done!
I thought it wouldn't be this hard after I worked it out in Java first,
but once again it was fun and I learned a lot:
1. in all my previous exercises, my Python code performed better than my
Java code. This is the first time that my Java code significantly
outperforms my Python code: 0.92 seconds versus 7.93 seconds! My Java
code did use more than twice the memory.
2. Good re-enforcement of Python list copying concept, versus aliasing.
Don't forget the [:] (or [l:r]) magic!
3. list of (num, num) sort by first num by default, with proper tie
breaking. To sort on the second num, do list.sort(key=lambda x: x[1].
Cleve use of lambda, and it also does proper tie breaking.
4. I forgot to put this into my Java program comments, that Java code
gave me a good practice of comparator versus comparable interfaces,
which was very nice.
Fun stuff! Curious how much faster C++ program will be. I'll find out!
Diffstat (limited to 'AlgoDesignAndTechniqueEdxPython/tests/closest_distanceTest.py')
-rw-r--r-- | AlgoDesignAndTechniqueEdxPython/tests/closest_distanceTest.py | 64 |
1 files changed, 64 insertions, 0 deletions
diff --git a/AlgoDesignAndTechniqueEdxPython/tests/closest_distanceTest.py b/AlgoDesignAndTechniqueEdxPython/tests/closest_distanceTest.py new file mode 100644 index 0000000..b3391a7 --- /dev/null +++ b/AlgoDesignAndTechniqueEdxPython/tests/closest_distanceTest.py @@ -0,0 +1,64 @@ +''' +Created on Dec 16, 2018 + +@author: haidong +''' +import unittest + +from sources.closest_distance import distance, minDistance + + +class Test(unittest.TestCase): + +# def testDistance(self): +# p1 = (0, 0) +# p2 = (1, 1) +# result = 1.414214 +# self.assertAlmostEqual(result, distance(p1, p2), places=6) + + def testSortPointsArray(self): + p = [(4, 4), (-2, -2), (-3, -4), (-1, 3), (2, 3), (-4, 0), (1, 1), (-1, -1), (3, -1), (-4, 2), (-2, 4)] + p.sort() + self.assertEqual(-4, p[0][0]) + self.assertEqual(0, p[0][1]) + + p.sort(key=lambda x: x[1]) + self.assertEqual(-4, p[0][1]) + self.assertEqual(-3, p[0][0]) + self.assertEqual(4, p[10][1]) + self.assertEqual(4, p[10][0]) + + def testMinDistance(self): + x = [0, 3] + y = [0, 4] + result = 5.0 + self.assertAlmostEqual(result, minDistance(x, y)) + + def testMinDistance1(self): + x = [0, 3, 5] + y = [0, 4, 6] + result = 2.828427 + self.assertAlmostEqual(result, minDistance(x, y), places=6) + + def testMinDistance2(self): + x = [7, 1, 4, 7] + y = [7, 100, 8, 7] + result = 0.0 + self.assertAlmostEqual(result, minDistance(x, y), places=6) + + def testMinDistance3(self): + x = [4, -2, -3, -1, 2, -4, 1, -1, 3, -4, -2] + y = [4, -2, -4, 3, 3, 0, 1, -1, -1, 2, 4] + result = 1.414214 + self.assertAlmostEqual(result, minDistance(x, y), places=6) + + def testMinDistance4(self): + x = [-2, -3, -1, 2, -4, 1, -1] + y = [-2, -4, 3, 3, 0, 1, -1] + result = 1.414214 + self.assertAlmostEqual(result, minDistance(x, y), places=6) + + +if __name__ == "__main__": + #import sys;sys.argv = ['', 'Test.testName'] + unittest.main() |