C++ | | Easy Solution | | Sorting and finding the minimum difference
Intuition\n Describe your first thoughts on how to solve this problem. \n\n# Approach\n Describe your approach to solving the problem. \nSorting\n\n# Complexity
# Intuition\n<!-- Describe your first thoughts on how to solve this problem. -->\n\n# Approach\n<!-- Describe your approach to solving the problem. -->\nSorting\n\n# Complexity\n- Time complexity: O(n)\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 {\npublic:\n    int findValueOfPartition(vector<int>& nums) {\n       sort(nums.begin(),nums.end());\n        \n        int ans=INT_MAX;\n        \n       for(int i=0;i<nums.size()-1;i++){\n           if(abs(nums[i] - nums[i+1]) < ans ){\n               ans=abs(nums[i] - nums[i+1]);\n           }\n       }\n        \n     \n        return ans;\n    }\n};\n```
['C++']