answersLogoWhite

0


Best Answer

Advantage

  • It is possible to compare of two algorithms
  • with running times
  • Constants can be ignored.
  • Lower orUnits are not imder terms are ignored
User Avatar

Wiki User

11y ago
This answer is:
User Avatar

Add your answer:

Earn +20 pts
Q: What are advantages and disadvantages of big o notation?
Write your answer...
Submit
Still have questions?
magnify glass
imp
Related questions

What is the difference between big o and omega notation in c plus plus?

The difference between Big O notation and Big Omega notation is that Big O is used to describe the worst case running time for an algorithm. But, Big Omega notation, on the other hand, is used to describe the best case running time for a given algorithm.


What are the advantages and disadvantages about finger joint?

No idea!! :O that's handy


What are the advantages and disadvantages of a finger joints?

The advantages of a Finger Joint is 'Go kill urself and die!'


What is asymtotic notations?

aka big O notation e.g. 2*x^2 = O(x^2)


What is the connection between Theta and Big-O notation?

Big O gives an upper bound whereas big theta gives both an upper bound and a lower bound.


What are the advantages and disadvantages of blood types?

I can only answer one blood type of the question: Type O. Anyone can get type O blood, but O bloods can only take O blood.


Advantages and disadvantages of living in Winnipeg?

an advantge of living in Winnipeg is that you can walk places insted of using your car , its not o


Explain big O and big omega notations.?

omega notation please see this website http://en.wikipedia.org/wiki/Merge_sort


What were the advantages and disadvantages for the Maya of living in the rain forest?

They liked pie and cheddar cheese, this helped them with food - Chris get


What is big-o notation for describing time complexity of algorithm?

Big O notation allows to specify the complexity of an algorithm in a simple formula, by dismissing lower-order variables and constant factors.For example, one might say that a sorting algorithm has O(n * lg(n)) complexity, where n is the number of items to sort.Big O notation is used in Computer Science to describe the performance or complexity of an algorithm. Big O specifically describes the worst-case scenario, and can be used to describe the execution time required or the space used (e.g. in memory or on disk) by an algorithm.


What is the notation of kingside castling?

O-O


What are the Advantages and disadvatages of nylon?

It is an inexpensive material. It can be woven and spun in many different ways. One big disadvantage is that it melts when exposed to high heat.