Thread history

Fragment of a discussion from Talk:Binary Search PIF
Viewing a history listing
Jump to navigation Jump to search
Time User Activity Comment
No results

Well, that’s only true for large enough n... And for small n, such as our cases, constant factor is dominant.

Btw, memory access is WAAAY expensive than basic calculations, so the gain for optimized memory access, for small n, often outperforms paper algorithms that don’t use contiguous memory in order.

Xor (talk)00:43, 4 November 2017