10 December 2023 9:18:18.341 AM test_nearest(): Fortran77 version Consider various nearest neighbor algorithms. M = 2 NR = 1000000 NS = 10 #1 time: 0.707240E-01 size = 10 i(1) = 798727 M = 2 NR = 100000 NS = 100 #1 time: 0.644660E-01 size = 100 i(1) = 87962 M = 2 NR = 10000 NS = 1000 #1 time: 0.643320E-01 size = 1000 i(1) = 1239 M = 2 NR = 1000 NS = 10000 #1 time: 0.658960E-01 size = 10000 i(1) = 249 M = 2 NR = 100 NS = 100000 #1 time: 0.779440E-01 size = 100000 i(1) = 35 M = 2 NR = 10 NS = 1000000 #1 time: 0.120530 size = 1000000 i(1) = 7 M = 4 NR = 1000000 NS = 10 #1 time: 0.124565 size = 10 i(1) = 504511 M = 4 NR = 100000 NS = 100 #1 time: 0.123143 size = 100 i(1) = 24242 M = 4 NR = 10000 NS = 1000 #1 time: 0.124561 size = 1000 i(1) = 6047 M = 4 NR = 1000 NS = 10000 #1 time: 0.124088 size = 10000 i(1) = 660 M = 4 NR = 100 NS = 100000 #1 time: 0.136216 size = 100000 i(1) = 65 M = 4 NR = 10 NS = 1000000 #1 time: 0.176769 size = 1000000 i(1) = 7 M = 8 NR = 1000000 NS = 10 #1 time: 0.248163 size = 10 i(1) = 165331 M = 8 NR = 100000 NS = 100 #1 time: 0.248806 size = 100 i(1) = 6062 M = 8 NR = 10000 NS = 1000 #1 time: 0.248660 size = 1000 i(1) = 5162 M = 8 NR = 1000 NS = 10000 #1 time: 0.249728 size = 10000 i(1) = 741 M = 8 NR = 100 NS = 100000 #1 time: 0.260837 size = 100000 i(1) = 11 M = 8 NR = 10 NS = 1000000 #1 time: 0.326198 size = 1000000 i(1) = 4 test_nearest(): Normal end of execution. 10 December 2023 9:18:21.538 AM