Purely Functional Data Structures & Algorithms : Selection Sort
*Updated @ 2012-08-31 02:08:58 due to internet pedantry* Previously, previously. According to Wikipedia : In computer science, a Selection sort
Happy Pi Day in Shen
Here’s a port of the previous Qi II code to Shen. Run with Hakan Raberg’s 0.
Sold out attendance marked this being the second premiere conference for Clojure. What I realized is just how great the
Overtone is an open source audio environment being created to explore musical ideas from synthesis and sampling to instrument building,
The first publicly available version of Shen/Kl has been released. The Shen mission is to develop an ultra-portable version
ClojureScript Demo : Convex Hull
Update : bug-fix when hull was being incorrectly calculated due to there being duplicate points generated in the random set. ClojureScript
Happy PI day ! (in QiII)
Qi is the future of Lisp. It is Lisp with many great features such as pattern-matching, a turing complete static
So you say that programming language choice does not matter ...
One popular interview question that never dies : write some code to reverse a singly linked-list. Now understanding the problem for
Convex Hull with Aki-Toussaint heuristics
;; Calculates the convex hull of a set of points using the Graham scan ;; algorithm. (ns i27.geom.convex-hull (:use [i27.
Bucket sort (Clojure)
(defn bucket-sort "Runs in O(n) time." [items] (let [len (count items) mx (apply max items) bucket-size (inc (int (/ mx