从升序反转到降序 [英] Reverse from ascending order to descending

问题描述

我想编写一个程序，按降序打印我的列表，但我可以按升序执行此操作。那么我现在如何将其转换为降序？

I want to write a program which prints my list in descending order but what i could do it to do it in ascending order. So how do i now convert it to descending?

(define (in-order ls)
  (cond ((null? ls) ls)
        ((< (car ls) (cadr ls)) 
         (cons (car ls) (cons (in-order (cdr ls)) ())))
        ((>= (car ls) (cadr ls)) (car ls))
        (else "Nothing")))

我尝试过：



我尝试按升序进行操作。我现在只需要转换它

What I have tried:

I tried doing in ascending order. I just need to convert it now

推荐答案

我的评论已经过验证...

我不知道Lisp但是我会猜到将< 更改为> 和> = 到< = 可能会这样做

I've had my comment verified...
I don't know Lisp but I would guess that changing < to > and >= to <= might do it

这篇关于从升序反转到降序的文章就介绍到这了，希望我们推荐的答案对大家有所帮助，也希望大家多多支持IT屋！