For the book Introduction to Algorithm 2.1-2

gistfile1.java

public static int [] getIncrease(int[] original){
        for(int j=1;j<original.length;j++){
            for(int i=0;i<original.length;i++){
                if(original[i]>original[j]&&original[i]>0){
                    //Without using temp to reduce space complexity
                    original[i]=original[j]-original[i];
                    original[j]=original[j]-original[i];
                    original[i]=original[i]+original[j];
                }
            }
        }
        return original;        
}
     
public static int [] getDecrease(int[] original){
        for(int j=1;j<original.length;j++){
            for(int i=0;i<original.length;i++){
                if(original[i]<original[j]&&original[i]>0){
                    //Without using temp to reduce space complexity
                    original[i]=original[j]-original[i];
                    original[j]=original[j]-original[i];
                    original[i]=original[i]+original[j];
                }
            }            
        }
        return original;   
}