practice #18
| @ -5,8 +5,6 @@ package com.hithomelabs.princeton1.module8; | ||||
|  * * Heap does not have any instance variables, instance variables shall be housed by, the implementation using heaps, like priority queues and heap sort | ||||
|  */ | ||||
| 
 | ||||
| import com.hithomelabs.princeton1.module5.AbstractCustomSorts; | ||||
| 
 | ||||
| public class Heap{ | ||||
| 
 | ||||
|     /* | ||||
| @ -17,7 +15,7 @@ public class Heap{ | ||||
|     } | ||||
| 
 | ||||
|     // * * Swim if element is not root, and parent is lesser than node | ||||
|     public static <T extends Comparable<T>> void swim(T[] arr, int node, int N){ | ||||
|     public static <T> void swim(T[] arr, int node, int N){ | ||||
|     } | ||||
| 
 | ||||
|     private static <T> void exch(T[] arr, int i, int j){ | ||||
|  | ||||
		Loading…
	
		Reference in New Issue
	
	Block a user