poems

fib.clj

(defn fib [n]
  (loop [back1 1, back2 0, n n]
    (cond
      (= n 0) 0
      (= n 1) (+ back1 back2)
      :else (recur back2 (+ back1 back2) (- n 1)))))

fib.fs

let fib n =
  let rec fib' back1 back2 = function
    | 0 -> 0
    | 1 -> back1 + back2
    | n -> fib' back2 (back1 + back2) (n - 1)
  fib' 1 0 n

qsort-h.clj

(defn qsort [[pivot & xs]]
  (when pivot
    (let [{smaller true bigger false} (group-by #(< % pivot) xs)]
      (lazy-cat (qsort smaller) [pivot] (qsort bigger)))))

qsort.clj

(defn qsort [[pivot & xs]]
  (when pivot
    (let [smaller #(< % pivot)]
      (lazy-cat (qsort (filter smaller xs))
                [pivot]
                (qsort (remove smaller xs))))))

qsort.fs

let rec sort = function
  | []   -> []
  | h::t ->
      let less, greater = List.partition ((>) h) t
      sort less @ h :: sort greater

I slightly modified the clojure version to make it look more like a Haskell one.

(defn qsort [[pivot & xs]]
   (when pivot
     (let [{smaller true greater false} (group-by #(< % pivot) xs)]
       (lazy-cat (qsort smaller) [pivot] (qsort greater)))))

Re: alex Thanks man, very nice :)