Closed this issue 6 years ago · 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.