Of course it is not perfect, but it is one of the best ways to get a quick idea of the speed of a language. For example if we do it in OCaml we get native machi

Of course it is not perfect, but it is one of the best ways to get a quick idea of the speed of a language. For example if we do it in OCaml we get native machine integers and cheap function calls. If we do it in Ruby we get expensive integers and heavy weight procedure calls. > I can easily imagine optimizing performance for an unrealistic micro-benchmark that would actually hurt overall recursion performance. I can't. Can you explain this and give an example?