Commit 1f91a98

committed

refactoring

1 parent 39be70c commit 1f91a98Copy full SHA for 1f91a98

File tree

-4

lines changed

src/main/java/ir/sk/adt/datastructure/tree/binarytree/heaptree
- MaxBinaryHeap.java

-4

lines changed

Lines changed: 4 additions & 4 deletions

Original file line number	Diff line number	Diff line change
`@@ -91,7 +91,7 @@ public int max() {`
`91`	`91`	`@TimeComplexity("O(Log n)")`
`92`	`92`	`public int extractMax() {`
`93`	`93`	`int max = array[0];`
`94`		`- swap(0, size - 1);`
	`94`	`+ swapWithIndex(0, size - 1);`
`95`	`95`	`array[size - 1] = 0; // Avoid loitering.`
`96`	`96`
`97`	`97`	`heapifyDown(0);`
`@@ -119,7 +119,7 @@ public void heapifyDown(int index) {`
`119`	`119`	`maxIndex = right;`
`120`	`120`
`121`	`121`	`if (maxIndex != index) {`
`122`		`- swap(index, maxIndex);`
	`122`	`+ swapWithIndex(index, maxIndex);`
`123`	`123`	`heapifyDown(maxIndex);`
`124`	`124`	`}`
`125`	`125`	`}`
`@@ -149,12 +149,12 @@ private void heapifyUp() {`
`149`	`149`	`int current = size;`
`150`	`150`
`151`	`151`	`while (array[current] > array[getParentIndex(current)]) {`
`152`		`- swap(current, getParentIndex(current));`
	`152`	`+ swapWithIndex(current, getParentIndex(current));`
`153`	`153`	`current = getParentIndex(current);`
`154`	`154`	`}`
`155`	`155`	`}`
`156`	`156`
`157`		`- private void swap(int index1, int index2) {`
	`157`	`+ private void swapWithIndex(int index1, int index2) {`
`158`	`158`	`int tmp = array[index1];`
`159`	`159`	`array[index1] = array[index2];`
`160`	`160`	`array[index2] = tmp;`

Comments

(0)