algorithms

“ from mpmath.lib import giant_steps, lshift, rshift from math import log START_PREC = 15 def size(x): if isinstance(x, (int, long)): return int(log(x,2)) # GMPY support return x.numdigits(2) def newdiv(p, q): szp = size(p) szq = size(q) szr = szp - more...

“The problem we're trying to solve is to get a game object from the starting point to a goal. Pathfinding addresses the problem of finding a good path from the starting point to the goal―avoiding obstacles, avoiding enemies, and minimizing more...

On how programming is more about fixing dreadful bugs and doing the same things over and over again, instead of focusing on how to create algorithms. Luckily, the author found Project Euler.

Ok, so here's where I tell all about how I (now we) got to be tied for third place on the netflix prize. And I don't mean a sordid tale of computing in the jungle, but rather the actual math more...

Here’s why radix tries are cool: Search performance varies with the key size. More importantly, radix tries give you lexicographic matching.

"Take the names of two U.S. States, mix them all together, then rearrange the letters to form the names of two other U.S. States. What states are these?"

"The Seattle Post-Intelligencer is reporting that a local attorney is suing legal startup Avvo over a rating that was algorithmically assigned. The story covers the controversy of computers grading humans. 'Browne, who has participated in a number of high-profile cases more...

The classic paper.