What is the Big-O of a nested loop, where number of iterations in the inner loop is determined by the current iteration of the outer loop?

by

Yep, it’s still O(n^2), it has a smaller constant factor, but that doesn’t affect O notation.

More Related Contents:

  1. What is the difference between Θ(n) and O(n)?
  2. Time complexity of nested for-loop
  3. What does “O(1) access time” mean? [duplicate]
  4. Can an O(n) algorithm ever exceed O(n^2) in terms of computation time?
  5. Python single line for loops [duplicate]
  6. Breaking out of a nested loop
  7. How can building a heap be O(n) time complexity?
  8. Implement a queue in which push_rear(), pop_front() and get_min() are all constant time operations
  9. Big-O for Eight Year Olds? [duplicate]
  10. Which algorithm is faster O(N) or O(2N)?
  11. Big-O summary for Java Collections Framework implementations? [closed]
  12. How to break nested loops in JavaScript? [duplicate]
  13. Python dictionary keys. “In” complexity
  14. Is Big O(logn) log base e?
  15. Append an object to a list in R in amortized constant time, O(1)?
  16. What is the complexity of regular expression?
  17. Time complexity of Hash table
  18. multiset, map and hash map complexity
  19. Why does Python have a limit on the number of static blocks that can be nested?
  20. Big-O of list slicing
  21. A puzzle related to nested loops
  22. Passing argument from Parent function to nested function Python
  23. Quicksort superiority over Heap Sort
  24. What is the complexity of this simple piece of code?
  25. How can std::make_heap be implemented while making at most 3N comparisons?
  26. Time Complexity of two for loops [duplicate]
  27. What’s the time complexity of iterating through a std::set/std::map?
  28. What is the Big O Complexity of Reversing the Order of Columns in Pandas DataFrame?
  29. How to nest multiple parfor loops
  30. Example of O(n!)?

Leave a Comment