Very true. Those fast matrix and linear algebra libraries: BLAS, LAPACK are fast...

srean on Jan 15, 2011 | parent | context | favorite | on: Fast Levenshtein distance using a Trie

Very true. Those fast matrix and linear algebra libraries: BLAS, LAPACK are fast not because of using different algorithms but because of optimizing for cache reuse. Its the same reason why sometimes binary search trees performs better than (unoptimized) hash tables.