in O(n logn) by simple sorting only 
IntuitionApproachComplexity
Time complexity:

Space complexity:
Code
# Intuition
<!-- Describe your first thoughts on how to solve this problem. -->

# Approach
<!-- Describe your approach to solving the problem. -->

# Complexity
- Time complexity:
<!-- Add your time complexity here, e.g. $$O(n)$$ -->

- Space complexity:
<!-- Add your space complexity here, e.g. $$O(n)$$ -->

# Code
```cpp []
class Solution {
public:
    int findValueOfPartition(vector<int>& nums) {
        sort(nums.begin(),nums.end());
        int x=INT_MAX;
        if (nums.size()==2) return abs(nums[0]-nums[1]);
        if (nums.size()==1) return nums[0];
        int y=0;
        for (int i=0; i<nums.size()-1; i++){
            y=abs(nums[i]-nums[i+1]);
            x=min(y,x);
        }
        return x;
    }
};
```
['C++']