title: Find Index Given Fibonacci Number Constant Time
signature: func findIndexGivenFibonacciNumberConstantTime(n int) int {
test_code: package main
  
  import (
      "fmt"
      "reflect"
      "math"
      "sort"
  )
  
  // SOLUTION CODE
  // ===================================
  PLACEHOLDER_CODE_BODY
  
  // TESTING CODE
  // ===================================
  func validateSolution(actual int, expected int) bool {
      return reflect.DeepEqual(actual,expected)
  }
  
  func driver(n int, expected int) string {
      if validateSolution(PLACEHOLDER_FN_NAME(n),expected) {
              return "PASSED"
      }
      return "FAILED"
  
  }
  
  func main() {
  
      // Use imports to avoid undefined errors
      var _ = reflect.DeepEqual
      _ = math.Abs
      _ = sort.Sort
      result := ""
      result = driver(5, 5)
      fmt.Printf("TEST-0...%s\n", result)
      
      result = driver(19, 8)
      fmt.Printf("TEST-1...%s\n", result)
      
      result = driver(7, 6)
      fmt.Printf("TEST-2...%s\n", result)
      
      result = driver(94, 12)
      fmt.Printf("TEST-3...%s\n", result)
      
      result = driver(58, 11)
      fmt.Printf("TEST-4...%s\n", result)
      
      result = driver(65, 11)
      fmt.Printf("TEST-5...%s\n", result)
      
      result = driver(69, 11)
      fmt.Printf("TEST-6...%s\n", result)
      
      result = driver(96, 12)
      fmt.Printf("TEST-7...%s\n", result)
      
      result = driver(80, 11)
      fmt.Printf("TEST-8...%s\n", result)
      
      result = driver(14, 8)
      fmt.Printf("TEST-9...%s\n", result)
      
          
  }
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;
  }