<awangdev>[lint]. Heapify_2.java
public void heapify(int[] A) {
    	if (A == null || A.length == 0) {
    		return;
    	}
    	int child = 0;
    	int currId = 0;
    	int leftId = 0;
    	int rightId = 0;
    	int n = A.length;
    	for (int i = n/2 - 1; i >= 0; i--) {
    		currId = i;
    		while (currId * 2 + 1 < n) {
    			leftId = currId * 2 + 1;
    			rightId = currId * 2 + 2;
    			if (rightId >= n || A[leftId] <= A[rightId]) {
    				child = leftId;
    			} else {
    				child = rightId;
    			}
    			if (A[currId] <= A[child]) {
    				break;
    			} else {
    				int temp = A[currId];
    				A[currId] = A[child];
    				A[child] = temp;
    			}
    			currId = child;
    		}

    	}
    }
public void var_0 ( int [ ] var_1 ) {
  if ( var_1 == null || var_1 . length == 0 ) {
    return ;
  }
  int var_5 = 0 ;
  int var_6 = 0 ;
  int var_7 = 0 ;
  int var_8 = 0 ;
  int var_9 = var_1 . length ;
  for ( int var_12 = var_9 / 2 - 1 ;
  var_12 >= 0 ;
  var_12 -- ) {
    var_6 = var_12 ;
    while ( var_6 * 2 + 1 < var_9 ) {
      var_7 = var_6 * 2 + 1 ;
      var_8 = var_6 * 2 + 2 ;
      if ( var_8 >= var_9 || var_1 [ var_7 ] <= var_1 [ var_8 ] ) {
        var_5 = var_7 ;
      }
      else {
        var_5 = var_8 ;
      }
      if ( var_1 [ var_6 ] <= var_1 [ var_5 ] ) {
        break ;
      }
      else {
        int var_13 = var_1 [ var_6 ] ;
        var_1 [ var_6 ] = var_1 [ var_5 ] ;
        var_1 [ var_5 ] = var_13 ;
      }
      var_6 = var_5 ;
    }
  }
}
