Bug 315281 update copyrights for 3.6
bundles/org.eclipse.ui.ide/src/org/eclipse/ui/internal/views/markers/MarkerSortUtil.java
}
		/* 
		 * Using Binary search to locate the parent to replace.
		 * This is worse compared to linear search as most of the 
		 * holes would replace only a few parents above them.
		 * This code has been left commented for future examination.
		 * */		
	    /*
		int top = position - first;
		int lowParent = 1;
		int highParent = 0;
		int from = holeOffset;
		while (from > top) {
			from = (from - 1) / 2;
			highParent++;
		}
		if (from != top)
			highParent--; Between, exculding topn++;
		int parentReplaceCount = -1;
		 start at lower ranges because of heap property
		int midParent = lowParent + (highParent - lowParent) / 4;
		while (lowParent <= highParent) {
			 mth parent
			int currenParentIndex = holeOffset;
			int mth = midParent;
			while (mth > 0) {
				currenParentIndex = (currenParentIndex - 1) / 2;
				mth--;
			}
			int value = comparator.compare(array[first + currenParentIndex], hole);