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:

answer:

i lost in getting someone back.

i learned that people are really two-faced and no matter how angelic someone appears they always have a devil side and that you cant trust anyone anymore no matter how dear they are to you.

if your wondering who it waz it waz mah still miss her tho

~batmans wife dun dun