The author is misguided if he thinks that an algorithm being called 'optimal' will have the best result in his particular use case. It usually means that the algorithm has optimal asymptotic runtime. In particular, asymptotic analysis completely ignores caching issues.
That said, the technical details are still worth reading if you have the time. I also agree with the author that CS programs are somewhat losing touch with reality.