anton podviaznikov

## mergesort.clj
(defn mergestep [l r op]
  (cond (empty? l) r
        (empty? r) l
        :else
           (let [fl (first l)
                 fr (first r)]
             (if (op fl fr)
               (cons fl (mergestep (rest l) r op))
               (cons fr (mergestep l (rest r) op))))))


## lonelyinteger.clj
(defn finditemwithoutpair [data]
  (if (= 1 (count data))
    (first data)
    (if (= (first data) (second data))
      (finditemwithoutpair (drop 2 data))
      (first data))))

## quicksort.clj
(defn qpart [data p]
     (reduce (fn [acc item]
               (cond
                 (< item p) (assoc acc :left (conj (:left acc) item))
                 (> item p) (assoc acc :right (conj (:right acc) item))
                  :else (assoc acc :ps (conj (:ps acc) item))))
             {:left [] :right [] :ps []} data))


## gdc.clj
(defn gdc [x y]
   (if (= x y)
        x
        (if (> x y)
          (recur (- x y) y)
          (recur (- y x) x))))


(gdc 10, 100) ; 10

## fibonacci.clj
(defn fib-iter [a b n]
  (if (zero? n)
    b
    (recur (+ a b) a (dec n))))


(defn fib [n]
  (fib-iter 1 0 n))

(fib 40) ;102334155

## books.md

      
              1 file
            
          
              0 forks
            
          
              0 comments
            
          
              0 stars
            
          
                podviaznikov
                / books.md
            
            
              Last active
              December 27, 2015 10:18
            
          
    Machine Learning


http://www.amazon.com/Programming-Collective-Intelligence-Building-Applications/dp/0596529325

Graphs


http://vidcat.org/papers/grpah-algorithms.html#.Uvy1ukKSxPk


## nginx.txt
Links:

  * http://blog.zachorr.com/nginx-setup/

## pascaltriangle.clj
(defn pascaltriangle-iter [row col]
        (if (or (= col 1) (= col row))
            1
            (+
              (pascaltriangle-iter (- row 1) (- col 1))
              (pascaltriangle-iter (- row 1) col))))

(defn pascaltriangle-row [row]
      (for [i (range 1 (+ 1 row))]
        (pascaltriangle-iter row i)))

## onename.io.txt
Verifying myself: My Bitcoin username is +podviaznikov. https://onename.io/podviaznikov

## keybase.md

      
              1 file
            
          
              0 forks
            
          
              0 comments
            
          
              0 stars
            
          
                podviaznikov
                / keybase.md
            
            
              Created
              October 24, 2014 23:34
            
          
    Keybase proof

I hereby claim:

I am podviaznikov on github.
I am podviaznikov (https://keybase.io/podviaznikov) on keybase.
I have a public key whose fingerprint is ED55 74C1 1394 8860 7EA1  C228 879F 60AE EC4D D532

To claim this, I am signing this object:
	(defn mergestep [l r op]
	(cond (empty? l) r
	(empty? r) l
	:else
	(let [fl (first l)
	fr (first r)]
	(if (op fl fr)
	(cons fl (mergestep (rest l) r op))
	(cons fr (mergestep l (rest r) op))))))
	(defn finditemwithoutpair [data]
	(if (= 1 (count data))
	(first data)
	(if (= (first data) (second data))
	(finditemwithoutpair (drop 2 data))
	(first data))))
	(defn qpart [data p]
	(reduce (fn [acc item]
	(cond
	(< item p) (assoc acc :left (conj (:left acc) item))
	(> item p) (assoc acc :right (conj (:right acc) item))
	:else (assoc acc :ps (conj (:ps acc) item))))
	{:left [] :right [] :ps []} data))
	(defn gdc [x y]
	(if (= x y)
	x
	(if (> x y)
	(recur (- x y) y)
	(recur (- y x) x))))


	(gdc 10, 100) ; 10
	(defn fib-iter [a b n]
	(if (zero? n)
	b
	(recur (+ a b) a (dec n))))


	(defn fib [n]
	(fib-iter 1 0 n))

	(fib 40) ;102334155
	(defn pascaltriangle-iter [row col]
	(if (or (= col 1) (= col row))
	1
	(+
	(pascaltriangle-iter (- row 1) (- col 1))
	(pascaltriangle-iter (- row 1) col))))

	(defn pascaltriangle-row [row]
	(for [i (range 1 (+ 1 row))]
	(pascaltriangle-iter row i)))