private int findNext(int input[], int start, boolean isPositive) {
        for (int i = start; i < input.length; i++) {
            if ((isPositive && input[i] >= 0) || (!isPositive && input[i] < 0)) {
                return i;
            }
        }
        return -1;
    }
Date 12/31/2015
@author Tushar Roy

Given an array of positive and negative integers arrange them alternatively maintaining initial order.
If there are more +ve or -ve integer then push them to the end together.

Time complexity is O(n)
Space complexity is O(1)

http://www.geeksforgeeks.org/rearrange-array-alternating-positive-negative-items-o1-extra-space/
src/com/interview/array/PositiveAndNegativeNumberAlternativelyMaintainingOrder.java