title: Next Power Of 2
signature: function next_power_of_2(n)
test_code: using Printf
  
  # SOLUTION CODE
  # ============================================
  PLACEHOLDER_CODE_BODY
  
  # TESTING CODE 
  # ============================================
  function validate_solution(actual, expected)
      return actual == expected
  end
  
  function driver(n, expected)
      try
  
          if validate_solution(PLACEHOLDER_FN_NAME(n), expected)
              return "PASSED";
          end
          return "FAILED";
      catch exception_obj
          return string(Base.typename(typeof(exception_obj)).wrapper);
      end
  end
  
  function main()
      
      result = driver(74, 128);
      @printf("TEST-0...%s\n",result);
      
      result = driver(70, 128);
      @printf("TEST-1...%s\n",result);
      
      result = driver(85, 128);
      @printf("TEST-2...%s\n",result);
      
      result = driver(78, 128);
      @printf("TEST-3...%s\n",result);
      
      result = driver(71, 128);
      @printf("TEST-4...%s\n",result);
      
      result = driver(32, 32);
      @printf("TEST-5...%s\n",result);
      
      result = driver(97, 128);
      @printf("TEST-6...%s\n",result);
      
      result = driver(90, 128);
      @printf("TEST-7...%s\n",result);
      
      result = driver(64, 64);
      @printf("TEST-8...%s\n",result);
      
      result = driver(48, 64);
      @printf("TEST-9...%s\n",result);
      
  end
  
  main()
source_py: def next_power_of_2(n):
      count = 0
      if (n and (not (n & (n - 1)))):
          return n
      while (n != 0):
          n >>= 1
          count += 1
      return (1 << count)
source_cpp: unsigned int next_power_of_2(unsigned int n) {
    unsigned count = 0;
    if ( n && ! ( n & ( n - 1 ) ) ) return n;
    while ( n != 0 ) {
      n >>= 1;
      count += 1;
    }
    return 1 << count;
  }