private static void maxHeap(int[] arr, int heapSize, int index){
		int left = index * 2 + 1;
		int right = index * 2 + 2;
		
		 int largest = index;  
         if (left < heapSize && arrTemp[left] > arrTemp[index]) {  
             largest = left;  
         }  

         if (right < heapSize && arrTemp[right] > arrTemp[largest]) {  
             largest = right;  
         }  

         if (index != largest) {  
             swap(index, largest);
             maxHeap(arrTemp, heapSize, largest);  
         }  
	}// a method of heap sort