Suppose values is a sorted array of integers. Give pseudocode that describes how a new value can be inserted so that the resulting array stays sorted.

insert (array[], value, currentsize, maxsize)

{

if maxsize <=currentsize

{

return - 1

}

index = currentsize-1

while (i>=0 && array[index] > value)

{

array[index+1]=array[index]

i=i-1

}

array[i+1]=value

return 0

}

Explanation:

1: Check if array is already full, if it's full then no component may be inserted.

2: if array isn't full:

Check parts of the array ranging from last position of range towards initial range and determine position of that initial range that is smaller than the worth to be inserted. Right shift every component of the array once ranging from last position up to the position larger than the position at that smaller range was known. assign new worth to the position that is next to the known position of initial smaller component.