private void rightRotate(int input[], int start, int end) {
        int t = input[end];
        for (int i = end; i > start; i--) {
            input[i] = input[i - 1];
        }
        input[start] = t;
    }
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