This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
### Keybase proof | |
I hereby claim: | |
* I am andskiba on github. | |
* I am jondro (https://keybase.io/jondro) on keybase. | |
* I have a public key ASBMC7O1gepm2GXbUozCdrmNKB7e8UVF43tJT1fUK-51wwo | |
To claim this, I am signing this object: |
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
PROGRAMMING WITH EFFECTS | |
Graham Hutton, January 2015 | |
Shall we be pure or impure? | |
The functional programming community divides into two camps: | |
o "Pure" languages, such as Haskell, are based directly | |
upon the mathematical notion of a function as a | |
mapping from arguments to results. |
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
(ns misc.merges | |
(:require [joy.qs :refer [rand-ints]])) | |
(defn merge-sort [xs] | |
(if (<= (count xs) 1) | |
xs | |
(let [[left right] (split-at (/ (count xs) 2) xs)] | |
(mrge (merge-sort left) (merge-sort right))))) | |
(defn mrge [xs ys] |