Link Details

The idea of this post is to evaluate similar implementations done in Ruby, JavaScript, Groovy and Python through JSR-223's API using the corresponding scripting engines (i.e. JRuby, Rhino, Groovy and Jython). The algorithm I have implemented resembles a Depth-first search (DFS). Basically I build a tree with 5,101 nodes and visit each one of them in a DFS way. For profiling purposes I do that exactly 10 times by (re)evaluating the same script, which is never pre-compiled.