title: Analysis Of Algorithms Set 2 Asymptotic Analysis
signature: analysisOfAlgorithmsSet2AsymptoticAnalysis :: [Integer] -> Integer -> Integer -> Integer
  analysisOfAlgorithmsSet2AsymptoticAnalysis arr n x = 
test_code: import Text.Printf
  import Control.Exception (catch, SomeException)
  import Data.Typeable
  import qualified Data.List as List
  import qualified Data.Map as Map
  import qualified Data.Set as Set
  
  -- SOLUTION CODE
  -- ============================================
  
  PLACEHOLDER_CODE_BODY
  
  -- TESTING CODE 
  -- ============================================
  validateSolution :: Integer -> Integer -> Bool
  validateSolution actual expected = do
      actual == expected
  
  
  driver :: [Integer] -> Integer -> Integer -> Integer -> String
  driver arr n x expected = do
      if (validateSolution (PLACEHOLDER_FN_NAME arr n x) expected)
          then "PASSED"
      else "FAILED"
  
  main = do
      printf "TEST-0...%s\n" (driver ([4, 5, 5, 11, 13, 14, 15, 19, 22, 22, 23, 26, 29, 29, 36, 44, 48, 49, 65, 65, 67, 68, 70, 76, 79, 79, 81, 85, 88, 91, 91, 92, 92, 97]) (17) (5) (1) )
  
      printf "TEST-1...%s\n" (driver ([-24, -78, -32, -48, 0, 4, -42]) (4) (0) (-1) )
  
      printf "TEST-2...%s\n" (driver ([0, 0, 0, 0, 0, 0, 0, 1, 1, 1, 1]) (6) (0) (0) )
  
      printf "TEST-3...%s\n" (driver ([38, 14, 75, 16, 91, 11, 98, 43, 67, 9, 21, 10, 82, 72, 32, 81, 48, 60, 2, 91, 10, 90, 12, 83]) (17) (75) (2) )
  
      printf "TEST-4...%s\n" (driver ([-92, -92, -82, -80, -76, -66, -64, -64, -56, -48, -38, -38, -34, -32, -32, -10, -8, -6, -2, 0, 8, 10, 18, 20, 22, 22, 30, 34, 38, 38, 38, 44, 50, 52, 56, 64, 64, 66, 70, 76, 88]) (25) (25) (-1) )
  
      printf "TEST-5...%s\n" (driver ([0, 1, 1, 0, 0, 1, 1, 0, 0, 0, 1, 1, 1, 1]) (11) (-1) (-1) )
  
      printf "TEST-6...%s\n" (driver ([1, 4, 4, 4, 4, 8, 12, 13, 14, 14, 22, 25, 25, 27, 29, 33, 36, 38, 40, 40, 40, 41, 47, 47, 47, 48, 48, 50, 51, 52, 52, 52, 55, 56, 59, 59, 62, 64, 66, 77, 82, 84, 90, 91, 91, 93]) (38) (4) (1) )
  
      printf "TEST-7...%s\n" (driver ([-90, -60, -58, -72, 92, 54, -32, -70, -94, 18, 64, -90, -90, -56, 82, -14, -74, -96, -90, -8, -48, 76, -28, 10, -52, -8, -46, -32, 82, 46, 58, 92, 4, 48, -96, -66, 60, 60, 62, -68]) (22) (22) (-1) )
  
      printf "TEST-8...%s\n" (driver ([0, 0, 0, 0, 0, 0, 1, 1, 1, 1]) (8) (8) (-1) )
  
      printf "TEST-9...%s\n" (driver ([42, 17, 77, 96, 72, 36, 74, 97, 7, 94, 80, 7, 27, 58, 49, 81, 51, 9]) (16) (11) (-1) )
  
source_py: def analysis_of_algorithms_set_2_asymptotic_analysis(arr, n, x):
      i = 0
      for i in range(i, n):
          if (arr[i] == x):
              return i
      return (- 1)
source_cpp: int analysis_of_algorithms_set_2_asymptotic_analysis(vector<int> arr, int n, int x) {
    int i;
    for ( i = 0;
    i < n;
    i ++ ) {
      if ( arr [ i ] == x ) return i;
    }
    return - 1;
  }