Algorithms for making more interesting mazes edit / delete

Nicely related to graph algorithms. CMP201 students will probably find this interesting!

to algorithms cmp201 games graph maze ... on 06 April

qp tries edit / delete

"A qp trie is like a crit-bit trie (aka patricia trie) except each branch is indexed by a few bits at a time instead of one bit. The array of sub-tries at a branch node is compressed using the popcount trick to omit unused branches." I'm thinking about teaching crit-bit tries in CMP201 next year...

to cmp201 data-structures trie ... on 06 April

Accidentally Quadratic edit / delete

"I started this blog because over my career so far as a software engineer, I’ve kept personally running into software that was slow, and wondering why. And when I had time to point a profiler at them and debug the slowness, I would very often discover quadratic behavior, which could usually be drastically improved to linear, with just a little work."

to algorithms cmp201 complexity performance programming ... on 27 November 2016

Browser bookmarks: tasty+ | tasty= Log in | Export | Atom