<awangdev>31. Next Permutation_2.java
private int findHigh(int[] nums, int low) {

        int end = nums.length - 1;
        while (end > low) {
            if (nums[end] > nums[low]) return end;
            end--;
        }
        return -1;
    }
private int sample_funcname ( int [ ] var_0 , int var_1 ) {
  int var_4 = var_0 . length - 1 ;
  while ( var_4 > var_1 ) {
    if ( var_0 [ var_4 ] > var_0 [ var_1 ] ) return var_4 ;
    var_4 -- ;
  }
  return - 1 ;
}
