numbers rank

rank.hs

import Data.List
import Data.Function

rank :: [Int] -> [Int]
rank = order . order
  where
    order = 
      map fst .
      sortBy (compare `on` snd) .
      zip [1..]

rank.lisp

(defun with-index (l &key (start 0))
  (if (null l) '()
      (cons (cons start (car l))
	    (with-index (cdr  l) :start (+ start 1)))))

(defun rank (l)
  (flet ((order (l)
	   (mapcar #'car
		   (sort (with-index l :start 1)
			 #'< :key #'cdr))))
    (order (order l))))