Newsgroups: comp.lang.apl
Path: utzoo!utgpu!news-server.csri.toronto.edu!rpi!zaphod.mps.ohio-state.edu!maverick.ksu.ksu.edu!ux1.cso.uiuc.edu!csrd.uiuc.edu!sp27.csrd.uiuc.edu!jaxon
From: jaxon@sp27.csrd.uiuc.edu (Greg P. Jaxon)
Subject: Re: WANTED: a way to sort array so each column i
Message-ID: <1991Apr17.151913.4891@csrd.uiuc.edu>
Sender: news@csrd.uiuc.edu (news)
Organization: UIUC Center for Supercomputing Research and Development
References: <31931@usc> <13APR91.22583472@uc780.umd.edu> <WEG.91Apr14120440@convx1.convx1.ccit.arizona.edu> <14APR91.18400456@uc780.umd.edu>
Date: Wed, 17 Apr 91 15:19:13 GMT
Lines: 13

cs450a03@uc780.umd.edu writes:

>>Incidentally, how does one write this function in APL2?
> you could write a function F to sort vector
>then do:
>         transpose mix  F each  split[quadIO] array
>You might be able to do something with mix and brackets to avoid the
>transpose, but I don't know what exactly, off the top of my head.
>Raul Rockwell

Easy mix[K] is the left inverse of split[K], so just  mix[#IO] F" split[#IO] A.

Greg Jaxon