post your favorite algorithms

Name
Email
Subject
Comment *
File
* = required field	[▶ Show post options & limits] Confused? See the FAQ.

File: 1423946043541.gif (29.15 KB, 143x128, 143:128, 1412388670728.gif)

post your favorite algorithms Anonymous 02/14/15 (Sat) 20:34:03 No.32

here i'll start:
(defun gcd (a b)
(let (tmp)
(if (= b 0)
a
(gcd b (mod a b))))

Anonymous 02/14/15 (Sat) 20:35:05 No.33

>>32
damn i fucked up:
(defun gcd (a b)
"greatest common divisor of a and b"
(if (= b 0)
a
(gcd b (mod a b))))

;; non-recursive version:
;; (defun gcd (a b)
;; (let (tmp)
;; (while (/= b 0)
;; (setq tmp (mod a b)
;; a b
;; b tmp))
;; a))

Anonymous 02/14/15 (Sat) 20:43:53 No.37

>>32
>>33
Not HolyC
>>/out/

Terry A. Davis!JVmI16MXo. 02/14/15 (Sat) 20:51:18 No.38

>>33
I'm not really interested. TempleOS is 80,000 lines of code. Perhaps LISP could go in the remaining 20,000. A lot of people like functional languages. Perhaps, they would be good for video game A.I. opponents. I don't really know enough. I don't see anything wonderful – just trick problems that happen to work.

Anonymous 02/14/15 (Sat) 21:39:11 No.51

i said post your favorite algorithms, why should they be in holyC? i never said add lisp to templeos, i said post your favorite algorithms.

Anonymous 02/14/15 (Sat) 21:39:52 No.52

i said post your favorite algorithms, why should they be in holyC? i never said add lisp to templeos, i said post your favorite algorithms.

Terry A. Davis!JVmI16MXo. 02/14/15 (Sat) 21:48:02 No.53

>>52
I was the first person to factor to cubic root in magic pairs.

http://www.templeos.org/Wb/Demo/MagicPairs.html#l1