Finding Big O of the Harmonic Series

by

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.

More Related Contents:

  1. Computational complexity of Fibonacci Sequence
  2. How to solve T(n)=4T(sqrt(n/2))+n^(3/2)
  3. What is a plain English explanation of “Big O” notation?
  4. Time complexity of nested for-loop
  5. What is O(log(n!)) and O(n!) and Stirling Approximation
  6. What would cause an algorithm to have O(log log n) complexity?
  7. What is O(log(n!)), O(n!), and Stirling’s approximation?
  8. What is the complexity of this simple piece of code?
  9. Why do we ignore co-efficients in Big O notation?
  10. Can an O(n) algorithm ever exceed O(n^2) in terms of computation time?
  11. Computing time complexity in C [closed]
  12. Calculating Big O Notation for a algorithm [duplicate]
  13. How can I find the time complexity of an algorithm?
  14. What does O(log n) mean exactly?
  15. Difference between Big-O and Little-O Notation
  16. Time complexity of python set operations?
  17. Is list::size() really O(n)?
  18. Time complexity of Euclid’s Algorithm
  19. Are there any O(1/n) algorithms?
  20. What is Constant Amortized Time?
  21. What would cause an algorithm to have O(log n) complexity?
  22. Is there anything that guarantees constant time for accessing a property of an object in JavaScript?
  23. Sorting in linear time? [closed]
  24. What is Big O notation? Do you use it? [duplicate]
  25. Big O of JavaScript arrays
  26. Prove that binary heap build max comparsion is (2N-2)
  27. What’s the time complexity of iterating through a std::set/std::map?
  28. Why is bubble sort O(n^2)?
  29. Computational complexity of base conversion
  30. Example of O(n!)?

Leave a Comment