title: Search Insert And Delete In A Sorted Array 1
signature: searchInsertAndDeleteInASortedArray1(arr, n, key, capacity) {
test_code: import 'dart:convert';
  
  // SOLUTION CODE
  // ============================================
  PLACEHOLDER_CODE_BODY
  
  // TESTING CODE 
  // ============================================
  bool validateSolution(int actual, int expected){
      return actual.toString() == expected.toString();
  }
  
  String driver(arr, n, key, capacity, int expected){
      try
      {
          if (validateSolution(PLACEHOLDER_FN_NAME(arr, n, key, capacity), expected)){
              return "PASSED";
          }
          return "FAILED";
      }catch(exception_object){
          return exception_object.runtimeType.toString();
      }
  }
  
  int main() {
  
      print("TEST-0...${driver(
          [69], 0, 0, 0, 
          0)
      }");
  
      print("TEST-1...${driver(
          [-34, -38, -72, 90, -84, -40, 6, -52, -12, 80, -4, -58], 6, 6, 9, 
          7)
      }");
  
      print("TEST-2...${driver(
          [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 1, 1, 1, 1, 1], 13, 19, 11, 
          13)
      }");
  
      print("TEST-3...${driver(
          [96, 34, 11, 1, 36, 79, 64, 75, 75, 96, 32, 18, 25, 79, 63, 80, 90, 75, 44, 71, 48, 1, 62, 53, 17, 98], 21, 20, 13, 
          21)
      }");
  
      print("TEST-4...${driver(
          [-98, -92, -92, -84, -82, -80, -80, -74, -70, -60, -48, -42, -36, -34, -34, -34, -30, -28, -16, -6, -2, -2, 2, 12, 14, 20, 24, 40, 46, 50, 60, 66, 70, 72, 78, 82, 88, 92, 94, 94, 96], 30, 32, 28, 
          30)
      }");
  
      print("TEST-5...${driver(
          [1, 0, 1, 1, 0, 0, 1, 0, 0, 0, 1, 1, 0], 12, 9, 10, 
          12)
      }");
  
      print("TEST-6...${driver(
          [10, 12, 12, 13, 19, 20, 21, 24, 27, 37, 47, 50, 54, 58, 61, 63, 63, 68, 73, 75, 87, 90, 90, 92, 92], 12, 13, 21, 
          13)
      }");
  
      print("TEST-7...${driver(
          [-74, 62, 74, 92, -38, -28, -26, 4, 88, -68, -76, -20, -4, 12, 72, 6, 42, 36, 88, -96, -80, 90, 80, -26, -36, -72, -62, 38, -20, 40, -10, -22, -20, 38, 82, -84, 8, 26, 86, -26, 44, -72, -70, -16, -22, 18, -16, 76, -50], 37, 26, 42, 
          38)
      }");
  
      print("TEST-8...${driver(
          [1, 1, 1, 1, 1], 3, 4, 2, 
          3)
      }");
  
      print("TEST-9...${driver(
          [64, 80, 47, 58, 41, 3, 85, 96, 51, 4, 22, 89, 67, 54, 88, 15, 83, 31, 19, 24, 28, 40, 67, 37, 63, 38, 27, 14, 7, 68], 23, 24, 25, 
          24)
      }");
  
      return 0;
  }
source_py: def search_insert_and_delete_in_a_sorted_array_1(arr, n, key, capacity):
      if (n >= capacity):
          return n
      i = (n - 1)
      while ((i >= 0) and (arr[i] > key)):
          arr[(i + 1)] = arr[i]
          i -= 1
      arr[(i + 1)] = key
      return (n + 1)
source_cpp: int search_insert_and_delete_in_a_sorted_array_1(vector<int> arr, int n, int key, int capacity) {
    if ( n >= capacity ) return n;
    int i;
    for ( i = n - 1;
    ( i >= 0 && arr [ i ] > key );
    i -- ) arr [ i + 1 ] = arr [ i ];
    arr [ i + 1 ] = key;
    return ( n + 1 );
  }