On Tue, Jan 12, 2010 at 7:10 PM, Viktor Cerovski <[email protected]> wrote: > It's not always ridiculous---for example, merging two sorted arrays of total > length n into a sorted array merge does in O(n) while /:~ in O(n log n).
/:~ is O(n), sometimes. -- Raul ---------------------------------------------------------------------- For information about J forums see http://www.jsoftware.com/forums.htm
