For one aspect of sorting vs. grading, see http://www.jsoftware.com/jwiki/Essays/Sorting_versus_Grading
By the way, if you have a computation to do either one (sort or grade) you can readily obtain the other. ----- Original Message ----- From: Devon McCormick <[EMAIL PROTECTED]> Date: Thursday, March 20, 2008 8:11 Subject: Re: [Jprogramming] Biggest values from list To: Programming forum <[email protected]> > Nick - > > this > 3 {. \: 6 3 9 6 7 5 > is _not_ sorting: it's "grading" which can be much more useful > than sorting. > For instance, in this case, you don't have to move around > the entire array > - you can simply extract the indexes you need. It's also > pretty efficient, > if that's why you're concerned about avoiding it. > > I'm actually looking for examples like this because I'd like to > compose an > essay on grading and its advantages over sorting, so I'd be > interested if > you would keep us updated on what you're doing with this and how > it works > out. > > Regards, > > Devon > > On 3/20/08, Nick Kostirya <[EMAIL PROTECTED]> wrote: > > > > В Thu, 20 Mar 2008 08:22:41 -0400 > > "Raul Miller" <[EMAIL PROTECTED]> пишет: > > > > > > > On Thu, Mar 20, 2008 at 6:31 AM, Nick Kostirya > > > <[EMAIL PROTECTED]> wrote: > > > > from 6 3 9 6 7 5 get, for sample, value 9 7 6 and position > 2 4 0 > > > > > > 3 {. \: 6 3 9 6 7 5 > > > 2 4 0 > > > 3 ({. \:) 6 3 9 6 7 5 > > > 2 4 0 > > > 3 (({. \:) { ]) 6 3 9 6 7 5 > > > 9 7 6 > > > > > > 3 (({. \:) ([ ,: {) ]) 6 3 9 6 7 5 > > > 2 4 0 > > > 9 7 6 > > > > > > > > > > > Can we manage this without sorting? ---------------------------------------------------------------------- For information about J forums see http://www.jsoftware.com/forums.htm
