|
|
|
|
|
by ffriend
3218 days ago
|
|
> The author understands your perspective but he's deliberately using a different one. In this case the way the author shows it isn't the best one: he modifies Python code to be more realistic - that's ok, but doesn't he do the same thing for Julia? Obviously, writing a recursive fibonacci functions isn't the best way to implement it. Obviously, using caching can improve performance. But why not to apply these changes to both implementations? |
|
Yes, I agree he didn't rewrite the Julia fibonacci examples the same way as Python.
My comment was speaking more to the usage of "optimized C libraries" in his benchmarks as being appropriate for his particular goal. (As response to poster hojijoji's objection to C-implementations.)