In regards to time complexity which will perform better ω(n4) or O(n3) ?

A. ω(n4)

B. O(n3)

C. Both Equally

D. Can’t be said

Answer : A. ω(n4)

Explanation :

  • O indicates the worst case complexity of an algorithm
  • ω indicates the best case complexity of an algorithm

Categorized in:

Tagged in:

, , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , ,