Talk:Topological sort: Difference between revisions
→Clojure example: new section
m (→first implementation: box chars are a problem...) |
(→Clojure example: new section) |
||
Line 131:
Note: Roger Hui has pointed out that, in the version of J I am using (version 6.02a), the expression <code>;@:{L:0 1~</code> is slow on large data sets (for example: trees with 2e5 nodes). For now, a faster (but more obscure) implementation of the same algorithm is <code>3 : '(*c) #^:_1 (I.c) <@;/. (;y){y [ c=. #&> y'</code>. In both cases, we are finding the grandchildren which correspond to the current children. [[User:Rdm|Rdm]] 18:21, 2 September 2009 (UTC)
== Clojure example ==
I don't know much about Clojure, but I did notice that most of its section's leader description describes the role of code in the example. Could someone migrate that description appropriately into comments within the code sample? --[[User:Short Circuit|Michael Mol]] 18:02, 25 March 2010 (UTC)
| |||