# What makes this algorithm O log n

There are times when you will work with billions of elements (and more), where that difference will certainly be significant.

There are other times when you will be working with less than a thousand elements, in which case the difference probably won't be all that significant.

If you have a decent idea what your data will look like, you should have a decent idea which one to pick from the start, but the difference between O(n) and O(n log n) is small enough that it's probably best to start off with whichever one is simplest, benchmark it and only try to improve it if you see it's too slow.

However, note that O(n) may actually be slower than O(n log n) for any given value of n (especially, but not necessarily, for small values of n) because of the constant factors involved, since big-O ignores those (it only considers what happens when n tends to infinity), so, if you're looking purely at the time complexity, what you think may be an improvement may actually slow things down.

- Which sector badly needs startups
- Is BCA a professional course
- Who is a fearless politician in India
- What are some good rhomboid stretches
- Is Chennai much smaller than Bengaluru
- Who was the sun god Aten
- How do I get a donation back
- Is The Lallantop pro Congress
- How do you have good writing skills
- Why do I wake up shaking
- Do Herbalife Total Control pills work
- What is a photon of light
- What hedge fund does Epstein manage
- What programmers entrepreneurs do you know
- How do I crack bookmyshow interview
- What dubstep song has the sickest drop
- What are doubly degenerate orbitals
- What is the geometry of carbanion
- Is IIEST also IIT