title: Find Index Given Fibonacci Number Constant Time
signature: function find_index_given_fibonacci_number_constant_time(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(5, 5);
      @printf("TEST-0...%s\n",result);
      
      result = driver(19, 8);
      @printf("TEST-1...%s\n",result);
      
      result = driver(7, 6);
      @printf("TEST-2...%s\n",result);
      
      result = driver(94, 12);
      @printf("TEST-3...%s\n",result);
      
      result = driver(58, 11);
      @printf("TEST-4...%s\n",result);
      
      result = driver(65, 11);
      @printf("TEST-5...%s\n",result);
      
      result = driver(69, 11);
      @printf("TEST-6...%s\n",result);
      
      result = driver(96, 12);
      @printf("TEST-7...%s\n",result);
      
      result = driver(80, 11);
      @printf("TEST-8...%s\n",result);
      
      result = driver(14, 8);
      @printf("TEST-9...%s\n",result);
      
  end
  
  main()
source_py: def find_index_given_fibonacci_number_constant_time(n):
      if (n <= 1):
          return n
      a = 0
      b = 1
      c = 1
      res = 1
      while (c < n):
          c = (a + b)
          res = (res + 1)
          a = b
          b = c
      return res
source_cpp: int find_index_given_fibonacci_number_constant_time(int n) {
    if ( n <= 1 ) return n;
    int a = 0, b = 1, c = 1;
    int res = 1;
    while ( c < n ) {
      c = a + b;
      res ++;
      a = b;
      b = c;
    }
    return res;
  }