What is O(log* N)?

O( log* N ) is “iterated logarithm“:

In computer science, the iterated logarithm of n, written log* n (usually read “log star”), is the number of times the logarithm function must be iteratively applied before the result is less than or equal to 1.

Related Posts:

  1. What is the big-O of the function (log n)^k
  2. Is log(n!) = Θ(n·log(n))?
  3. Difference between O(n) and O(log(n)) – which is better and what exactly is O(log(n))?
  4. In a triangulated isometric grid, what triangle is a given point in?
  5. Big O, how do you calculate/approximate it?
  6. Big-oh vs big-theta
  7. Exactly how many comparisons does merge sort make?
  8. How to calculate big-theta
  9. Intuitive explanation for why QuickSort is n log n?
  10. Calculate distance between two latitude-longitude points? (Haversine formula)
  11. How to calculate time complexity of backtracking algorithm?
  12. Which is better: O(n log n) or O(n^2)
  13. How to calculate an angle from three points?
  14. Are there any real O(n^n) algorithms?
  15. How to determine if a point is in a 2D triangle?
  16. What is a loop invariant?
  17. What is a loop invariant?
  18. Unfamiliar symbol in algorithm: what does ∀ mean? [closed]
  19. What does O(log n) mean exactly?
  20. how to calculate binary search complexity
  21. When is it practical to use Depth-First Search (DFS) vs Breadth-First Search (BFS)? [closed]
  22. What does O(log n) mean exactly?
  23. What is Sliding Window Algorithm? Examples?
  24. Quicksort with Python
  25. What is the difference between tree depth and height?
  26. how to implement quick sort algorithm in C++
  27. Python: maximum recursion depth exceeded while calling a Python object
  28. Why is the time complexity of both DFS and BFS O( V + E )
  29. Time complexity of a Priority Queue in C++
  30. What is stability in sorting algorithms and why is it important?
  31. Breadth First Search time complexity analysis
  32. Counting the sum of every nodes’ neighbors’ degrees?
  33. Time Complexity of the Kruskal Algorithm?
  34. Quick Sort Vs Merge Sort
  35. Polynomial time and exponential time
  36. Insertion Sort vs. Selection Sort
  37. Difference and advantages between dijkstra & A star
  38. Example of O(n!)?
  39. Best Case for Bubble Sort
  40. How to find the kth smallest element in the union of two sorted arrays?
  41. When will the worst case of Merge Sort occur?
  42. Performing Breadth First Search recursively
  43. Is Quicksort in-place or not?
  44. longest increasing subsequence(O(nlogn))
  45. O(n log n) vs O(n) — practical differences in time complexity
  46. When should I use Kruskal as opposed to Prim (and vice versa)?
  47. Trying to understand max heapify
  48. Shortest possible depth of a leaf in decision tree (comparison sorting algorithm)
  49. Python Weighted Random [duplicate]
  50. What is the meaning of “exclusive” and “inclusive” when describing number ranges?
  51. What’s a good algorithm to generate a maze?
  52. Intuition for perceptron weight update rule
  53. Easy: Solve T(n)=T(n-1)+n by Iteration Method
  54. What is tail call optimization?
  55. PacMan: what kinds of heuristics are mainly used?
  56. Quicksort vs heapsort
  57. Best case time complexity for selection sort
  58. Looking for algorithm finding euler path
  59. Trie complexity and searching
  60. What does this definition of contiguous subsequences mean?
  61. Is complexity O(log(n)) equivalent to O(sqrt(n))?
  62. How to find maximum spanning tree?
  63. Algorithm to return all combinations of k elements from n
  64. What is the time complexity of while loops?
  65. Merge sort time and space complexity
  66. Shuffle a deck of cards in Java
  67. Median of Medians in Java
  68. What is a loop invariant?
  69. Hash table runtime complexity (insert, search and delete)
  70. Quickselect time complexity explained
  71. What is the proper equivalent of “while(true)” in plain C?
  72. Bellman-Ford vs Dijkstra: Under what circumstances is Bellman-Ford better?
  73. Asymptotic Notation – does n (log n) (log n) simplify?
  74. Difference between Big-O and Little-O Notation
  75. Why is O(n) better than O( nlog(n) )?
  76. How to solve: T(n) = T(n/2) + T(n/4) + T(n/8) + (n)
  77. Is there an O(n) integer sorting algorithm?
  78. An example of Best Case Scenario for Quick Sort (Need someone to check if my answer is correct)
  79. how to write a recurrence relation for a given piece of code
  80. Why is merge sort worst case run time O (n log n)?
  81. Why is merge sort worst case run time O (n log n)?
  82. What is the time and space complexity of a breadth first and depth first tree traversal?
  83. Create your own MD5 collisions
  84. Image Segmentation using Mean Shift explained
  85. Finding the median of an unsorted array
  86. Difference between Big-Theta and Big O notation in simple language
  87. What is the difference between bucket sort and radix sort?
  88. How are the following functions O(N^3)?
  89. Finding all possible combinations of numbers to reach a given sum
  90. Sorting an array in C?
  91. Finding square root without using sqrt function?
  92. Is Dijkstra’s algorithm for directed or undirected graphs?
  93. Modular multiplicative inverse function in Python
  94. Minesweeper solving algorithm
  95. About bubble sort vs merge sort
  96. Safest way to convert float to integer in python?
  97. Java Round up Any Number
  98. What is the difference between ‘/’ and ‘//’ when used for division?
  99. How can I check if two segments intersect?
  100. When should we use Radix sort?

Leave a Comment