Racket function for finding minimum element of list given a function

Question

Is there some function in Racket(Scheme) that can give me the element, which produces the minimum value after applying a given function in a list. Something like (apply min (map f list)) but returning the element before applying f. For example:

(define lst '((1 . 3) (3 . 8) (5 . 6))
(define (f pair)
  (- (cdr pair) (car pair)))
(minimum f lst)

This should give '(5 . 6).

There should be a one liner for this with higher order functions at least if there is no direct function(as I had to fill in one line to get this behaviour). Any ideas?

Sorawee Porncharoenwase · Accepted Answer · 2020-08-14 16:37:44Z

6

Try argmin:

#lang racket

(define lst '((1 . 3) (3 . 8) (5 . 6)))
(define (f pair)
  (- (cdr pair) (car pair)))
(argmin f lst)

produces '(5 . 6) as you desired.

answered Aug 14, 2020 at 16:37

Sorawee Porncharoenwase

6,5221 gold badge18 silver badges30 bronze badges

Sign up to request clarification or add additional context in comments.

Comments

mindthief · Accepted Answer · 2020-08-25 23:05:00Z

2

You could use this generic version of min, which accepts a key argument:

(require relation)
(apply min #:key f lst)

=> '(5 . 6)

This version of min also works on strings or any other orderable type (i.e. not just numbers).

[disclosure: I'm the author of this library]

answered Aug 25, 2020 at 23:05

mindthief

13.5k15 gold badges59 silver badges62 bronze badges

Collectives™ on Stack Overflow

Racket function for finding minimum element of list given a function

2 Answers 2

Comments

Comments

Your Answer

Hot Network Questions

Collectives™ on Stack Overflow

2 Answers 2

Comments

Comments

Your Answer

Sign up or log in

Post as a guest

Related