Showing the order of growth of the function

by

The body of the inner loop is executed n times.

The body of the outer loop is executed for all powers of 2 from 1 to n and there are about log2(n) of them, hence the global complexity

O(n.log(n))

More Related Contents:

  1. What is the fastest search algorithm for a list with names and numbers
  2. O(3^n) exponential time complexity [closed]
  3. Java lambdas 20 times slower than anonymous classes
  4. What would be the fastest method to test for primality in Java?
  5. What is the time complexity of HashMap.containsKey() in java?
  6. Hash Set and Array List performances
  7. Time complexity of System.arraycopy(…)?
  8. Random Number Algorithm – Implementation in Java
  9. Write a program that takes an array/arraylist of integer and finds longest sub array/arraylist whose entries are equal [closed]
  10. How to check if an integer is in a set of given ranges? [closed]
  11. What is Difference between Static Variable and Static method and Static Class? [duplicate]
  12. Permutation of array
  13. Generate all combinations from multiple lists
  14. Efficient swapping of elements of an array in Java
  15. Take n random elements from a List?
  16. Why is adding an OnClickListener inside onBindViewHolder of a RecyclerView.Adapter considered bad practice?
  17. Time complexity of Java’s substring()
  18. java indexof(String str) method complexity [duplicate]
  19. A better algorithm to find the next palindrome of a number string
  20. Anagram algorithm in java
  21. Most efficient way of converting String to Integer in java
  22. Java thread creation overhead
  23. How to speed up Java VM (JVM) startup time?
  24. implementing debounce in Java
  25. How do I get the intersection between two arrays as a new array?
  26. How to find the only number in an array that doesn’t occur twice [duplicate]
  27. ‘MergeSort Algorithm’ – What’s the better implementation in JAVA? [closed]
  28. What GC parameters is a JVM running with?
  29. Finding the shortest path nodes with breadth first search
  30. Mergesort in java

Leave a Comment