private static void maxHeap( Individual[] individuals, int i, int n )
	{
		int left = i * 2;
		int right = i * 2 + 1;
		int largest = 0;
		
		if( left <= n && individuals[left].getFitness() > individuals[i].getFitness() )
			largest = left;
		else
			largest = i;
		
		if( right <= n && individuals[right].getFitness() > individuals[largest].getFitness() )
			largest = right;
		if( largest != i )
		{
			swap( individuals, i, largest );
			maxHeap( individuals, largest, n );
		}
	}