Analyze the efficiency of the algorithm used in the code. Use O-notation.

 

class Solution 

{  public int[] countBits(int n) 

{    int[] out = new int[n + 1];    

for (int i = 0; i <= n; i++) {      

out[i] = out[i / 2] + i % 2;    

}    return out;

  }

 }

Answer rating: 100% (QA)

This algorithm generates an array where each element represents the count of set bits ... View the full answer