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).
No Comments »
No comments yet.
RSS feed for comments on this post. TrackBack URI
