Algorithms/JavaAlgorithms
1
0
Fork 0
Code Issues Pull Requests Actions Packages Projects Releases Wiki Activity

Update HeapSort.java

Browse Source
This commit is contained in:
Shyam Thiagarajan 2016-10-08 13:43:51 -04:00 committed by GitHub
parent 6f51755256
commit a400f600ad
1 changed files with 2 additions and 4 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

6
HeapSort.java
View File

@ -70,10 +70,8 @@ public class HeapSort {
private void heapSubtree(int rootIndex, int lastChild) { private void heapSubtree(int rootIndex, int lastChild) {
int leftIndex = rootIndex * 2 + 1; int leftIndex = rootIndex * 2 + 1;
int rightIndex = rootIndex * 2 + 2; int rightIndex = rootIndex * 2 + 2;
boolean hasLeftChild = leftIndex <= lastChild;
boolean hasRightChild = rightIndex <= lastChild;
int root = this.heap[rootIndex]; int root = this.heap[rootIndex];
if (hasRightChild) { if (rightIndex <= lastChild) { // if has right and left children
int left = this.heap[leftIndex]; int left = this.heap[leftIndex];
int right = this.heap[rightIndex]; int right = this.heap[rightIndex];
if (left < right && left < root) { if (left < right && left < root) {
@ -83,7 +81,7 @@ public class HeapSort {
this.swap(rightIndex, rootIndex); this.swap(rightIndex, rootIndex);
this.heapSubtree(rightIndex, lastChild); this.heapSubtree(rightIndex, lastChild);
} }
} else if (hasLeftChild) { // if no right, but has left } else if (leftIndex <= lastChild) { // if no right child, but has left child
int left = this.heap[leftIndex]; int left = this.heap[leftIndex];
if (left < root) { if (left < root) {
this.swap(leftIndex, rootIndex); this.swap(leftIndex, rootIndex);