Question: What is the complexity of the following algorithm public int m 1 ( int x [ ] ) { int s = 0 ; (

What is the complexity of the following algorithm
public int m1(int x[]){
int s=0;
(int i=x.length-1;i>=0;i=i/2)
s=s+x[j];
return s;
}
O(n)
O(n2)
O(log n)
O(1)

Step by Step Solution

There are 3 Steps involved in it

1 Expert Approved Answer
Step: 1 Unlock blur-text-image
Question Has Been Solved by an Expert!

Get step-by-step solutions from verified subject matter experts

Step: 2 Unlock
Step: 3 Unlock

Students Have Also Explored These Related Databases Questions!