17 September 2021 11:53:57.565 PM TEST_NEAREST: FORTRAN90 version Consider various nearest neighbor algorithms. M = 2 NR = 1000000 NS = 10 #1 time: 0.473150E-01 size = 10 i(1) = 798727 M = 2 NR = 100000 NS = 100 #1 time: 0.462980E-01 size = 100 i(1) = 87962 M = 2 NR = 10000 NS = 1000 #1 time: 0.441690E-01 size = 1000 i(1) = 1239 M = 2 NR = 1000 NS = 10000 #1 time: 0.449610E-01 size = 10000 i(1) = 249 M = 2 NR = 100 NS = 100000 #1 time: 0.507010E-01 size = 100000 i(1) = 35 M = 2 NR = 10 NS = 1000000 #1 time: 0.743350E-01 size = 1000000 i(1) = 7 M = 4 NR = 1000000 NS = 10 #1 time: 0.658860E-01 size = 10 i(1) = 504511 M = 4 NR = 100000 NS = 100 #1 time: 0.601180E-01 size = 100 i(1) = 24242 M = 4 NR = 10000 NS = 1000 #1 time: 0.595900E-01 size = 1000 i(1) = 6047 M = 4 NR = 1000 NS = 10000 #1 time: 0.603660E-01 size = 10000 i(1) = 660 M = 4 NR = 100 NS = 100000 #1 time: 0.671600E-01 size = 100000 i(1) = 65 M = 4 NR = 10 NS = 1000000 #1 time: 0.895540E-01 size = 1000000 i(1) = 7 M = 8 NR = 1000000 NS = 10 #1 time: 0.106375 size = 10 i(1) = 165331 M = 8 NR = 100000 NS = 100 #1 time: 0.100958 size = 100 i(1) = 6062 M = 8 NR = 10000 NS = 1000 #1 time: 0.925570E-01 size = 1000 i(1) = 5162 M = 8 NR = 1000 NS = 10000 #1 time: 0.930820E-01 size = 10000 i(1) = 741 M = 8 NR = 100 NS = 100000 #1 time: 0.100644 size = 100000 i(1) = 11 M = 8 NR = 10 NS = 1000000 #1 time: 0.128811 size = 1000000 i(1) = 4 TEST_NEAREST Normal end of execution. 17 September 2021 11:53:59.151 PM