Multiple choice

Let A[1,....n] be an array storing a bit (1 or 0) at each location, and f (m) is a function whose time complexity is è(m). Consider the following program fragment written in a C like language:

The complexity of this program fragment is

^$\Omega$(n²)
^$\Omega$ (nlogn) and O(n²)
^$\theta$(n)
O (n)

Reveal answer Fill a bubble to check yourself