The worst-case is indeed arbitrarily long, but the amortized runtime can be anal... | Hacker News

Hacker Newsnew | past | comments | ask | show | jobs | submit

jankassens on Jan 20, 2011 | parent | context | favorite | on: Maze Generation: Wilson's algorithm

The worst-case is indeed arbitrarily long, but the amortized runtime can be analyzed.

See: http://en.wikipedia.org/wiki/Amortized_analysis

Guidelines | FAQ | Lists | API | Security | Legal | Apply to YC | Contact