Last week, a gentleman wrote on his blog about the performance of CPython, Jython and IronPython in creating an empty binary tree to demonstrate a performance problem in IronPython.
The article was posted to Reddit, but I thought that the demonstration of other how dynamically typed languages performed was more interesting than the comparison of the different Python implementations. Among the implementations submitted were Slava Pestov’s Factor version and my own version in Clojure. On my home PC, creating a binary tree of depth 22 took 549 seconds in Python, 14 seconds in Clojure and 4 seconds in Factor.
- Server-side web programming*
- General purpose scripting*
- General purpose programming*
- Embedded language in applications such as productivity suites or games
- Extension language for Emacs-like applications
- Mobile device programming language
* Given that it has a decent standard library