Finding Big O of the Harmonic Series

蹲街弑〆低调 提交于 2019-11-26 17:40:36

This follows easily from a simple fact in Calculus:

and we have the following inequality:

Here we can conclude that S = 1 + 1/2 + ... + 1/n is both Ω(log(n)) and O(log(n)), thus it is Ɵ(log(n)), the bound is actually tight.

Here's a formulation using Discrete Mathematics:

So, H(n) = O(log n)

易学教程内所有资源均来自网络或用户发布的内容,如有违反法律规定的内容欢迎反馈
该文章没有解决你所遇到的问题?点击提问,说说你的问题,让更多的人一起探讨吧!