10 May 2025 01:24:03 PM

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

test_nearest():
  Normal end of execution.

10 May 2025 01:24:23 PM