A[]={0,400,800,900,999}

public static void mySort(int[] A, int p ,int q){

int[] scratch = new int[q-p+1];

for (int i = 0; i < A.length; i++) {

scratch[A[i]-p] = A[i];

}

int counter = 0; // c=0

for (int i = 0; i < scratch.length; i++) { //i

if (scratch[i] > 0){ //s[i]>0

A[counter] = scratch[i]; //A[c] = s[i]

Counter++; //c++

}

i need to find loop invariant and initialization, maintenance, and termination.

at the moment I think the invariant is A(counter)=scratch[i] but Im not sure about invariants