What makes K faster than J. I read on wikipedia.com that:
The small size of the K interpreter and compact syntax of the K language makes it possible for K applications to fit entirely within the level 1 cache of the processor. Vector processing makes efficient use of the cache row fetching mechanism and posted writes without introducing bubbles into the pipeline by creating a dependency between consecutive instructions. Is this the reason K is so fast? Would it be possible to modify J to approach the speed of K? Please don't flame me, just curious. ---------------------------------------------------------------------- For information about J forums see http://www.jsoftware.com/forums.htm
