import java.util.*;public class Main{    static int count;    static int[] result;    static int length;    static int maxCount;    public static void main(String[] args) {          int[] nums={2,5,3,4,9,1};        length=nums.length;        maxCount=2*(length-1);        result=new int[maxCount];        int[] tempResult=new int[maxCount];        deepFun(0,nums,tempResult);        for(int i=0;i
     
      maxCount){            return;        }        if(isSorted(nums)){            if(index
      
       nums[i]){                return false;            }        }        return true;    }       public static void reverse(int[] nums,int start,int end){        while(start