3,398 reputation
11233
bio website eelvex.net
location Greece
age
visits member for 3 years, 6 months
seen Jul 15 at 21:52

(+.-.)@+: b that is the question and the answer is always true.


Jul
14
awarded  Nice Question
Jul
11
awarded  Good Answer
Jul
2
awarded  Curious
Jun
27
awarded  Taxonomist
May
18
awarded  Nice Question
Apr
30
comment How Slow Is Python Really (Part II)?
What I used in J was a prebuild list of 4^n numbers in base-4, then converted to triadic and excluding 0. The RNG just chooses from this list.
Apr
29
comment How Slow Is Python Really (Part II)?
@Lembik thanks I'll try that. You can get J here if you like.
Apr
29
awarded  Popular Question
Apr
29
comment How Slow Is Python Really (Part II)?
@ace, it seems on par with the C version, no?
Apr
29
comment How Slow Is Python Really (Part II)?
@Lembik I'm not sure; something is not quite right with this debian installation. 'sid/main puppy ... 404 Not Found'
Apr
29
revised How Slow Is Python Really (Part II)?
added 33 characters in body
Apr
29
comment How Slow Is Python Really (Part II)?
Indeed, not necessarily.
Apr
29
comment How Slow Is Python Really (Part II)?
@ace yes I noticed but I can't install pypy :-/ I think the order of magnitude will remain though.
Apr
29
answered How Slow Is Python Really (Part II)?
Apr
29
comment How Slow Is Python Really (Part II)?
Are "slight" algorithmic changes allowed?
Mar
16
comment Convert a repeated decimal to a fraction
Use ('0','x',~]) and save a byte.
Mar
14
comment Tree traversal.
@sindikat, the order traversed.
Mar
13
awarded  Nice Answer
Mar
11
comment Shortest Program to Solve a Quartic Equation
@steveverrill, the bisection will never fail no matter what, because from an interval (+,-) you choose the midpoint that it's either +,-,or 0. In any case you can either form a new interval (+,-) or you have a solution. The weak point of my algorithm is the scanning which might go on and on. My scanning makes dx steps left and right (x-dx, x+dx) and compares them to x=0. If (x,x+-dx) <= 0, we have an interval to bisect. It would be tremendounsly faster and robust if I used Sturm's polynomial to make an initial guess but I was too tired :)
Mar
11
comment Shortest Program to Solve a Quartic Equation
Nice. BTW, theoretically my answer always finds a root if it exists since I use the bisection method. Practically it might need too much time if the smallest root is a very-very big number.