Jia Tse
www.egr.unlv.edu/~jjtse



void sort(){	//insertion sort
	for (int i=1; i<numOfString; i++){
		
		if (sortedness[i][1]  <  sortedness[i-1][1]){
			int j = i-1;
			while (j > 0  &&  sortedness[i][1] < sortedness[j][1]){
				j--;
			}


			if (sortedness[i][1] >= sortedness[j][1]){
				j++;
			}
			for (int k=i; k>j; k--){
			//	cout <<" swapping :"<<sortedness[k][1]<<","<<sortedness[k-1][1]<<endl;
				int temp1 = sortedness[k][1];
				int temp0 = sortedness[k][0];
				sortedness[k][1] = sortedness[k-1][1];
				sortedness[k][0] = sortedness[k-1][0];
				sortedness[k-1][0] = temp0;
				sortedness[k-1][1] = temp1;			
			}
			
		}	
	}
}