[ create a new paste ] login | about

Project: programmingpraxis
Language:
Description:
None

Recent Pastes:

programmingpraxis - Scheme, pasted yesterday: 
1
2
3
4
5

; data encryption standard

(define (vector-map proc . vecs)
  (define (elt i)
    (lambda (vec)
...
view (394 lines)
programmingpraxis - Scheme, pasted on Sep 1: 
1
2
3
4
5

; data encryption standard

(define (vector-map proc . vecs)
  (define (elt i)
    (lambda (vec)
...
view (394 lines)
programmingpraxis - Scheme, pasted on Sep 1: 
1
2
3
4
5

; data encryption standard

(define (vector-map proc . vecs)
  (define (elt i)
    (lambda (vec)
...
view (386 lines)
programmingpraxis - Scheme, pasted on Sep 1: 
1
2
3
4
5

; data encryption standard

(define (vector-map proc . vecs)
  (define (elt i)
    (lambda (vec)
...
view (246 lines, 2 lines of output)
programmingpraxis - Scheme, pasted on Aug 30: 
1
2
3
4
5

; data encryption standard

(define (vector-map proc . vecs)
  (define (elt i)
    (lambda (vec)
...
view (249 lines, 2 lines of output)
Haskell, pasted on Aug 29: 
1
2
3

fib 0 = 0
fib 1 = 1
fib n = ((n - 2) + (n - 1))
view (3 lines, 2 lines of output)
Haskell, pasted on Aug 29: 
1
2
3
4
5

fib 0 = 0
fib 1 = 1
fib n = ((n - 2) + (n - 1))

map (fib) [0..20]
view (5 lines, 2 lines of output)
programmingpraxis - Scheme, pasted on Aug 24: 
1
2
3
4
5

; chinese remainder theorem

(define (euclid x y)
  (let loop ((a 1) (b 0) (g x) (u 0) (v 1) (w y))
    (if (zero? w) (values a b g)
...
view (23 lines, 1 line of output)
Scheme, pasted on Aug 24: 
1
2
3
4
5

; lexicographic permutations

(define (next-perm lt? zs)
  (if (null? zs) zs
    (let next ((xlist (list (car zs))) (ys (cdr zs)))
...
view (29 lines, 5 lines of output)
programmingpraxis - Scheme, pasted on Aug 22: 
1
2
3
4
5

; chinese remainder theorem

(define (euclid x y)
  (let loop ((a 1) (b 0) (g x) (u 0) (v 1) (w y))
    (if (zero? w) (values a b g)
...
view (33 lines, 7 lines of output)
Scheme, pasted on Aug 22: 
1
2
3
4
5

; chinese remainder theorem

(define (euclid x y)
  (let loop ((a 1) (b 0) (g x) (u 0) (v 1) (w y))
    (if (zero? w) (values a b g)
...
view (33 lines, 7 lines of output)
Scheme, pasted on Aug 22: 
1
2
3
4
5

; chinese remainder theorem

(define (euclid x y)
  (let loop ((a 1) (b 0) (g x) (u 0) (v 1) (w y))
    (if (zero? w) (values a b g)
...
view (32 lines, 2 lines of output)
programmingpraxis - Scheme, pasted on Aug 21: 
1
2
3
4
5

; shanks' square form factorization algorithm

(define (isqrt n)
  (if (not (and (positive? n) (integer? n)))
      (error 'isqrt "must be positive integer")
...
view (72 lines, 1 line of output)
programmingpraxis - Scheme, pasted on Aug 21: 
1
2
3
4
5

(define (isqrt n)
  (if (not (and (positive? n) (integer? n)))
      (error 'isqrt "must be positive integer")
      (let loop ((x n))
        (let ((y (quotient (+ x (quotient n x)) 2)))
...
view (70 lines, 1 line of output)
Scheme, pasted on Aug 21: 
1
2
3
4
5

(define (isqrt n)
  (if (not (and (positive? n) (integer? n)))
      (error 'isqrt "must be positive integer")
      (let loop ((x n))
        (let ((y (quotient (+ x (quotient n x)) 2)))
...
view (70 lines, 1 line of output)
Scheme, pasted on Aug 21: 
1
2
3
4
5

; shanks's squfof

(define (isqrt n)
  (if (not (and (positive? n) (integer? n)))
      (error 'isqrt "must be positive integer")
...
view (153 lines, 1 line of output)
programmingpraxis - Scheme, pasted on Aug 21: 
1
2
3
4
5

; shanks's squfof

(define (isqrt n)
  (if (not (and (positive? n) (integer? n)))
      (error 'isqrt "must be positive integer")
...
view (153 lines, 1 line of output)
programmingpraxis - Scheme, pasted on Aug 19: 
1
2
3
4

;;; standard prelude


; list utilities
...
view (864 lines)
Scheme, pasted on Aug 19: 
1
2
3
4

;;; standard prelude


; list utilities
...
view (864 lines)
programmingpraxis - Scheme, pasted on Aug 19: 
1
2
3
4
5

; marriage sort

(define (isqrt n)
  (if (not (and (positive? n) (integer? n)))
      (error 'isqrt "must be positive integer")
...
view (52 lines, 1 line of output)