Question

The code segment below prints some of the elements in an array with size n. Select an expression to

Answer 1

Answer:

int j = 1; j < array.length; j =j *2

Explanation:

j=j*2 loops have O(logn) so the running time of algorithm is O(logn).