Member Avatar for rockyman

I am taking a computer science course and it is very basic.

My question:

If an algorithm takes 5n log2 n + 3n^2 + 4n+ 500 steps in the worse case state its complexity using Big- Oh Notation.

I don't have any clue on how to solve this problem.

Any help will be appreciated.

  • 3 Contributors
  • 3 Replies
  • 57 Views
  • 1 Week Discussion Span
  • Latest Post Latest Post by rohit saroha
Member Avatar for Rashakil Fol

Do you know what big O notation means?

Member Avatar for rockyman

I don't know what big oh notation means.

I would really appreciate it if you can explain to me what big oh notation means and guide me on how to solve the question

Thanks.

Member Avatar for rohit saroha

big oh notation is an upper bound for a function f(n) such that
f(n)<=c(g(n)) where n>=n0
here n0,c are witnesses.
and f(n) will belong to the set of g(n),if it satifies the above condition.
i,hope it will help you out to solve your problem

Be a part of the DaniWeb community

We're a friendly, industry-focused community of developers, IT pros, digital marketers, and technology enthusiasts meeting, networking, learning, and sharing knowledge.