1h
comment Project Euler #50, prime sums not correct?
now your answer is correct, and it being accepted is OK. :) note, if you'd say "my answer is wrong" it'd cause all kinds of paradoxes, being accepted. by saying "old answer was wrong" you avoid all that... :) happy travels!
2h
comment What is the difference between a cyclic list and an infinite list in haskell?
@PyRulez of course. the question still remains whether a list structure is retained in memory created by [1..1000000], or not at all, since the definition itself is dormant until coming to life by demand from some print upstream. Haskell list==Python generator + storage of results IF needed. [1..10000000] is a generator definition which can just be fired up the second time, instead of storing all the previously generated elements. doing the extra effort of repeated generation is much better than taking up huge areas of memory (but not small ones, there it's the other way).
5h
revised Find prime factors such that difference is smallest as possible
deleted 131 characters in body
5h
comment Find prime factors such that difference is smallest as possible
@vish4071 no, it is so only in worst case of prime or semiprime, because the found factor is divided out of the number n being factorized, n = n/f, so the upper bound becomes less and less with each found factor. In case of 259459200 it will work only until 11, not 16107.
21h
revised Find prime factors such that difference is smallest as possible
added 6 characters in body
21h
answered Find prime factors such that difference is smallest as possible
1d
revised Creating a set from a list in Prolog
added 57 characters in body
1d
revised Creating a set from a list in Prolog
added 57 characters in body
1d
answered Creating a set from a list in Prolog
1d
comment Create a prolog program that solves the peg jump puzzle
[[r, r, r, r], [o], [b, b, b, b]] and linjmp([r, o | T], [o, r | T]) use incompatible board representations.
1d
reviewed Reject suggested edit on Create a prolog program that solves the peg jump puzzle
1d
revised Binding time of free variables of quoted terms in Scheme
added 35 characters in body
1d
comment Binding time of free variables of quoted terms in Scheme
what implementation? "typing" where -- at the REPL, in a file?
1d
revised Binding time of free variables of quoted terms in Scheme
edited tags
1d
answered Binding time of free variables of quoted terms in Scheme
1d
revised Calculate Huge Fibonacci number modulo M in C++
added 1 character in body
1d
answered Calculate Huge Fibonacci number modulo M in C++
2d
revised Create a prolog program that solves the peg jump puzzle
add more efficient code
2d
comment Create a prolog program that solves the peg jump puzzle
Exactly. Store and continue -- or stop temporarily, report to user and ask whether to continue or abort (jump back up through all the layers of recursion). That's what Prolog's interactive prompt is usually doing. Or if your language is lazy, you can store all the solutions, but a separate process will provide them one by one to a user, again with possibility to abort the search early.
2d
comment Is there any language that allows a break through multiple loops?
@Leushenko "on top of structured loops of today" i.e. where those structured constructs are inadequate and you must resort to maintaining a tangled web of "flags", one clean goto instead is preferable, is what I obviously meant. but YMMV.
1 2 3 4 5