<awangdev>Interleaving Positive and Negative Numbers_1.java
public void rerange(int[] A) {
        if (A == null || A.length <= 1) {
            return;
        }
        Arrays.sort(A);
        int start = 0;
        int end = A.length - 1;
        if (A.length % 2 != 0) {
            if (A[(start + end) / 2] >= 0) {
                end--;
            } else {
                start++;
            }    
        }
        
        while (start < end) {
            int temp = A[start];
            A[start] = A[end];
            A[end] = temp;
            start += 2;
            end -= 2;
        }
    }
public void var_0 ( int [ ] var_1 ) {
  if ( var_1 == null || var_1 . length <= 1 ) {
    return ;
  }
  Arrays . sort ( var_1 ) ;
  int var_8 = 0 ;
  int var_9 = var_1 . length - 1 ;
  if ( var_1 . length % 2 != 0 ) {
    if ( var_1 [ ( var_8 + var_9 ) / 2 ] >= 0 ) {
      var_9 -- ;
    }
    else {
      var_8 ++ ;
    }
  }
  while ( var_8 < var_9 ) {
    int var_11 = var_1 [ var_8 ] ;
    var_1 [ var_8 ] = var_1 [ var_9 ] ;
    var_1 [ var_9 ] = var_11 ;
    var_8 += 2 ;
    var_9 -= 2 ;
  }
}
