Today I was seeing this -- https://en.wikipedia.org/wiki/Knuth-Morris-Pratt_algorithm
How can I begin to implement it in clojure ?
Specifically, how do I _ingeneral_ deal with assignments and while loops.
In common-lisp, for example I would use the `loop` macro and defvar-sefq combo, (beginning lisper).
In ruby, = and while itself.
http://clojuredocs.org/clojure_core/clojure.core/let
(let [username "prollyignored"
karma 7]
(println username "has" karma "karma points."))
; prollyignored has 7 karma points.
(loop [n 0]
(when (< n 10)
(print n)
(recur (inc n))))
;=> 0123456789
(for [x [0 1 2 3 4 5]
:let [y (* x 3)]
:when (even? y)]
y)
;=> (0 6 12)
(filter even? (map #(* % 3) [0 1 2 3 4 5]))
;=> (0 6 12)
Now in,
while m+i is less than the length of S, do:
if W[i] = S[m + i],
if i equals the (length of W)-1,
return m
let i ← i + 1
....
When you write:
(defn square [x]
(* x x))
(def square
(fn [x]
(* x x)))
(loop [n 0]
(if (= n 10)
n ; true case: return n
(recur (inc n)))) ; false case: loop with n++
;=> 10