The J interpreter is written in C, so it's not going to be faster than C. However, it may be faster than casually-written C programs.
What kind of benchmarks do you have in mind? Examples: - Do 1e6 simulations of the Monte Hall problem. - If x is a 1e6-element list of integers from 0 to 999, count the number of occurrences of each integer. - Sort a 1e6-element list of 4-byte integers, of 8-byte floats, etc. (By the way, both of these are /:~ in J.) - Sudoku solver. - KenKen solver. - etc. On Wed, Oct 2, 2013 at 5:03 PM, Gautam Goel <[email protected]> wrote: > Hi all, > > I'm a J newbie, and I'm curious about its performance. I've seen statements > that J has "very high performance", but I haven't seen actual benchmarks to > back that up. How does J compare to languages like C (which are known to be > very fast) or Python (which, being interpreted, are usually much slower)? > > Also, I haven't seen any large (> 10KLOC) programs in J. Does someone have > a link to a J repo hosting a significant project? Thanks! > > -- > Cheers, > > Gautam C. Goel > ---------------------------------------------------------------------- > For information about J forums see http://www.jsoftware.com/forums.htm > ---------------------------------------------------------------------- For information about J forums see http://www.jsoftware.com/forums.htm
