Which algorithm will perform better ? O(n^2) or O(n^3)

1. O(n^2)
2. O(n^3)
3. Depends upon problem instance.
4. Can't say.

• o(n^2), as it wil take less time
• 10 years agoHelpfull: Yes(1) No(0)
• 1. O(n^2) it is taken less time compair then o(n^3)
• 10 years agoHelpfull: Yes(0) No(0)
• But what about option 3 ?
• 10 years agoHelpfull: Yes(0) No(0)
• 0(n^2)because n^2 is less than n^3
  
• 9 years agoHelpfull: Yes(0) No(0)
• O(n^2) will be better because Time complexity of n^2 is less than n^3
• 9 years agoHelpfull: Yes(0) No(0)