big o notation examples - Wikitechy https://www.wikitechy.com/interview-questions/tag/big-o-notation-examples/ Interview Questions Mon, 13 Sep 2021 10:33:04 +0000 en-US hourly 1 https://wordpress.org/?v=6.9.4 https://www.wikitechy.com/interview-questions/wp-content/uploads/2025/10/cropped-wikitechy-icon-32x32.png big o notation examples - Wikitechy https://www.wikitechy.com/interview-questions/tag/big-o-notation-examples/ 32 32 In regards to time complexity which will perform better ω(n4) or O(n3) ? https://www.wikitechy.com/interview-questions/data-structure/in-regards-to-time-complexity-which-will-perform-better-%cf%89n4-or-on3/ https://www.wikitechy.com/interview-questions/data-structure/in-regards-to-time-complexity-which-will-perform-better-%cf%89n4-or-on3/#respond Tue, 13 Jul 2021 10:55:39 +0000 https://www.wikitechy.com/interview-questions/?p=466

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
]]> https://www.wikitechy.com/interview-questions/data-structure/in-regards-to-time-complexity-which-will-perform-better-%cf%89n4-or-on3/feed/ 0