What's wrong with this? | TLE
Below I am using the QuickSelect which is giving TLE for large input. I wonder how the other solutions which are sorting the whole array are passing. Thanks in 
Below I am using the QuickSelect which is giving TLE for large input. I wonder how the other solutions which are sorting the whole array are passing. Thanks in advance.\n```\nclass Solution {\n    public String kthLargestNumber(String[] nums, int k) {\n        return find(nums,0,nums.length-1,nums.length-k);\n    }\n\n    String find(String[] nums, int l, int r, int k){\n        \n        while(l<r){\n            int p = partition(nums,l,r);\n            if(p<k)\n                l = p+1;\n            else if (p>k)\n                r = p-1;\n            else \n                break;\n        }\n        return nums[k];\n    }\n    \n    int partition(String nums[],int l,int r){\n        String p = nums[l];\n        while(l<r){\n            while(l<r&&comp(nums[r],p)>=0) r--;\n            nums[l] = nums[r];\n            while(l<r&&comp(nums[l],p)<=0) l++;\n            nums[r] = nums[l];\n        }\n        nums[l] = p;\n        return l;\n    }\n    \n    int comp(String s1, String s2){\n        if(s1.length()>s2.length())\n            return 1;\n        if(s1.length()<s2.length())\n            return -1;\n        return s1.compareTo(s2);\n    }\n}\n```
[]