简单插入排序

public void insertionSort()...{


int in, out;




for(out=1; out<nElems; out++)...{


in = out;


int temp = a[out];




while(in>0 && a[in-1]>=temp)...{


a[in] = a[in-1];


in--;


}


a[in] = temp;


}


}