Order functions by growth rate

EDIT: I’ve revised my answer based on the comments

I’ve got this HW question which asks me to order a list of functions by their growth rate. The question also asks to indicate which ones have the same growth rate. Here are the functions:

  • N
  • sqrt(N)
  • N^1.5
  • N^2
  • N log N
  • N log log N
  • N log^2(N)
  • N log(N^2)
  • 2/N
  • 2^N
  • 2^(N/2)
  • 37
  • N^3
  • N^2logN

And here is my answer. Bolded functions are what I think are the same:

  • 37
  • sqrt(N)
  • N^1.5
  • N
  • N log log N
  • N log N
  • N log^2(N)
  • N log (N^2)
  • N^2 log N
  • N^2
  • N^3
  • 2^(N/2)
  • 2^(N)
  • 2/N

This question is really confusing me. Is my answer correct? I used Wolfram Alpha to graph the functions, but comparing the growths got very complicated.

EDIT: My revised answer.

2/N, 37, sqrt(N), N^

Related Posts:

  1. What does O(log n) mean exactly?
  2. What does O(log n) mean exactly?
  3. Understanding Time complexity calculation for Dijkstra Algorithm
  4. O(n log n) vs O(n) — practical differences in time complexity
  5. Why lookup in a Binary Search Tree is O(log(n))?
  6. Which is better: O(n log n) or O(n^2)
  7. Difference between Big-O and Little-O Notation
  8. How do I find the time complexity (Big O) of while loop?
  9. Why is O(n) better than O( nlog(n) )?
  10. Computational complexity of Fibonacci Sequence
  11. A tool for calculating the big-O time complexity of Java code? [closed]
  12. Time complexity of nested for-loop
  13. How do I check if an array includes a value in JavaScript?
  14. how to calculate binary search complexity
  15. what does O(N) mean [duplicate]
  16. Why is the time complexity of both DFS and BFS O( V + E )
  17. Time complexity of a Priority Queue in C++
  18. Explanation of runtimes of BFS and DFS
  19. Breadth First Search time complexity analysis
  20. How can you profile a Python script?
  21. Time Complexity of Prims Algorithm?
  22. Time Complexity of the Kruskal Algorithm?
  23. Determining complexity for recursive functions (Big O notation)
  24. How do you add a timed delay to a C++ program?
  25. Lua Program Delay
  26. Example of O(n!)?
  27. When will the worst case of Merge Sort occur?
  28. Big O, how do you calculate/approximate it?
  29. Will Arrays.sort() increase time complexity and space time complexity?
  30. How to create an accurate timer in javascript?
  31. Best case time complexity for selection sort
  32. Trie complexity and searching
  33. Is log(n!) = Θ(n·log(n))?
  34. Is complexity O(log(n)) equivalent to O(sqrt(n))?
  35. How to calculate big-theta
  36. What is the time complexity of while loops?
  37. Merge sort time and space complexity
  38. Which is faster C++ String length() or size()?
  39. How to calculate time complexity of backtracking algorithm?
  40. Why does heap sort have a space complexity of O(1)?
  41. Hash table runtime complexity (insert, search and delete)
  42. Quickselect time complexity explained
  43. Big Oh for (n log n)
  44. What is the big-O of the function (log n)^k
  45. Is there an O(n) integer sorting algorithm?
  46. Which algorithm is faster O(N) or O(2N)?
  47. Difference between Big-Theta and Big O notation in simple language
  48. How are the following functions O(N^3)?
  49. Difference between O(n) and O(log(n)) – which is better and what exactly is O(log(n))?
  50. Are there any real O(n^n) algorithms?
  51. What is O(log(n!)) and O(n!) and Stirling Approximation
  52. Big O Complexity in Binary Search Tree(BST)
  53. Running time of algorithm A is at least O(n²) – Why is it meaningless?

Leave a Comment