Re: Tasks
- Posted by "Hawke'" <mikedeland at NETZERO.NET> Aug 14, 2000
- 448 views
and ya, be'faour yaZ say it jiri ;) i realize that carl's code frag i pasted a couple minutes ago doesnt actually solve the problem as i originally stated it with only one line....my bad ;) is it modifiable to do so? to return the highest value contained within a sequence? is it indeed possible to create a one-liner(tm) that returns the highest/lowest value in a sequence? at this point im not sure.... recursively split the sequence in consecutive halves and pass those halves to carl's function??? (ok so that might take 2 lines or more...) ----- Original Message ----- From: jiri babor <jbabor at PARADISE.NET.NZ> To: <EUPHORIA at LISTSERV.MUOHIO.EDU> Sent: Monday, August 14, 2000 5:25 AM Subject: Re: Tasks > Hawke', you are wicked. I spent close to ten minutes trying to come up > with a decent min/max one-liner. Only to discover your memory is even > worse than mine: I am almost sure your forgotten one-liners were > Carl's sign and abs functions. > > Admit it! jiri > _______________________________________________ Why pay for something you could get for free? NetZero provides FREE Internet Access and Email http://www.netzero.net/download/index.html