title: Find The Maximum Element In An Array Which Is First Increasing And Then Decreasing
signature: func findTheMaximumElementInAnArrayWhichIsFirstIncreasingAndThenDecreasing(arr []int, low int, high 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(arr []int, low int, high int, expected int) string {
      if validateSolution(PLACEHOLDER_FN_NAME(arr, low, high),expected) {
              return "PASSED"
      }
      return "FAILED"
  
  }
  
  func main() {
  
      // Use imports to avoid undefined errors
      var _ = reflect.DeepEqual
      _ = math.Abs
      _ = sort.Sort
      result := ""
      result = driver([]int{11, 15, 16, 19, 24, 25, 26, 28, 34, 34, 43, 61, 63, 66, 67, 72, 77, 79, 81, 83, 87, 94, 99}, 
  	15, 
  	21, 94)
      fmt.Printf("TEST-0...%s\n", result)
      
      result = driver([]int{8, 92}, 
  	1, 
  	1, 92)
      fmt.Printf("TEST-1...%s\n", result)
      
      result = driver([]int{0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1}, 
  	23, 
  	15, 1)
      fmt.Printf("TEST-2...%s\n", result)
      
      result = driver([]int{84, 39, 92, 89, 38, 75, 18, 39, 83, 67, 41, 46, 49, 27}, 
  	8, 
  	13, 92)
      fmt.Printf("TEST-3...%s\n", result)
      
      result = driver([]int{-98, -94, -88, -84, -74, -72, -58, -52, -48, -48, -46, -42, -42, -32, -30, -30, -18, -10, -8, -8, -6, -4, 4, 6, 28, 30, 34, 38, 44, 48, 56, 58, 60, 64, 86}, 
  	31, 
  	34, 86)
      fmt.Printf("TEST-4...%s\n", result)
      
      result = driver([]int{0, 1, 0}, 
  	2, 
  	2, 1)
      fmt.Printf("TEST-5...%s\n", result)
      
      result = driver([]int{5, 9, 10, 16, 18, 19, 23, 24, 26, 33, 37, 44, 46, 54, 55, 57, 58, 59, 63, 64, 70, 75, 77, 81, 83, 84, 85, 85, 88, 89, 96, 97, 99}, 
  	20, 
  	31, 97)
      fmt.Printf("TEST-6...%s\n", result)
      
      result = driver([]int{86, 20, -50, 74, -78, 86}, 
  	3, 
  	5, 86)
      fmt.Printf("TEST-7...%s\n", result)
      
      result = driver([]int{0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1}, 
  	19, 
  	18, 1)
      fmt.Printf("TEST-8...%s\n", result)
      
      result = driver([]int{16, 57, 65, 61, 17, 63, 7, 35, 69, 91, 30, 44, 99, 80, 6, 80, 56, 8, 84, 95, 20, 73, 30, 62, 77, 26, 66, 61, 61, 45}, 
  	28, 
  	22, 99)
      fmt.Printf("TEST-9...%s\n", result)
      
          
  }
source_py: def find_the_maximum_element_in_an_array_which_is_first_increasing_and_then_decreasing(arr, low, high):
      max = arr[low]
      i = low
      for i in range((high + 1)):
          if (arr[i] > max):
              max = arr[i]
      return max
source_cpp: int find_the_maximum_element_in_an_array_which_is_first_increasing_and_then_decreasing(vector<int> arr, int low, int high) {
    int max = arr [ low ];
    int i;
    for ( i = low + 1;
    i <= high;
    i ++ ) {
      if ( arr [ i ] > max ) max = arr [ i ];
      else break;
    }
    return max;
  }