Monday, Apr 21, 2008 [Tweets] [Favorites]

O Notation via Calculus

Jake Voytko shows how to derive big-O estimates of algorithmic complexity using integration. The normal CS way is to solve recurrences, which can be more precise than necessary and may be more difficult (or, at least, less familiar).

Comments

Stay up-to-date by subscribing to the Comments RSS Feed for this post.

Leave a Comment