ysdtkm/fortran_associative_array

Speed test (compared to linear search and std::map)

Closed this issue · 1 comments

With a graph

Linear search is faster than I thought for small arrays, especially with compiler optimization. Probably it is due to consecutive memory access. Also, the memory allocation time is excluded from the measured time for linear search.