Function Insert

Arrays/05_inserting_an_element.cpp:21–34

		arr->A[arr->length++] = x; // increment the size of array and fit the elements // it will take the constant time 
}
void Insert(struct Array* arr, int index, int x) // the index at which we want to enter // and the value we want tpo enter 
{
	int i;
	for (i = arr->length; i > index; i--) // we will strat from last of the array and shift the elements upto the given index 
	{
		arr->A[i] = arr->A[i - 1]; // shifting the elements to next  // i is on some index and copy the value from previous index 
	}
	arr->A[index] = x; // set the value at the particular index 
	arr->length++; // increment the size of length 
	// work done shifting of elelmets and copying elements 
	// best case : --------------- min : O(1) // there may be zero shifting 
	// worst case : --------------- max : O(n)// there may be n shifing 

}

int main() {
	int no;