Why is O(n) better than O( nlog(n) )?

It turned out, I misunderstood Logn to be lesser than 1. As I asked few of my seniors i got to know this today itself, that if the value of n is large, (which it usually is, when we are considering Big O ie worst case), logn can be greater than 1.

So yeah, O(1) < O(logn) < O(n) < O(nlogn) holds true.

(I thought this to be a dumb question, and was about to delete it as well, but then realised, no question is dumb question and there might be others who get this confusion so I left it here.)

Related Posts:

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