✅✅Easy to understand|| c++|| sorting
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:O(nlogn)\n<!-- Add your time complexity here, e.g. $$O(n)$$ -->\n\n- Space complexity:O(1)\n<!-- Add your space complexity here, e.g. $$O(n)$$ -->\n\n# Code\n```\nclass Solution {\npublic:\n    string triangleType(vector<int>& nums) {\n        int n=nums.size();\n        sort(nums.begin(),nums.end());\n        if(nums[0]+nums[1]<=nums[2]){\n            return "none";\n        }\n        if(nums[0]+nums[1]==2*nums[2]){\n            return  "equilateral";\n        }\n        if(nums[1]==nums[2] || nums[0]==nums[1]){\n            return "isosceles";\n        }\n        return "scalene";\n    }\n};\n```
['Sorting', 'C++']