What are some common conversational terms used when discussing the BigO notation?

What are some common conversational terms used when discussing the BigO notation?

I think this wold be a good way to give me more exposure to learn the meaning of common terms used when discussing the BigO notation.

Please provide as many as come to mind...

curiouswebsterSoftware EngineerAsked:
Who is Participating?
I wear a lot of hats...

"The solutions and answers provided on Experts Exchange have been extremely helpful to me over the last few years. I wear a lot of hats - Developer, Database Administrator, Help Desk, etc., so I know a lot of things but not a lot about one thing. Experts Exchange gives me answers from people who do know a lot about one thing, in a easy to use platform." -Todd S.

kaufmed   ( ͡° ͜ʖ ͡°)*whispers*  I C# people.Commented:
Unless your talking to students in your Comp. Sci. class, it's rare to discuss big-O in the real world. (By real-world, I mean more the line-of-business sector. Maybe in video game design or NASA/Tesla they care more about big-O.) That said, "memoization" is a term I remember from class. The different kinds of growth--exponential, linear, logarithmic, etc.--are relevant.

Experts Exchange Solution brought to you by

Your issues matter to us.

Facing a tech roadblock? Get the help and guidance you need from experienced professionals who care. Ask your question anytime, anywhere, with no hassle.

Start your 7-day free trial
  1. If n is a very large number, so large that the Big Oh notation is applicable, then what happens to the performance or number of operations if n is doubled?
  2. Your algorithm sucks. Big Oh is O(n-cubed), and I read that we should be able to get it down to O(n-squared). Don't go home until you come up with the algorithm and analysis report proving I am right.
>> it's rare to discuss big-O in the real world
What, you don't discuss big-O with your drinking buddies!! Come on, confess up.
Angular Fundamentals

Learn the fundamentals of Angular 2, a JavaScript framework for developing dynamic single page applications.

kaufmed   ( ͡° ͜ʖ ͡°)*whispers*  I C# people.Commented:
I assumed this was for loose conversation within a computer algorithm oriented project.

3. You tell me that we get good performance O-log(n), but you didn't tell me what the constants are. For our needs, we'd be better off with O(n log n) with a much smaller constant. If we expand 1000 times in the future, we can reconsider, but practically speaking, your analysis although correct, is not applicable to our current needs.

4. What is the value N, such that n > N for your expression of Big-Oh to be applicable?
curiouswebsterSoftware EngineerAuthor Commented:
It's more than this solution.Get answers and train to solve all your tech problems - anytime, anywhere.Try it for free Edge Out The Competitionfor your dream job with proven skills and certifications.Get started today Stand Outas the employee with proven skills.Start learning today for free Move Your Career Forwardwith certification training in the latest technologies.Start your trial today
Web Development

From novice to tech pro — start learning today.