Are there any real O(n^n) algorithms?

What you have coded in your example is very similar to a depth first search. So, that’s one answer.

A depth first search algorithm without any special characteristics ( like re-convergent paths that can be optimized out ), should be n^n.

This is actually not a contrived example. Chess programs operate on the same algorithm. Each move there are n moves to consider ( i.e. branches ), and you search d moves deep. So that becomes O(n^d)

Related Posts:

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

Leave a Comment