$//$ Remove the minimum in the sorted array

$//$

$//$ As our array is sorted in the increasing order, to remove the

$//$ minimum, we just remove the first element in the array. It is like

$//$ shifting the array to the left by one element.

$//$ Because we are doing shifting, in each iteration, we use two

$//$ values, one at index i$,$ the other at index i$+1.$

$//$ To prevent us from going over the boundary of array, the following

$//$ offset variable should be set as the correct value.

int offset $=0$;

$//$ In this for loop, we move the element at i $+1$ to the position i

for $()$

$\{$

$//$ Move array$[$i $+1]$ to array$[$i$]$

$\}$

$//$ The last element will be set as zero. Remember the greatest index

$//$ should be array.length $-1.$

$//-->$