Path: ...!weretis.net!feeder8.news.weretis.net!eternal-september.org!feeder3.eternal-september.org!news.eternal-september.org!.POSTED!not-for-mail
From: "B. Pym" <Nobody447095@here-nor-there.org>
Newsgroups: comp.lang.lisp
Subject: Re: Lisp problem to solve
Date: Thu, 29 Aug 2024 06:23:13 -0000 (UTC)
Organization: A noiseless patient Spider
Lines: 36
Message-ID: <vap44d$3s8t5$1@dont-email.me>
MIME-Version: 1.0
Content-Type: text/plain; charset=iso-8859-1
Injection-Date: Thu, 29 Aug 2024 08:23:14 +0200 (CEST)
Injection-Info: dont-email.me; posting-host="04737eacfc9f816e64fd3f986b66e8f3";
	logging-data="4072357"; mail-complaints-to="abuse@eternal-september.org";	posting-account="U2FsdGVkX1+qpF5lBR5ZizE7VeGrq259"
User-Agent: XanaNews/1.18.1.6
Cancel-Lock: sha1:oe1gg8VXbCpebi+4jzSXmF1VfME=
Bytes: 1822

John Thingstad wrote:

> Pn++ Tue, 20 Nov 2007 23:59:24 +0100, skrev Mark Tarver
> 
> 
> > On 20 Nov, 14:48, ryan.dufra...@gmail.com wrote:
> >> You are given a list of transactions along with the
> >> profits from the transactions. Write code that will return the
> >> transaction with the maximum profit. If many transactions have the
> >> same and maximusm profit, the code can return any of these. For
> >> example,
> >> given ((T1 20) (T2 88) (T3 188) (T4 99) (T5 66)), the code should.
> >> return T3.
> >>
> >> I am looking for code or pseudocode.
> >
> > (SETQ *LIST* '((T1 20) (T2 88) (T3 188) (T4 99) (T5 66)))
> >
> > Shortest solution is 1 line.
> >
> > (FIRST (FIRST (SORT *LIST* (FUNCTION (LAMBDA (X Y) (> (SECOND X)
> > (SECOND Y)))))))
> >
> > Mark
> >
> 
> or (caar (sort *list* #'> :key #'second))

Gauche Scheme:

(define List '((T1 20) (T2 88) (T3 188) (T4 99) (T5 66)))

(caar (sort List > last))

  ===>
T3