27 December 2012 9:30:54.739 AM TEST_NEAREST: FORTRAN77 version Consider various nearest neighbor algorithms. M = 2 NR = 1000000 NS = 10 #1 time: 0.159976 size = 10 i(1) = 798727 M = 2 NR = 100000 NS = 100 #1 time: 0.157976 size = 100 i(1) = 87962 M = 2 NR = 10000 NS = 1000 #1 time: 0.156976 size = 1000 i(1) = 1239 M = 2 NR = 1000 NS = 10000 #1 time: 0.157976 size = 10000 i(1) = 249 M = 2 NR = 100 NS = 100000 #1 time: 0.168974 size = 100000 i(1) = 35 M = 2 NR = 10 NS = 1000000 #1 time: 0.219966 size = 1000000 i(1) = 7 M = 4 NR = 1000000 NS = 10 #1 time: 0.281957 size = 10 i(1) = 504511 M = 4 NR = 100000 NS = 100 #1 time: 0.276958 size = 100 i(1) = 24242 M = 4 NR = 10000 NS = 1000 #1 time: 0.275958 size = 1000 i(1) = 6047 M = 4 NR = 1000 NS = 10000 #1 time: 0.273959 size = 10000 i(1) = 660 M = 4 NR = 100 NS = 100000 #1 time: 0.284956 size = 100000 i(1) = 65 M = 4 NR = 10 NS = 1000000 #1 time: 0.349947 size = 1000000 i(1) = 7 M = 8 NR = 1000000 NS = 10 #1 time: 0.518921 size = 10 i(1) = 165331 M = 8 NR = 100000 NS = 100 #1 time: 0.511922 size = 100 i(1) = 6062 M = 8 NR = 10000 NS = 1000 #1 time: 0.501924 size = 1000 i(1) = 5162 M = 8 NR = 1000 NS = 10000 #1 time: 0.501924 size = 10000 i(1) = 741 M = 8 NR = 100 NS = 100000 #1 time: 0.507923 size = 100000 i(1) = 11 M = 8 NR = 10 NS = 1000000 #1 time: 0.572913 size = 1000000 i(1) = 4 TEST_NEAREST Normal end of execution. 27 December 2012 9:31:01.210 AM