newlispfanclub.alh.net

Thanks, Lutz !
Grazie Lutz !

Thanks Lutz. Anyway i have found a strange thing: raising an error on REPL reset the time. For example, type the following on REPL: (set) ERR: missing argument in function set Now timing the function will restart the problem (but time is reset to first value 1750.432): (time (merge (sequence 1 500) ...

@Lutz: Seems to me that you test the wrong function: (define (merge lstA lstB op) (sort (append lstA lstB) op)) This works well. The "time growing" problem arise with the following two functions : (define (merge lstA lstB op) (define (ciclo out lstA lstB) (cond ((null? lstA) (extend (reverse out) l...

@rickyboy:
i'm trying to solve the problem of time growing. I know that the Scheme style is not good for newLISP.
And yes, i'm a student...forever :-)
Thanks for the help.

@rickyboy and @ralph.ronnquist
Sorry, I didn't explain myself well. The function i tried was "merge" with temporary heap function.
The function with sort works well.
By the way, the fastest function is "merge-via-loop".
Thanks.

@ralph.ronnquist: I have tried your function (in a fresh REPL), but the result are the same: > (time (merge (sequence 1 500) (sequence 1 200) <) 500) 1842.392 > (time (merge (sequence 1 500) (sequence 1 200) <) 500) 2290.107 > (time (merge (sequence 1 500) (sequence 1 200) <) 500) 2831.184 > (time ...

Thanks for the info.

btw. what's wrong with:
(define (merge lstA lstB op) (sort (append lstA lstB) op))

Nothing :-) It's ok.
But I would like to know the cause of the problem.
Have a nice day.

Thanks Rickyboy.
I known, the Scheme style is not suitable for newLISP :-)
But I'd like to know what creates the problem.
Time function or my merge function?
Have a nice day

I have a problem with the following function who merge two ordered lists in a new list. (define (merge lstA lstB op) (define (ciclo out lstA lstB) (cond ((null? lstA) (extend (reverse out) lstB)) ((null? lstB) (extend (reverse out) lstA)) ((op (first lstB) (first lstA)) (ciclo (cons (first lstB) out...

A perfect power is a number n of the form m^k, where m>1 is a positive integer and k>=2. If the prime factorization of n is n=p1^(a1)*p2^(a2)...pk^(ak), then n is a perfect power iff GCD(a1,a2,...,ak) > 1. The "factor-exp-list" function calculates the list of exponents of the factorization of the nu...

For theory see: https://en.wikipedia.org/wiki/Wheel_factorization (define (factorbig n) (local (f k i dist out) ; Distanze tra due elementi consecutivi della ruota (wheel) (setq dist (array 48 '(2 4 2 4 6 2 6 4 2 4 6 6 2 6 4 2 6 4 6 8 4 2 4 2 4 8 6 4 6 2 4 6 2 6 6 4 2 4 6 2 6 4 2 4 2 10 2 10))) (set...

In number theory, a Carmichael number is a composite number n which satisfies the modular arithmetic congruence relation: b^(n-1) ≡ 1 mod n for all integers b which are relatively prime to n. https://en.wikipedia.org/wiki/Carmichael_number (define (fattorizza x) (letn (fattori (factor x) unici (uniq...

Try this: (define (breaknum n) (if (even? n) nil (list (* (- n (/ n 2)) (- n (/ n 2))) (* (/ n 2) (/ n 2)) ))) (breaknum 11) ;-> (36 25) (breaknum 9527) ;-> (22695696 22686169) Proof 1) Pick an odd number (5): OOOOO 2)Bend it in half: OOO O O 3) Fill the rest: OOO OXX OXX The odd number is the area ...

Thanks ralph.ronnquist. This is faster than mine :-)
Have a nice day.

Two functions to calculate twin primes (pairs and pairs-i). (define (prime? n) (if (even? n) nil (= 1 (length (factor n))))) (define (twin? n) (if (and (prime? n) (prime? (+ n 2))) (list n (+ n 2)) nil)) (twin? 9) ;-> nil (twin? 881) ;-> (881 883) (define (pairs a b) (filter true? (map twin? (sequen...

Thanks ralph.ronnquist.
I'm looking for a simple way to build "Lagrange Polynomial Interpolation". It is a bit more complex than polynomials.
Have a nice day.
cameyo

Suppose we have the polynomial y (x) = 3*x^2 - 7*x + 5 and we want to calculate the values of y for x ranging from 0 to 10 (with step 1). We can define a function that represents the polynomial: (define (poly x) (+ 5 (mul 7 x) (mul 3 (pow x 2)))) (poly 0) ;-> 5 And then to get the searched values: (...

@kosh: thanks. I'll study it as soon as possible.

In the Church encoding of natural numbers, the number N is encoded by a function that applies its first argument N times to its second argument. Church zero always returns the identity function, regardless of its first argument. In other words, the first argument is not applied to the second argumen...

Thanks rickyboy.
I'll use your rational functions ;-)

Which type of pseudo-random number generator uses newLISP?
Thanks.

From https://rosettacode.org/wiki/Pathological_floating_point_problems Problem The Chaotic Bank Society is offering a new investment account to their customers. You first deposit $ (e - 1) where "e" is 2.7182818 (the base of natural logarithms). After each year, your account balance will be multipli...

From: https://en.wikipedia.org/wiki/Karatsuba_algorithm (define (potenza n m) (let (pot 1L) (dotimes (x m) (setq pot (* pot n)))) ) (potenza 3 6) ;-> 729L Iterative: (define (karatsuba num1 num2) (local (m m2 high1 low1 high2 low2 z0 z1 z2) (cond ((or (< num1 10) (< num2 10)) (* num1 num2)) (true (s...

From: https://en.wikipedia.org/wiki/Maze_solving_algorithm The recursive solution with newLISP: (define (solveMaze matrice sRow sCol eRow eCol) (local (maze row col visited correctPath starRow startCol endRow endCol) ; matrice labirinto (setq maze matrice) ; righe della matrice (setq row (length maz...

(setq a 1 b 2) (let (l (+ a b)) (println l)) ;-> 3 (let (a 4 b 5 l (+ a b)) (println a { } b { } l)) ;-> 4 5 3 ; l = 3 because in the expression (+ a b), a = 1 and b = 2. Use letn to solve this: (letn (a 4 b 5 l (+ a b)) (println a { } b { } l)) ;-> 4 5 9 ; Now l = 9 because inside the letn express...