Answer Happy

Posted: **Fri May 20, 2022 4:42 pm**

: What Is The Worst Case Computational Complexity Of The Following Code Snippet In Terms Of Big O Notation Int I 0 N 5 1 (31.34 KiB) Viewed 16 times

What is the worst case computational complexity of the following code snippet in terms of Big O notation? int i 0, n = 5; if (i <n) print "less" else print "more or equal" O (n^2) (n squared) O 0(1) O O(nlogn) O O(n) O O(logn)