Method add

Algorithm/code/Heap.java:12–21

(int n)

	}
	
	static void add(int n) {
		arr[++heapSize] = n;
		
		for (int i = heapSize; i > 1; i/=2) {
			if(arr[i] < arr[i/2]) {
				swap(i/2, i);
			}
			else break;
		}
	}
	static int remove(int[] arr) {
		if(heapSize == 0) return 0;