06 October 2025 01:23:38 AM

test_nearest():
  C version
  Consider various nearest neighbor algorithms.

  M = 2, NR = 1000000,  NS = 10
  #1 time: 0.474504,  size = 10,  i[0] = 941203

  M = 2, NR = 100000,  NS = 100
  #1 time: 0.537505,  size = 100,  i[0] = 35454

  M = 2, NR = 10000,  NS = 1000
  #1 time: 0.525864,  size = 1000,  i[0] = 1649

  M = 2, NR = 1000,  NS = 10000
  #1 time: 0.507868,  size = 10000,  i[0] = 374

  M = 2, NR = 100,  NS = 100000
  #1 time: 0.524509,  size = 100000,  i[0] = 27

  M = 2, NR = 10,  NS = 1000000
  #1 time: 0.51213,  size = 1000000,  i[0] = 4

  M = 4, NR = 1000000,  NS = 10
  #1 time: 1.02436,  size = 10,  i[0] = 899432

  M = 4, NR = 100000,  NS = 100
  #1 time: 0.985674,  size = 100,  i[0] = 37516

  M = 4, NR = 10000,  NS = 1000
  #1 time: 1.01754,  size = 1000,  i[0] = 1408

  M = 4, NR = 1000,  NS = 10000
  #1 time: 0.971404,  size = 10000,  i[0] = 741

  M = 4, NR = 100,  NS = 100000
  #1 time: 0.974014,  size = 100000,  i[0] = 69

  M = 4, NR = 10,  NS = 1000000
  #1 time: 1.04059,  size = 1000000,  i[0] = 5

  M = 8, NR = 1000000,  NS = 10
  #1 time: 2.00682,  size = 10,  i[0] = 306377

  M = 8, NR = 100000,  NS = 100
  #1 time: 2.03721,  size = 100,  i[0] = 6943

  M = 8, NR = 10000,  NS = 1000
  #1 time: 1.9485,  size = 1000,  i[0] = 5423

  M = 8, NR = 1000,  NS = 10000
  #1 time: 1.87579,  size = 10000,  i[0] = 705

  M = 8, NR = 100,  NS = 100000
  #1 time: 1.96568,  size = 100000,  i[0] = 44

  M = 8, NR = 10,  NS = 1000000
  #1 time: 2.03864,  size = 1000000,  i[0] = 6

test_nearest():
  Normal end of execution.

06 October 2025 01:24:00 AM