public static void sortRecursion( Individual[] individuals, int i, int j )
	{
		int high = i;
		int low = j;
		Individual pivot = individuals[ high + (low - high) / 2 ];
		
		while( high <= low )
		{
			while( individuals[high].getFitness() < pivot.getFitness() )
				high++;
			while( individuals[low].getFitness() > pivot.getFitness() )
				low++;
			if( high >= low )
			{
				swap( individuals, high, low );
				high++;
				low--;
			}
		}
		
		if( high < j )
			sortRecursion( individuals, high, j );
		if( i > low)
			sortRecursion( individuals, i, low );
	}