Iterated Logarithm or Log*(n) is the number of times the logarithm function must be iteratively applied before the result is less than or equal to 1.
Applications: It is used in analysis of algorithms (Refer Wiki for details)
Log*(100) = 2
Iterative Implementation :
This article is contributed by Abhishek rajput. If you like GeeksforGeeks and would like to contribute, you can also write an article using contribute.geeksforgeeks.org or mail your article to email@example.com. See your article appearing on the GeeksforGeeks main page and help other Geeks.
Please write comments if you find anything incorrect, or you want to share more information about the topic discussed above.
Improved By : jit_t
- Time complexity of recursive Fibonacci program
- A Time Complexity Question
- Understanding Time Complexity with Simple Examples
- Program to find correlation coefficient
- Analysis of Algorithms | Set 2 (Worst, Average and Best Cases)
- Difference between Deterministic and Non-deterministic Algorithms
- Python Code for time Complexity plot of Heap Sort
- Applications of Hashing
- Sorting without comparison of elements
- Measure execution time with high precision in C/C++