Logo Questions Linux Laravel Mysql Ubuntu Git Menu
 

Finding Big O of the Harmonic Series

Prove that

1 + 1/2 + 1/3 + ... + 1/n is O(log n).  Assume n = 2^k 

I put the series into the summation, but I have no idea how to tackle this problem. Any help is appreciated

like image 646
user2092408 Avatar asked Sep 18 '14 05:09

user2092408


People also ask

What is the time complexity of harmonic series?

Hence k = log (n) . So, number of times it ran = log(n) + 1 = O(log n) .


2 Answers

This follows easily from a simple fact in Calculus:

enter image description here

and we have the following inequality:

enter image description here

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.

like image 78
chiwangc Avatar answered Nov 27 '22 04:11

chiwangc


Here's a formulation using Discrete Mathematics:

enter image description here So, H(n) = O(log n)

like image 24
Sushovan Mandal Avatar answered Nov 27 '22 04:11

Sushovan Mandal