for (int i0 = 0, i1; i0 <= iSize - 2; i0++) {
for (int i0 = 0, i1; i0 <= size - 2; i0++) {
	public void decreasingSort(		int iSize,		float[] afEigval,		float[][] aafEigvec) {		// sort eigenvalues in decreasing order, e[0] >= ... >= e[iSize-1]		for (int i0 = 0, i1; i0 <= iSize - 2; i0++) {			// locate maximum eigenvalue			i1 = i0;			float fMax = afEigval[i1];			int i2;			for (i2 = i0 + 1; i2 < iSize; i2++) {				if (afEigval[i2] > fMax) {					i1 = i2;					fMax = afEigval[i1];				}			}			if (i1 != i0) {				// swap eigenvalues				afEigval[i1] = afEigval[i0];				afEigval[i0] = fMax;				// swap eigenvectors				for (i2 = 0; i2 < iSize; i2++) {					float fTmp = aafEigvec[i2][i0];					aafEigvec[i0][i2] = aafEigvec[i2][i1];					aafEigvec[i1][i2] = fTmp;				}			}		}	}