User-friendly and efficient method
Intuition\n Describe your first thoughts on how to solve this problem. \n\n# Approach\n Describe your approach to solving the problem. \n\n# Complexity\n- Time 
# Intuition\n<!-- Describe your first thoughts on how to solve this problem. -->\n\n# Approach\n<!-- Describe your approach to solving the problem. -->\n\n# Complexity\n- Time complexity:\n<!-- Add your time complexity here, e.g. $$O(n)$$ -->\n\n- Space complexity:\n<!-- Add your space complexity here, e.g. $$O(n)$$ -->\n\n# Code\n```\nclass Solution {\n    public void convertToNewSystem(int []newSys,int []mapping ,int []nums){\n        int n=nums.length;\n        for(int j=0;j<n;j++){\n            int num=nums[j];\n            if(num==0){\n                newSys[j]=mapping[0];\n                continue;\n            }\n            int res=0;\n            int i=0;\n            while(num>0){\n                int d=num%10;\n                int newD=mapping[d];\n                res=newD*(int)Math.pow(10,i)+res;\n                num=num/10;\n                i++;\n            }\n            newSys[j]=res;\n        } \n    }\n    public int[] sortJumbled(int[] mapping, int[] nums) {\n      int n=nums.length;\n      int newSys[]=new int[n];\n      convertToNewSystem(newSys,mapping,nums);\n      Integer index[]=new Integer[n];\n      for(Integer i=0;i<n;i++){\n        index[i]=i;\n      }\n      Arrays.sort(index, new Comparator<Integer>(){\n        public int compare(Integer a,Integer b){\n            return newSys[a]-newSys[b];\n        }\n      });\n      int i=0;\n      for(int ind: index){\n        newSys[i]=nums[ind];\n        i++;\n      }\n      return newSys;\n    }\n}\n```
['Array', 'Sorting', 'Java']